Martin J. Strauss

Publication Activity (10 Years)

Years Active: 2005-2017
Publications (10 Years): 3

Top Topics

Compressive Sensing

Fourier Coefficients

Top Venues

ACM Trans. Algorithms

Publications

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