Piotr Indyk

From Wikipedia, the free encyclopedia
Piotr Indyk
Residence Poland, United States
Nationality 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 Packard Fellowship from the Packard Foundation (2003)
Sloan Fellowship from the Alfred P. Sloan Foundation (2003)
Career Award from the National Science Foundation (2002)
Best Student Paper Award at FOCS (2000)

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

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

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.

Awards and honors

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 cowinner of the 2012 Kanellakis Award for his work on Locality Sensitive Hashing.

References

External links

This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.