Martin J. Strauss

40 papers A* 5B 1Misc 2Journal 20Unranked 10
YearRankTypeTitle / Venue / Authors
2018 — ch.
Histograms on Streams.
Encyclopedia of Database Systems (2nd ed.)
Martin J. Strauss
2017 J jnl
Fair Pipelines.
CoRR
Amanda Bower, Sarah N. Kitchen, Laura Niss, Martin J. Strauss, Alexander Vargas, Suresh Venkatasubramanian
2017 J jnl
For-All Sparse Recovery in Near-Optimal Time.
ACM Trans. Algorithms
Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss
2015 J jnl
What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid.
Algorithmica
Petros Boufounos, Volkan Cevher, Anna C. Gilbert, Yi Li, Martin J. Strauss
2014 — conf
For-All Sparse Recovery in Near-Optimal Time.
ICALP (1)
Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss
2014 J jnl
For-all Sparse Recovery in Near-Optimal Time.
CoRR
Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss
2013 J jnl
L2/L2-foreach sparse recovery with low risk
CoRR
Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss
2013 — conf
ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk.
ICALP (1)
Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss
2012 J jnl
Approximate Sparse Recovery: Optimizing Time and Measurements.
SIAM J. Comput.
Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss
2012 Misc conf
Recovering simple signals.
ITA
Anna C. Gilbert, Brett Hemenway, Atri Rudra, Martin J. Strauss, Mary Wootters
2012 — conf
Reusable low-error compressive sampling schemes through privacy.
SSP
Anna C. Gilbert, Brett Hemenway, Martin J. Strauss, David P. Woodruff, Mary Wootters
2012 A* conf
Sublinear time, measurement-optimal, sparse recovery for all.
SODA
Ely Porat, Martin J. Strauss
2012 — conf
What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid.
APPROX-RANDOM
Petros Boufounos, Volkan Cevher, Anna C. Gilbert, Yi Li, Martin J. Strauss
2011 — conf
Public Key Locally Decodable Codes with Short Keys.
APPROX-RANDOM
Brett Hemenway, Rafail Ostrovsky, Martin J. Strauss, Mary Wootters
2010 A* conf
Approximate sparse recovery: optimizing time and measurements.
STOC
Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss
2010 J jnl
Space-optimal heavy hitters with strong error bounds.
ACM Trans. Database Syst.
Radu Berinde, Piotr Indyk, Graham Cormode, Martin J. Strauss
2010 J jnl
Sublinear Time, Measurement-Optimal, Sparse Recovery For All
CoRR
Ely Porat, Martin J. Strauss
2009 J jnl
Approximate Sparse Recovery: Optimizing Time and Measurements
CoRR
Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss
2009 — ch.
Histograms on Streams.
Encyclopedia of Database Systems
Martin J. Strauss
2009 — conf
Near-optimal Bayesian localization via incoherence and sparsity.
IPSN
Volkan Cevher, Petros Boufounos, Richard G. Baraniuk, Anna C. Gilbert, Martin J. Strauss
2009 J jnl
Private multiparty sampling and approximation of vector combinations.
Theor. Comput. Sci.
Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright
2009 A* conf
Space-optimal heavy hitters with strong error bounds.
PODS
Radu Berinde, Graham Cormode, Piotr Indyk, Martin J. Strauss
2008 J jnl
A Tutorial on Fast Fourier Sampling.
IEEE Signal Process. Mag.
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp
2008 J jnl
Combining geometry and combinatorics: A unified approach to sparse signal recovery
CoRR
Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss
2008 — conf
Combining geometry and combinatorics: A unified approach to sparse signal recovery.
Allerton
Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss
2008 B conf
Fast Private Norm Estimation and Heavy Hitters.
TCC
Joe Kilian, André Madeira, Martin J. Strauss, Xuan Zheng
2008 Misc conf
Fundamental performance bounds for a compressive sampling system.
ICASSP
Anna C. Gilbert, Martin J. Strauss
2008 — conf
Group testing and sparse signal recovery.
ACSCC
Anna C. Gilbert, Mark A. Iwen, Martin J. Strauss
2007 J jnl
Analysis of Data Streams: Computational and Algorithmic Challenges.
Technometrics
Anna C. Gilbert, Martin J. Strauss
2007 A* conf
One sketch for all: fast algorithms for compressed sensing.
STOC
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin
2007 A* conf
Private Multiparty Sampling and Approximation of Vector Combinations.
ICALP
Yuval Ishai, Tal Malkin, Martin J. Strauss, Rebecca N. Wright
2007 — conf
Sparse Gradient Image Reconstruction Done Faster.
ICIP (2)
Ray Maleh, Anna C. Gilbert, Martin J. Strauss
2006 J jnl
Algorithmic linear dimension reduction in the l_1 norm for sparse vectors
CoRR
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin
2006 J jnl
Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit.
Signal Process.
Joel A. Tropp, Anna C. Gilbert, Martin J. Strauss
2006 J jnl
List decoding of noisy Reed-Muller-like codes
CoRR
A. Robert Calderbank, Anna C. Gilbert, Martin J. Strauss
2006 J jnl
Maintaining time-decaying stream aggregates.
J. Algorithms
Edith Cohen, Martin J. Strauss
2006 J jnl
Private Approximate Heavy Hitters
CoRR
Martin J. Strauss, Xuan Zheng
2006 J jnl
Secure multiparty computation of approximations.
ACM Trans. Algorithms
Joan Feigenbaum, Yuval Ishai, Tal Malkin, Kobbi Nissim, Martin J. Strauss, Rebecca N. Wright
2005 J jnl
Better Alternatives to OSPF Routing.
Algorithmica
Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, Martin J. Strauss
2005 — conf
Simultaneous sparse approximation via greedy pursuit.
ICASSP (5)
Joel A. Tropp, Anna C. Gilbert, Martin J. Strauss