Piotr Indyk

Piotr Indyk Piotr Indyk is a computer scientist known for work on algorithms for high-dimensional geometry, randomized algorithms, and signal processing. He holds a faculty position at the Massachusetts Institute of Technology and has contributed foundational results relevant to theoretical computer science, data structures, and applied mathematics. Indyk's research intersects topics studied at institutions such as the University of Warsaw, the Massachusetts Institute of Technology, and collaborations with researchers affiliated with Stanford University, Princeton University, and IBM Research.

Early life and education

Indyk received his early education in Poland, attending institutions connected with the University of Warsaw and Polish scientific communities such as the Polish Academy of Sciences, before pursuing graduate studies at the Massachusetts Institute of Technology where he worked in research groups that included faculty from Stanford University, Harvard University, and Bell Labs. During his doctoral and postdoctoral training he collaborated with scholars linked to Princeton University, UC Berkeley, and Microsoft Research, engaging with conferences including the ACM Symposium on Theory of Computing, the IEEE Symposium on Foundations of Computer Science, and the Annual Symposium on Computational Geometry. His formative mentors and peers included researchers associated with Columbia University, Cornell University, and Tokyo Institute of Technology.

Academic career

Indyk joined the faculty at the Massachusetts Institute of Technology and has been affiliated with research centers and laboratories including the Computer Science and Artificial Intelligence Laboratory, the MIT Electrical Engineering and Computer Science department, and collaborative initiatives with Google Research, Facebook AI Research, and Yahoo! Research. He has served on program committees for conferences such as the Conference on Neural Information Processing Systems, the International Conference on Machine Learning, and the ACM SIGMOD Conference, and has lectured at universities including Stanford University, Princeton University, Carnegie Mellon University, and ETH Zurich. Indyk has supervised students who later took positions at institutions including UC Berkeley, Columbia University, University of Illinois Urbana-Champaign, and Microsoft Research, and has been involved with companies and startups connected to venture communities in Silicon Valley, New York University, and Tel Aviv.

Research contributions

Indyk's contributions span randomized algorithms, nearest neighbor search, dimensionality reduction, compressed sensing, sketching, and streaming algorithms, building on foundations laid by researchers at Harvard University, Yale University, and MIT. He developed algorithmic primitives related to locality-sensitive hashing that influenced work at Google, Facebook, and Amazon, and connected to theoretical frameworks from the Institute for Advanced Study, Bell Labs, and IBM Research. His results on sublinear-time algorithms and data structures relate to studies at Princeton University, Stanford University, and UC Berkeley, and his work on sparse recovery and compressed sensing complements contributions from École Polytechnique, École Normale Supérieure, and the University of Rome. Indyk's papers influenced applied areas pursued at Microsoft Research, Adobe Research, and NVIDIA Research, and intersect with mathematics associated with the Clay Mathematics Institute, the Simons Foundation, and the National Science Foundation.

Awards and honors

Indyk's work has been recognized by awards and honors from professional societies and organizations such as the Association for Computing Machinery, the Institute of Electrical and Electronics Engineers, the National Science Foundation, and foundations including the Simons Foundation. He has received distinctions associated with conferences like the ACM Symposium on Theory of Computing, the IEEE Symposium on Foundations of Computer Science, and the European Association for Theoretical Computer Science, and fellowships and grants connected to institutions such as the Sloan Foundation, the John Simon Guggenheim Memorial Foundation, and the Royal Society. His research papers have been cited in award-winning projects at universities including MIT, Stanford University, and Princeton University, and in industrial labs such as Google Research, Microsoft Research, and IBM Research.

Selected publications

- Indyk, P.; coauthors. Foundational papers on locality-sensitive hashing and approximate nearest neighbor search, presented at the ACM Symposium on Theory of Computing and published in proceedings associated with IEEE and ACM venues involving collaborators from Stanford University, UC Berkeley, and Princeton University. - Indyk, P.; coauthors. Work on compressed sensing and sparse recovery with connections to the IEEE International Symposium on Information Theory and collaborations with researchers from École Polytechnique, University of Rome, and Columbia University. - Indyk, P.; coauthors. Papers on streaming algorithms and sketching techniques published in venues tied to the International Colloquium on Automata, Languages and Programming, the Conference on Neural Information Processing Systems, and the International Conference on Machine Learning, involving coauthors from Carnegie Mellon University, Harvard University, and Yale University.

Category:Computer scientists Category:Massachusetts Institute of Technology faculty