Piotr Indyk

Piotr Indyk is a Polish- American theoretical computer scientist. He is a professor at CSAIL Massachusetts Institute of Technology.

Indyk received in 1995 his MA degree in computer science at the University of Warsaw and completed his doctorate in 2000 at Rajeev Motwani at Stanford University ( high- dimensional computational geometry ). Since 2000 he has worked at MIT.

Piotr Indyk is well known for his contributions to Lokalitäts - sensitive hashing (LSH ). Lokalitäts - sensitive hashing can be used for the nearest neighbor search in high dimensions. It applies to search engines and data mining.

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

His doctoral heard Alexandr ( Alex) Andoni.

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.