Piotr Indyk

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Piotr Indyk
Residence Poland, United States
Nationality Poland Polish
Fields Computer Scientist, Mathematician
Institutions Massachusetts Institute of Technology
Alma mater Stanford University
Uniwersytet Warszawski
Doctoral advisor Rajeev Motwani
Known for Computational geometry, Streaming algorithms, Computational learning theory
Notable awards Best Student Paper Award at FOCS (2000)
Career Award from the National Science Foundation (2002)
Sloan Fellowship from the Alfred P. Sloan Foundation (2003)
Packard Fellowship from the Packard Foundation (2003)
Paris Kanellakis Award from the ACM (2012)
Simons Investigator (2013)

Piotr Indyk is a Professor in the Theory of Computation Group at the Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology.

Academic biography[edit]

Indyk received the Magister degree from the Uniwersytet Warszawski in 1995 and a Ph.D. in Computer Science from Stanford University in 2000 under the supervision of Rajeev Motwani.[1] In 2000, Indyk joined MIT where he currently holds the title of Professor in the Department of Electrical Engineering and Computer Science.[2]

Research[edit]

Indyk's research focuses primarily on computational geometry in high-dimensions, streaming algorithms, and computational learning theory. 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. He has also made contributions to the theory of compressed sensing. His work on algorithms for computing the Fourier transform of signals with sparse spectra faster than the FFT algorithm was selected by MIT Technology Review as a TR10 Top 10 Emerging Technology in 2012.[3]

Awards and honors[edit]

In 2000, Indyk was awarded the Best Student Paper Award at FOCS. In 2002 he received the Career Award from the National Science Foundation, and in 2003 he received a Packard Fellowship from the Packard Foundation and a Sloan Fellowship from the Alfred P. Sloan Foundation. He was a co-winner of the 2012 Paris Kanellakis Award from the Association for Computing Machinery for his work on Locality Sensitive Hashing.[4] In 2013, he was named a Simons Investigator by the Simons Foundation.[5]

References[edit]

External links[edit]