E. Anagnostopoulos, I. Z. Emiris, and I. Psarros, Low-quality dimension reduction and highdimensional approximate nearest neighbor, Proc. 31st Intern. Symp. on Computational Geometry (SoCG), pp.436-450, 2015.

E. Anagnostopoulos, I. Z. Emiris, and I. Psarros, Randomized embeddings with slack, and high-dimensional approximate nearest neighbor, In ACM Transactions on Algorithm, 2018.
DOI : 10.1145/3178540
URL : https://hal.archives-ouvertes.fr/hal-01897269

A. Andoni, NN search: the old, the new, and the impossible, 2009.

A. Andoni, T. Laarhoven, I. Razenshteyn, and E. Waingarten, Optimal hashing-based time-space trade-offs for approximate near neighbors, Proc. Symp. Discrete Algorithms (SODA), 2017. Also as
DOI : 10.1137/1.9781611974782.4
URL : http://arxiv.org/pdf/1608.03580

S. Arya, T. Malamatos, and D. M. Mount, Space-time tradeoffs for approximate nearest neighbor searching, J. ACM, vol.57, issue.1, 2009.
DOI : 10.1145/1613676.1613677
URL : http://www.cs.umd.edu/~mount/Papers/jacm09-tradeoffs.pdf

Y. Bartal and L. Gottlieb, Dimension reduction techniques for p (1<p<2), with applications, 32nd International Symposium on Computational Geometry, vol.16, pp.1-16, 1418.

A. Driemel and F. Silvestri, Locality-sensitive hashing of curves, Proc. 33rd Intern. Symposium on Computational Geometry, vol.37, pp.1-37, 2017.

S. Har-peled, P. Indyk, and R. Motwani, Approximate nearest neighbor: Towards removing the curse of dimensionality, Theory of Computing, vol.8, issue.1, pp.321-350, 2012.

S. Har-peled and M. Mendel, Fast construction of nets in low dimensional metrics, and their applications, Proc. 21st Annual Symp. Computational Geometry, SCG'05, pp.150-158, 2005.

P. Indyk, Approximate nearest neighbor algorithms for frechet distance via product metrics, Proc. 18th Annual Symp. on Computational Geometry, SCG '02, pp.102-106, 2002.
DOI : 10.1145/513400.513414

J. Matou?ek, On variants of the Johnson-Lindenstrauss lemma, Random Struct. Algorithms, vol.33, issue.2, pp.142-156, 2008.