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 The Massachusetts Institute of Technology (MIT) is a Private university, private research university in Cambridge, Massachusetts, United States. Established in 1861, MIT has played a significant role in the development of many areas of moder ...

Academic biography

Indyk received the Magister (MA) degree from the

University of Warsaw The University of Warsaw (, ) is a public university, public research university in Warsaw, Poland. Established on November 19, 1816, it is the largest institution of higher learning in the country, offering 37 different fields of study as well ...

in 1995 and a PhD in

computer science Computer science is the study of computation, information, and automation. Computer science spans Theoretical computer science, theoretical disciplines (such as algorithms, theory of computation, and information theory) to Applied science, ...

from

Stanford University Leland Stanford Junior University, commonly referred to as Stanford University, is a Private university, private research university in Stanford, California, United States. It was founded in 1885 by railroad magnate Leland Stanford (the eighth ...

in 2000 under the supervision of Rajeev Motwani. 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.Piotr Indyk Biography
/ref>

Research

Indyk's research focuses primarily on computational geometry in high-dimensions,

streaming algorithm In computer science, streaming algorithms are algorithms for processing data streams in which the input is presented as a sequence of items and can be examined in only a few passes, typically one-pass algorithm, just one. These algorithms are desi ...

s, and

computational learning theory In computer science, computational learning theory (or just learning theory) is a subfield of artificial intelligence devoted to studying the design and analysis of machine learning algorithms. Overview Theoretical results in machine learning m ...

. 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 In computer science, pattern matching is the act of checking a given sequence of tokens for the presence of the constituents of some pattern. In contrast to pattern recognition, the match usually must be exact: "either it will or will not be a ...

. He has also made contributions to the theory of

compressed sensing Compressed sensing (also known as compressive sensing, compressive sampling, or sparse sampling) is a signal processing technique for efficiently acquiring and reconstructing a Signal (electronics), signal by finding solutions to Underdetermined s ...

. His work on algorithms for computing the

Fourier transform In mathematics, the Fourier transform (FT) is an integral transform that takes a function as input then outputs another function that describes the extent to which various frequencies are present in the original function. The output of the tr ...

of signals with sparse spectra faster than the

Fast Fourier transform A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). A Fourier transform converts a signal from its original domain (often time or space) to a representation in ...

algorithm was selected by

MIT Technology Review ''MIT Technology Review'' is a bimonthly magazine wholly owned by the Massachusetts Institute of Technology. It was founded in 1899 as ''The Technology Review'', and was re-launched without "''The''" in its name on April 23, 1998, under then pu ...

as a TR10 Top 10 Emerging Technology in 2012.

Awards and honors

In 2000, Indyk was awarded the Best Student Paper Award at the Symposium on Foundations of Computer Science (FOCS). In 2002 he received the Career Award from the

National Science Foundation The U.S. National Science Foundation (NSF) is an Independent agencies of the United States government#Examples of independent agencies, independent agency of the Federal government of the United States, United States federal government that su ...

, 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 The Association for Computing Machinery (ACM) is a US-based international learned society for computing. It was founded in 1947 and is the world's largest scientific and educational computing society. The ACM is a non-profit professional membe ...

for his work on locality-sensitive hashing. In 2012 his work co-developing the sparse Fourier transform was named by MIT Technology Review as one of the top 10 "breakthrough technologies" of the year. In 2013, he was named a

Simons Investigator The Simons Foundation is an American private foundation established in 1994 by Marilyn and James Harris Simons, Jim Simons with offices in New York City. As one of the largest charitable organizations in the United States with assets of over $5 ...

by the Simons Foundation. In 2015, he was named a Fellow of the

for "contributions to high-dimensional geometric computing, streaming/sketching algorithms, and the Sparse Fourier Transform". He was elected to the

American Academy of Arts and Sciences The American Academy of Arts and Sciences (The Academy) is one of the oldest learned societies in the United States. It was founded in 1780 during the American Revolution by John Adams, John Hancock, James Bowdoin, Andrew Oliver, and other ...

in 2023. He was elected to the

National Academy of Sciences The National Academy of Sciences (NAS) is a United States nonprofit, NGO, non-governmental organization. NAS is part of the National Academies of Sciences, Engineering, and Medicine, along with the National Academy of Engineering (NAE) and the ...

in 2024.

References

External links

Piotr Indyk's Homepage

{{DEFAULTSORT:Indyk, Piotr Theoretical computer scientists Polish computer scientists Stanford University alumni Massachusetts Institute of Technology faculty Researchers in geometric algorithms 2015 fellows of the Association for Computing Machinery Fellows of the American Academy of Arts and Sciences Year of birth missing (living people) Living people Simons Investigator