(en) Moses S. Charikar, « Similarity Estimation Techniques from Rounding Algorithms », Proceedings of the 34th Annual ACM Symposium on Theory of Computing 2002, , (ACM 1–58113–495–9/02/0005)… (DOI10.1145/509907.509965, lire en ligne, consulté le )
doi.org
dx.doi.org
(en) Moses S. Charikar, « Similarity Estimation Techniques from Rounding Algorithms », Proceedings of the 34th Annual ACM Symposium on Theory of Computing 2002, , (ACM 1–58113–495–9/02/0005)… (DOI10.1145/509907.509965, lire en ligne, consulté le )
mit.edu
people.csail.mit.edu
(en) Gionis, P. Indyk et Rajeev Motwani, « Similarity Search in High Dimensions via Hashing », Proceedings of the 25th Very Large Database (VLDB) Conference, (lire en ligne)
(en) Piotr Indyk et Rajeev Motwani, « Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. », Proceedings of 30th Symposium on Theory of Computing, (lire en ligne)
(en) Alexandr Andoni et Piotr Indyk, « Near-optimal hashing algorithm for approximate nearest neighbour in high dimensions », Communications of the ACM, Vol. 51, (lire en ligne)