Fetching the paper…
Reading the bibliography…
The goal of (stable) sparse recovery is to recover a $k$-sparse approximation $x*$ of a vector $x$ from linear measurements of $x$.
Diameters of some finite-dimensional sets and classes of smooth functions
B. S. Kashin · 1977
Earlier work this paper cites.
The best constants in the Khintchine inequality
Uffe Haagerup · 1982
Earlier work this paper cites.
On widths of the euclidean ball
A. Y. Garnaev and E. D. Gluskin · 1984
Earlier work this paper cites.
Norms of random matrices and widths of finite-dimensional sets
E. D. Gluskin · 1984
Earlier work this paper cites.
Finding frequent items in data streams
M. Charikar, K. Chen, and M. Farach-Colton · 2002
Earlier work this paper cites.
Fast, small-space algorithms for approximate histogram maintenance
A. C. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. J. Strauss · 2002
Earlier work this paper cites.
Improved data stream summaries: The count-min sketch and its applications
G. Cormode and S. Muthukrishnan · 2004
Earlier work this paper cites.
Tabulation based 4-universal hashing with applications to second moment estimation
Mikkel Thorup and Yin Zhang · 2004
Earlier work this paper cites.
Data streams: Algorithms and applications)
S. Muthukrishnan · 2005
Earlier work this paper cites.
Combinatorial algorithms for Compressed Sensing
G. Cormode and S. Muthukrishnan · 2006
Earlier work this paper cites.
Stable signal recovery from incomplete and inaccurate measurements
E. J. Candès, J. Romberg, and T. Tao · 2006
Earlier work this paper cites.
Compressed Sensing
D. L. Donoho · 2006
Cited alongside, same era.
Sketching, streaming and sublinear-space algorithms
P. Indyk · 2007
Cited alongside, same era.
Sequential adaptive compressed sampling via huffman codes
A. Aldroubi, H. Wang, and K. Zarringhalam · 2008
Cited alongside, same era.
Finding needles in noisy haystacks
R. Castro, J. Haupt, R. Nowak, and G. Raz · 2008
Cited alongside, same era.
Single-pixel imaging via compressive sampling
M. Duarte, M. Davenport, D. Takhar, J. Laska, T. Sun, K. Kelly, and R. Baraniuk · 2008
Cited alongside, same era.
Bayesian compressive sensing
S. Ji, Y. Xue, and L. Carin · 2008
Cited alongside, same era.
Compressed sensing with sequential observations
Poolmc: Smart pooling of mRNA samples in microarray experiments
A. Bruex, A. Gilbert, R. Kainkaryam, John Schiefelbein, and Peter Woolf · 2010
Later among the works it cites.
Knowledge enhanced compressive measurement
Defense Sciences Office · 2010
Later among the works it cites.
Lower bounds for sparse recovery
K. Do Ba, P. Indyk, E. Price, and D. Woodruff · 2010
Later among the works it cites.
The gelfand widths of lp-balls for 0 < p ≤ 1 0<p\leq 1
S. Foucart, A. Pajor, H. Rauhut, and T. Ullrich · 2010
Later among the works it cites.
Sparse recovery using sparse matrices
A. Gilbert and P. Indyk · 2010
Later among the works it cites.
Approximate sparse recovery: optimizing time and measurements
Anna C. Gilbert, Yi Li, Ely Porat, and Martin J. Strauss · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
D. M. Malioutov, S. Sanghavi, and A. S. Willsky · 2008
Cited alongside, same era.
Compressive distilled sensing
J. Haupt, R. Baraniuk, R. Castro, and R. Nowak · 2009
Cited alongside, same era.
Adaptive sensing for sparse signal recovery
J. Haupt, R. Castro, and R. Nowak · 2009
Cited alongside, same era.
Graph mining on streams
A. McGregor · 2009
Cited alongside, same era.
Daniel M. Kane, Jelani Nelson, Ely Porat, and David P. Woodruff · 2010
Later among the works it cites.
Identification of rare alleles and their carriers using compressed se(que)nsing
N. Shental, A. Amir, and Or Zuk · 2010
Later among the works it cites.
Tight bounds for lp samplers, finding duplicates in streams, and related problems
Hossein Jowhari, Mert Saglam, and Gábor Tardos · 2011
Closest in time.
(1+eps)-approximate sparse recovery
E. Price and D. Woodruff · 2011
Closest in time.