Piotr Indyk is Thomas D. and Virginia W. Cabot Professor in the Theory of Computation Group at the Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology.
[1] In 2000, Indyk joined MIT where he currently holds the title of Thomas D. and Virginia W. Cabot Professor in the Department of Electrical Engineering and Computer Science.
He has made a range of contributions to these fields, particularly in the study of low-distortion embeddings, algorithmic coding theory, and geometric and combinatorial pattern matching.
His work on algorithms for computing the Fourier transform of signals with sparse spectra faster than the Fast Fourier transform algorithm was selected by MIT Technology Review as a TR10 Top 10 Emerging Technology in 2012.
He was a co-winner of the 2012 Paris Kanellakis Award from the Association for Computing Machinery for his work on locality-sensitive hashing.