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.
On Talagrand’s Deviation Inequalities For Product Measures
M. Ledoux · 1996
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.
The Concentration of Measure Phenomenon
M. Ledoux · 2001
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.
Relations between Average Case Complexity and Approximation Complexity
U. Feige · 2002
Earlier work this paper cites.
More on Average Case vs Approximation Complexity
M. Alekhnovich · 2003
Cited alongside, same era.
Decoding by Linear Programming
E. J. Candès and T. Tao · 2005
Cited alongside, same era.
Stable Signal Recovery from Incomplete and Inaccurate Measurements
E. J. Candès, J. K. Romberg, and T. Tao · 2006
Cited alongside, same era.
Ruling out PTAS for Graph min-bisection, Dense k k -subgraph, and Bipartite Clique
S. Khot · 2006
Cited alongside, same era.
Deterministic Constructions of Compressed Sensing Matrices
R. A. DeVore · 2007
Cited alongside, same era.
Spectral Norm of Random Matrices
V. Vu · 2007
Cited alongside, same era.
Optimal Solutions for Sparse Principal Component Analysis
A. d’Aspremont, F. Bach, and L. El Ghaoui · 2008
Later among the works it cites.
Testing the Nullspace Property using Semidefinite Programming
A. d’Aspremont and L. El Ghaoui · 2008
Later among the works it cites.
On Verifiable Sufficient Conditions for Sparse Signal Recovery via ℓ 1 \ell_{1} Minimization
A. Juditsky and A. Nemirovski · 2008
Later among the works it cites.
Detecting High log-densities: an 𝒪 ( n 1 / 4 ) \mathcal{O}(n^{1/4}) -approximation for densest k k -subgraph
A. Bhaskara, M. Charikar, E. Chlamtáč, U. Feige, and A. Vijayaraghavan · 2010
Later among the works it cites.
Explicit Constructions of RIP Matrices and Related Problems
J. Bourgain, S. J. Dilworth, K. Ford, S. Konyagin, and D. Kutzarova · 2010
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The Restricted Isometry Property and its Implications for Compressed Sensing
E. J. Candès · 2008
Cited alongside, same era.
Later among the works it cites.
Introduction to the Non-asymptotic Analysis of Random Matrices
R. Vershynin · 2010
Later among the works it cites.
Breaking the k 2 k^{2} Barrier for Explicit RIP Matrices
J. Bourgain, S. J. Dilworth, K. Ford, S. Konyagin, and D. Kutzarova · 2011
Closest in time.