The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
Fast Dimension Reduction Using Rademacher Series on Dual BCH Codes
An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
SIAM Journal on Computing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC ’06
ACM Transactions on Algorithms
Discrete & Computational Geometry
Bernard Chazelle
Edo Liberty
Very sparse stable random projections for dimension reduction in l? (0 <? ? 2) norm
Toward a Unified Theory of Sparse Dimensionality Reduction in Euclidean Space
Uncertainty principles, extractors, and explicit embeddings of l2 into l1