Indyk, Piotr
Massachusetts Institute of Technology
3 papers on CoChatORCID 0009-0005-2022-8429
Most cited papers
- Verified
Approximate nearest neighbors: towards removing the curse of dimensionality
Indyk, P., & Motwani, R. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98
Complexity and Algorithms in GraphsComputational Geometry and Mesh Generation
Cited by 4,188
- Verified
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
Andoni, A., & Indyk, P. (2008) · Communications of the ACM
Advanced Image and Video Retrieval TechniquesAlgorithms and Data Compression
Cited by 1,437
- Verified
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
Andoni, A., & Indyk, P. (2006) · 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
Advanced Image and Video Retrieval TechniquesAlgorithms and Data Compression
Cited by 1,067
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free