Fetching the paper…
Reading the bibliography…
Compressed sensing is a technique for finding sparse solutions to underdetermined linear systems.
The Diameters of Octahedra
B. S. Kashin · 1975
Earlier work this paper cites.
The Eigenvalues of Random Symmetric Matrices
Z. Füredi and J. Komlós · 1981
Earlier work this paper cites.
Simple Construction of Almost k k -wise Independent Random Variables
N. Alon, O. Goldreich, J. Hastad, and R. Peralta · 1990
Earlier work this paper cites.
Finding a Large Hidden Clique in a Random Graph
N. Alon, M. Krivelevich, and B. Sudakov · 1998
Earlier work this paper cites.
On the Concentration of Eigenvalues of Random Symmetric Matrices
N. Alon, M. Krivelevich, and V. Vu · 2002
Earlier work this paper cites.
Decoding by Linear Programming
E. J. Candès and T. Tao · 2005
Earlier work this paper cites.
Stable Signal Recovery from Incomplete and Inaccurate Measurements
E. J. Candès, J. K. Romberg, and T. Tao · 2006
Earlier work this paper cites.
Testing k k -wise and almost k k -wise independence
N. Alon, A. Andoni, T. Kaufman, K. Matulef, R. Rubinfeld, and N. Xie · 2007
Earlier work this paper cites.
Deterministic Constructions of Compressed Sensing Matrices
R. A. DeVore · 2007
Cited alongside, same era.
Open question: deterministic UUP matrices
T. Tao · 2007
Cited alongside, same era.
The Restricted Isometry Property and its Implications for Compressed Sensing
E. J. Candès · 2008
Cited alongside, same era.
Optimal Solutions for Sparse Principal Component Analysis
A. d’Aspremont, F. Bach, and L. El Ghaoui · 2008
Cited alongside, same era.
Explicit Constructions of RIP Matrices and Related Problems
J. Bourgain, S. J. Dilworth, K. Ford, S. Konyagin, and D. Kutzarova · 2010
Cited alongside, same era.
Inapproximability of densest κ \kappa -subgraph from average-case hardness
N. Alon, S. Arora, R. Manokaran, D. Moshkovitz, and O. Weinstein · 2011
Testing the Nullspace Property using Semidefinite Programming
A. d’Aspremont and L. El Ghaoui · 2011
Later among the works it cites.
How hard is it to approximate the best Nash equilibrium?
E. Hazan and R. Krauthgamer · 2011
Later among the works it cites.
On Verifiable Sufficient Conditions for Sparse Signal Recovery via ℓ 1 \ell_{1} Minimization
A. Juditsky and A. Nemirovski · 2011
Later among the works it cites.
On the certification of the restricted isometry property
P. Koiran and A. Zouzias · 2011
Later among the works it cites.
Certifying the restricted isometry property is hard
A. Bandeira, E. Dobriban, D. Mixon, and W. Sawin · 2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Breaking the k 2 k^{2} Barrier for Explicit RIP Matrices
J. Bourgain, S. J. Dilworth, K. Ford, S. Konyagin, and D. Kutzarova · 2011
Cited alongside, same era.
Closest in time.
M. Pfetsch and A. Tillmann · 2012
Closest in time.
Introduction to the Non-asymptotic Analysis of Random Matrices
R. Vershynin · 2012
Closest in time.