Piotr Indyk

Piotr Indyk (born before 1995) is a Polish-American theoretical computer scientist . He is a professor at CSAIL at the Massachusetts Institute of Technology .

Indyk received his master's degree in computer science from the University of Warsaw in 1995 and his PhD in 2000 with Rajeev Motwani at Stanford University (high-dimensional computational geometry). He has been with MIT since 2000.

Piotr Indyk is known, among other things, for his contributions to location-sensitive hashing (LSH). Location-sensitive hashing can be used for nearest-neighbor searches in high dimensions. It is used in search engines and in data mining .

In 2002 Indyk received the National Science Foundation's Career Award . In 2012, together with Andrei Broder and Moses S. Charikar, he received the Paris Kanellakis Prize for his work on location-sensitive hashing. He was a Packard Fellow and a Sloan Fellow .

Alexandr (Alex) Andoni is one of his PhD students.

Publications

• Nearest Neighbors in high dimensional spaces , CRC Handbook of Discrete and Computational Geometry 2003
• with Alexandr Andoni Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions , Communications of the ACM, Volume 51, 2008, pp. 117-122.

Web links

• Homepage at MIT

Individual evidence

1. ^ Piotr Indyk in the Mathematics Genealogy Project (English) .
2. ^ A. Gionis, P. Indyk, R. Motwani Similarity Search in High Dimensions via Hashing , Proceedings of the 25th Very Large Database (VLDB) Conference, 1999.
3. ^ Indyk, Motwani Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality , Proceedings of the 30th Symposium on Theory of Computing 1998.