Fetching the paper…
Reading the bibliography…
The Johnson-Lindenstrauss lemma is a fundamental result in probability with several applications in the design and analysis of algorithms in high dimensional geometry.
Extensions of Lipschitz mappings into a Hilbert space
W B Johnson and J Lindenstrauss · 1984
Earlier work this paper cites.
Probability in Banach spaces: isoperimetry and processes
Michel Ledoux and Michel Talagrand · 1991
Earlier work this paper cites.
A sample of samplers - a computational perspective on sampling (survey)
Oded Goldreich · 1997
Earlier work this paper cites.
Approximate nearest neighbors: towards removing the curse of dimensionality
Piotr Indyk and Rajeev Motwani · 1998
Earlier work this paper cites.
The space complexity of approximating the frequency moments
Noga Alon, Yossi Matias, and Mario Szegedy · 1999
Earlier work this paper cites.
An algorithmic theory of learning: Robust concepts and random projection
Rosa I. Arriaga and Santosh Vempala · 1999
Earlier work this paper cites.
Derandomized dimensionality reduction with applications
Lars Engebretsen, Piotr Indyk, and Ryan O’Donnell · 2002
Earlier work this paper cites.
Algorithmic derandomization via complexity theory
D. Sivakumar · 2002
Cited alongside, same era.
Database-friendly random projections: Johnson-lindenstrauss with binary coins
Dimitris Achlioptas · 2003
Cited alongside, same era.
An elementary proof of a theorem of johnson and lindenstrauss
Sanjoy Dasgupta and Anupam Gupta · 2003
Cited alongside, same era.
On variants of the johnson-lindenstrauss lemma
Jirí Matousek · 2008
Cited alongside, same era.
The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
Nir Ailon and Bernard Chazelle · 2009
Cited alongside, same era.
Fast dimension reduction using rademacher series on dual bch codes
Nir Ailon and Edo Liberty · 2009
Explicit dimension reduction and its applications
Zohar Karnin, Yuval Rabani, and Amir Shpilka · 2009
Later among the works it cites.
Bounded independence fools degree 2 threshold functions
Ilias Diakonikolas, Daniel Kane, and Jelani Nelson · 2010
Closest in time.
A sparse Johnson-Lindenstrauss transform
Anirban Dasgupta, Ravi Kumar, and Tamás Sarlós · 2010
Closest in time.
A derandomized sparse Johnson-Lindenstrauss transform, 2010
Daniel Kane and Jelani Nelson · 2010
Closest in time.
Pseudorandom generators for polynomial threshold functions
Raghu Meka and David Zuckerman · 2010
Closest in time.
Almost optimal unrestricted fast Johnson-Lindenstrauss transform
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Numerical linear algebra in the streaming model
Kenneth L. Clarkson and David P. Woodruff · 2009
Cited alongside, same era.
Nir Ailon and Edo Liberty · 2011
Closest in time.