1. Andoni A., Indyk P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117–122 (2008).
2. Andoni A., Indyk P.: Nearest neighbors in high-dimensional spaces. In: Goodman J.E., O’Rourke J., Tóth C.D. (eds.) Handbook of Discrete and Computational Geometry, 3rd edn, ch. 43. CRC Press, Boca Ratin (2017).
3. Andoni A., Indyk P., Nguyen H.L., Razenshteyn I.: Beyond locality-sensitive hashing. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Philadelphia, PA, USA), SODA ’14, Society for Industrial and Applied Mathematics, pp. 1018–1028 (2014).
4. Andoni A., Razenshteyn I.P.: Optimal data-dependent hashing for approximate near neighbors. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, ACM, pp. 793–801 (2015).
5. Barbero Á.I., Ytrehus Ø.: Modifications of the rao-nam cryptosystem. In: Buchmann J., Høholdt T., Stichtenoth H., Tapia-Recillas H., (eds.) Coding Theory, Cryptography and Related Areas: Proceedings of an International Conference on Coding Theory, Cryptography and Related Areas, held in Guanajuato, Mexico, in April 1998. Springer, Berlin, pp. 1–12 (2000).