| 2026 | COLT | Compact Geometric Representations of Hierarchies. | Prashant Gokhale, Piotr Indyk, Yuhao Liu, Sandeep Silwal, Tony Chang Wang, Haike Xu |
| 2026 | STOC | Fast and Compact Random Mappings with Uniform Guarantees and Applications. | Ying Feng, Piotr Indyk |
| 2025 | ALT | Optimal and learned algorithms for the online list update problem with Zipfian accesses. | Piotr Indyk, Isabelle Quaye, Ronitt Rubinfeld, Sandeep Silwal |
| 2025 | ICALP | Even Faster Algorithm for the Chamfer Distance. | Ying Feng, Piotr Indyk |
| 2025 | ICLR | Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions. | Piotr Indyk, Michael Kapralov, Kshiteej Sheth, Tal Wagner |
| 2025 | ICML | Graph-Based Algorithms for Diverse Similarity Search. | Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy, Sepideh Mahabadi, Vikas C. Raykar, Kirankumar Shiragur, Haike Xu |
| 2025 | ICML | Contradiction Retrieval via Contrastive Learning with Sparsity. | Haike Xu, Zongyu Lin, Kai-Wei Chang, Yizhou Sun, Piotr Indyk |
| 2025 | ISAAC | Challenges and Opportunities of Graph-Based Algorithms for Similarity Search (Invited Talk). | Piotr Indyk |
| 2023 | ICLR | Subquadratic Algorithms for Kernel Matrices via Kernel Density Estimation. | Ainesh Bakshi, Piotr Indyk, Praneeth Kacham, Sandeep Silwal, Samson Zhou |
| 2023 | ICML | Data Structures for Density Estimation. | Anders Aamand, Alexandr Andoni, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal |
| 2023 | WACV | Addressing Feature Suppression in Unsupervised Visual Representations. | Tianhong Li, Lijie Fan, Yuan Yuan, Hao He, Yonglong Tian, Rogrio Feris, Piotr Indyk, Dina Katabi |
| 2022 | AISTATS | Online Page Migration with ML Advice. | Piotr Indyk, Frederik Mallmann-Trenn, Slobodan Mitrovic, Ronitt Rubinfeld |
| 2022 | COLT | Generalization Bounds for Data-Driven Numerical Linear Algebra. | Peter L. Bartlett, Piotr Indyk, Tal Wagner |
| 2022 | CVPR | Targeted Supervised Contrastive Learning for Long-Tailed Recognition. | Tianhong Li, Peng Cao, Yuan Yuan, Lijie Fan, Yuzhe Yang, Rogrio Feris, Piotr Indyk, Dina Katabi |
| 2022 | ICLR | Triangle and Four Cycle Counting with Predictions in Graph Streams. | Justin Y. Chen, Talya Eden, Piotr Indyk, Honghao Lin, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner, David P. Woodruff, Michael Zhang |
| 2022 | ICML | Streaming Algorithms for Support-Aware Histograms. | Justin Y. Chen, Piotr Indyk, Tal Wagner |
| 2022 | SODA | Frequency Estimation with One-Sided Error. | Piotr Indyk, Shyam Narayanan, David P. Woodruff |
| 2021 | ICLR | Learning-based Support Estimation in Sublinear Time. | Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner |
| 2021 | ICML | Faster Kernel Matrix Algebra via Density Estimation. | Arturs Backurs, Piotr Indyk, Cameron Musco, Tal Wagner |
| 2021 | ICML | Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering. | Shyam Narayanan, Sandeep Silwal, Piotr Indyk, Or Zamir |
| 2020 | ICLR | Learning Space Partitions for Nearest Neighbor Search. | Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner |
| 2020 | ICML | Scalable Nearest Neighbor Search for Optimal Transport. | Arturs Backurs, Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner |
| 2020 | SODA | Composable Core-sets for Determinant Maximization Problems via Spectral Spanners. | Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei |
| 2019 | COLT | Sample-Optimal Low-Rank Approximation of Distance Matrices. | Piotr Indyk, Ali Vakilian, Tal Wagner, David P. Woodruff |
| 2019 | ICLR | Learning-Based Frequency Estimation Algorithms. | Chen-Yu Hsu, Piotr Indyk, Dina Katabi, Ali Vakilian |
| 2019 | ICML | Scalable Fair Clustering. | Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner |
| 2019 | ICML | Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm. | Sepideh Mahabadi, Piotr Indyk, Shayan Oveis Gharan, Alireza Rezaei |
| 2019 | PODS | Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model. | Piotr Indyk, Ali Vakilian |
| 2018 | COLT | Approximate Nearest Neighbors in Limited Space. | Piotr Indyk, Tal Wagner |
| 2018 | FOCS | Efficient Density Evaluation for Smooth Kernels. | Arturs Backurs, Moses Charikar, Piotr Indyk, Paris Siminelakis |
| 2018 | ICALP | Approximate Sparse Linear Regression. | Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi |
| 2018 | SODA | Set Cover in Sub-linear Time. | Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee |
| 2018 | SIGCOMM | Fast millimeter wave beam alignment. | Haitham Hassanieh, Omid Abari, Michael Rodriguez, Mohammed A. Abdelghany, Dina Katabi, Piotr Indyk |
| 2017 | SODA | Better Approximations for Tree Sparsity in Nearly-Linear Time. | Arturs Backurs, Piotr Indyk, Ludwig Schmidt |
| 2017 | SODA | Near-Optimal (Euclidean) Metric Compression. | Piotr Indyk, Tal Wagner |
| 2017 | SPAA | Beyond P vs. NP: Quadratic-Time Hardness for Big Data Problems. | Piotr Indyk |
| 2016 | FOCS | Which Regular Expression Patterns Are Hard to Match? | Arturs Backurs, Piotr Indyk |
| 2016 | IJCAI | A Nearly-Linear Time Framework for Graph-Structured Sparsity. | Chinmay Hegde, Piotr Indyk, Ludwig Schmidt |
| 2016 | PODS | Towards Tight Bounds for the Streaming Set Cover Problem. | Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian |
| 2016 | SODA | Nearly-optimal bounds for sparse recovery in generic norms, with applications to | Arturs Backurs, Piotr Indyk, Ilya P. Razenshteyn, David P. Woodruff |
| 2016 | SODA | Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. | Mahdi Cheraghchi, Piotr Indyk |
| 2015 | ICASSP | Seismic feature extraction using steiner tree methods. | Ludwig Schmidt, Chinmay Hegde, Piotr Indyk, Ligang Lu, Xingang Chi, Detlef Hohl |
| 2015 | ICML | A Nearly-Linear Time Framework for Graph-Structured Sparsity. | Chinmay Hegde, Piotr Indyk, Ludwig Schmidt |
| 2015 | PODS | Erratum for: Approximating and Testing | Piotr Indyk, Reut Levi, Ronitt Rubinfeld |
| 2015 | STOC | Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false). | Arturs Backurs, Piotr Indyk |
| 2014 | FOCS | Sample-Optimal Fourier Sampling in Any Constant Dimension. | Piotr Indyk, Michael Kapralov |
| 2014 | ICALP | Nearly Linear-Time Model-Based Compressive Sensing. | Chinmay Hegde, Piotr Indyk, Ludwig Schmidt |
| 2014 | ICASSP | Automatic fault localization using the generalized Earth Mover's distance. | Ludwig Schmidt, Chinmay Hegde, Piotr Indyk, Jonathan Kane, Ligang Lu, Detlef Hohl |
| 2014 | ISIT | A fast approximation algorithm for tree-sparse recovery. | Chinmay Hegde, Piotr Indyk, Ludwig Schmidt |
| 2014 | PODS | Composable core-sets for diversity and coverage maximization. | Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, Vahab S. Mirrokni |
| 2014 | SODA | Beyond Locality-Sensitive Hashing. | Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, Ilya P. Razenshteyn |
| 2014 | SODA | Approximation-Tolerant Model-Based Compressive Sensing. | Chinmay Hegde, Piotr Indyk, Ludwig Schmidt |
| 2014 | SODA | (Nearly) Sample-Optimal Sparse Fourier Transform. | Piotr Indyk, Michael Kapralov, Eric Price |
| 2013 | ICALP | On Model-Based RIP-1 Matrices. | Piotr Indyk, Ilya P. Razenshteyn |
| 2013 | PODS | Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform. | Piotr Indyk |
| 2013 | WWW | Real-time recommendation of diverse related articles. | Sofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi |
| 2013 | SODA | Shift Finding in Sub-Linear Time. | Alexandr Andoni, Piotr Indyk, Dina Katabi, Haitham Hassanieh |
| 2013 | SODA | Euclidean spanners in high dimensions. | Sariel Har-Peled, Piotr Indyk, Anastasios Sidiropoulos |
| 2012 | MOBICOM | Faster GPS via the sparse fourier transform. | Haitham Hassanieh, Fadel Adib, Dina Katabi, Piotr Indyk |
| 2012 | PODS | Approximating and testing k-histogram distributions in sub-linear time. | Piotr Indyk, Reut Levi, Ronitt Rubinfeld |
| 2012 | SODA | Simple and practical algorithm for sparse Fourier transform. | Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price |
| 2012 | STOC | Nearly optimal sparse fourier transform. | Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price |
| 2012 | SIGCOMM | Efficient and reliable low-power backscatter networks. | Jue Wang, Haitham Hassanieh, Dina Katabi, Piotr Indyk |
| 2011 | FOCS | On the Power of Adaptivity in Sparse Recovery. | Piotr Indyk, Eric Price, David P. Woodruff |
| 2011 | STOC | K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance. | Piotr Indyk, Eric Price |
| 2010 | LATIN | Sparse Recovery Using Sparse Random Matrices. | Piotr Indyk |
| 2010 | SODA | Lower Bounds for Sparse Recovery. | Khanh Do Ba, Piotr Indyk, Eric Price, David P. Woodruff |
| 2010 | SODA | Efficiently Decodable Non-adaptive Group Testing. | Piotr Indyk, Hung Q. Ngo, Atri Rudra |
| 2009 | FOCS | Efficient Sketches for Earth-Mover Distance, with Applications. | Alexandr Andoni, Khanh Do Ba, Piotr Indyk, David P. Woodruff |
| 2009 | ICALP | External Sampling. | Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld |
| 2009 | PODS | Space-optimal heavy hitters with strong error bounds. | Radu Berinde, Graham Cormode, Piotr Indyk, Martin J. Strauss |
| 2009 | SODA | Overcoming the | Alexandr Andoni, Piotr Indyk, Robert Krauthgamer |
| 2009 | SODA | Approximate line nearest neighbor in high dimensions. | Alexandr Andoni, Piotr Indyk, Robert Krauthgamer, Huy L. Nguyen |
| 2008 | FOCS | Near-Optimal Sparse Recovery in the L1 Norm. | Piotr Indyk, Milan Ruzic |
| 2008 | SODA | Earth mover distance over high-dimensional spaces. | Alexandr Andoni, Piotr Indyk, Robert Krauthgamer |
| 2008 | SODA | Explicit constructions for compressed sensing of sparse signals. | Piotr Indyk |
| 2008 | SODA | Declaring independence via the sketching of sketches. | Piotr Indyk, Andrew McGregor |
| 2007 | COLT | Sketching Information Divergences. | Sudipto Guha, Piotr Indyk, Andrew McGregor |
| 2007 | SODA | Approximation algorithms for embedding general metrics into trees. | Mihai Badoiu, Piotr Indyk, Anastasios Sidiropoulos |
| 2007 | SODA | A near linear time constant factor approximation for Euclidean bichromatic matching (cost). | Piotr Indyk |
| 2007 | STOC | Uncertainty principles, extractors, and explicit embeddings of l2 into l1. | Piotr Indyk |
| 2007 | SPIRE | Efficient Computations of | Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat |
| 2006 | FOCS | Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. | Alexandr Andoni, Piotr Indyk |
| 2006 | FOCS | On the Optimality of the Dimensionality Reduction Method. | Alexandr Andoni, Piotr Indyk, Mihai Patrascu |
| 2006 | SODA | Efficient algorithms for substring near neighbor problem. | Alexandr Andoni, Piotr Indyk |
| 2006 | TCC | Polylogarithmic Private Approximations and Efficient Matching. | Piotr Indyk, David P. Woodruff |
| 2005 | ICALP | Facility Location in Sublinear Time. | Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler |
| 2005 | STOC | Low-distortion embeddings of general metrics into the line. | Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos |
| 2005 | STOC | Optimal approximations of the frequency moments of data streams. | Piotr Indyk, David P. Woodruff |
| 2004 | ICALP | Linear-Time List Decoding in Error-Free Settings: (Extended Abstract). | Venkatesan Guruswami, Piotr Indyk |
| 2004 | ICALP | Closest Pair Problems in Very High Dimensions. | Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat |
| 2004 | SODA | Fast approximate pattern matching with few indels via embeddings. | Mihai Badoiu, Piotr Indyk |
| 2004 | SODA | Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates. | Venkatesan Guruswami, Piotr Indyk |
| 2004 | SODA | Approximate Nearest Neighbor under edit distance via product metrics. | Piotr Indyk |
| 2004 | STOC | Algorithms for dynamic geometric problems over data streams. | Piotr Indyk |
| 2003 | FOCS | Tight Lower Bounds for the Distinct Elements Problem. | Piotr Indyk, David P. Woodruff |
| 2003 | SODA | Lower bounds for embedding edit distance into normed spaces. | Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova |
| 2003 | SODA | Embeddings and non-approximability of geometric problems. | Venkatesan Guruswami, Piotr Indyk |
| 2003 | SODA | Better algorithms for high-dimensional proximity problems via asymmetric embeddings. | Piotr Indyk |
| 2003 | STOC | Linear time encodable and list decodable codes. | Venkatesan Guruswami, Piotr Indyk |
| 2002 | ICALP | New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. | Moses Charikar, Piotr Indyk, Rina Panigrahy |
| 2002 | ICALP | Histogramming Data Streams with Fast Per-Item Processing. | Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss |
| 2002 | ICDE | Fast Mining of Massive Tabular Data via Approximate Distance Computations. | Graham Cormode, Piotr Indyk, Nick Koudas, S. Muthukrishnan |
| 2002 | WWW | Evaluating strategies for similarity search on the web. | Taher H. Haveliwala, Aristides Gionis, Dan Klein, Piotr Indyk |
| 2002 | SIGMOD | Dynamic multidimensional histograms. | Nitin Thaper, Sudipto Guha, Piotr Indyk, Nick Koudas |
| 2002 | SODA | Maintaining stream statistics over sliding windows (extended abstract). | Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani |
| 2002 | SODA | Derandomized dimensionality reduction with applications. | Lars Engebretsen, Piotr Indyk, Ryan O'Donnell |
| 2002 | SODA | Explicit constructions of selectors and related combinatorial structures, with applications. | Piotr Indyk |
| 2002 | STOC | Approximate clustering via core-sets. | Mihai Badoiu, Sariel Har-Peled, Piotr Indyk |
| 2002 | STOC | Fast, small-space algorithms for approximate histogram maintenance. | Anna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis Kotidis, S. Muthukrishnan, Martin Strauss |
| 2002 | STOC | Near-optimal sparse fourier representations via sampling. | Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss |
| 2002 | STOC | Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets. | Venkatesan Guruswami, Piotr Indyk |
| 2002 | VLDB | Comparing Data Streams Using Hamming Norms (How to Zero In). | Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan |
| 2001 | FOCS | Expander-Based Constructions of Efficiently Decodable Codes. | Venkatesan Guruswami, Piotr Indyk |
| 2001 | FOCS | Algorithmic Applications of Low-Distortion Geometric Embeddings. | Piotr Indyk |
| 2001 | SODA | Pattern matching for sets of segments. | Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian |
| 2001 | SODA | Reductions among high dimensional proximity problems. | Ashish Goel, Piotr Indyk, Kasturi R. Varadarajan |
| 2000 | FOCS | Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation. | Piotr Indyk |
| 2000 | ICDE | Finding Interesting Associations without Support Pruning. | Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang |
| 2000 | KDD | Mining the stock market (extended abstract): which measure is best? | Martin Gavrilov, Dragomir Anguelov, Piotr Indyk, Rajeev Motwani |
| 2000 | SODA | Dimensionality reduction techniques for proximity problems. | Piotr Indyk |
| 2000 | SODA | Approximate congruence in nearly linear time. | Piotr Indyk, Suresh Venkatasubramanian |
| 2000 | VLDB | Identifying Representative Trends in Massive Time Series Data Sets Using Sketches. | Piotr Indyk, Nick Koudas, S. Muthukrishnan |
| 1999 | FOCS | Efficient Regular Data Structures and Algorithms for Location and Proximity Problems. | Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet |
| 1999 | FOCS | Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings. | Martin Farach-Colton, Piotr Indyk |
| 1999 | FOCS | Stochastic Load Balancing and Related Problems. | Ashish Goel, Piotr Indyk |
| 1999 | FOCS | A Sublinear Time Approximation Scheme for Clustering in Metric Spaces. | Piotr Indyk |
| 1999 | SODA | Tree Pattern Matching and Subset Matching in Deterministic | Richard Cole, Ramesh Hariharan, Piotr Indyk |
| 1999 | SODA | A Small Approximately min-wise Independent Family of Hash Functions. | Piotr Indyk |
| 1999 | SODA | Geometric Matching Under Noise: Combinatorial Bounds and Algorithms. | Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian |
| 1999 | STOC | Sublinear Time Algorithms for Metric Space Problems. | Piotr Indyk |
| 1999 | STOC | Inerpolation of Symmetric Functions and a New Type of Combinatorial Design. | Piotr Indyk |
| 1999 | VLDB | Similarity Search in High Dimensions via Hashing. | Aristides Gionis, Piotr Indyk, Rajeev Motwani |
| 1998 | FOCS | On Approximate Nearest Neighbors in Non-Euclidean Spaces. | Piotr Indyk |
| 1998 | FOCS | Faster Algorithms for String Matching Problems: Matching the Convolution Bound. | Piotr Indyk |
| 1998 | SIGMOD | Enhanced Hypertext Categorization Using Hyperlinks. | Soumen Chakrabarti, Byron Dom, Piotr Indyk |
| 1998 | STOC | Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. | Piotr Indyk, Rajeev Motwani |
| 1997 | ALT | On Learning Disjunctions of Zero-One Treshold Functions with Queries. | Tibor Hegeds, Piotr Indyk |
| 1997 | CPM | External Inverse Pattern Matching. | Leszek Gasieniec, Piotr Indyk, Piotr Krysta |
| 1997 | FCT | Efficient Parallel Computing with Memory Faults. | Leszek Gasieniec, Piotr Indyk |
| 1997 | FOCS | Deterministic Superimposed Coding with Applications to Pattern Matching. | Piotr Indyk |
| 1997 | SODA | On Page Migration and Other Relaxed Task Systems. | Yair Bartal, Moses Charikar, Piotr Indyk |
| 1997 | STOC | Locality-Preserving Hashing in Multidimensional Spaces. | Piotr Indyk, Rajeev Motwani, Prabhakar Raghavan, Santosh S. Vempala |
| 1996 | ICALP | Shared-Memory Simulations on a Faulty-Memory DMM. | Bogdan S. Chlebus, Anna Gambin, Piotr Indyk |
| 1996 | STACS | On Word-Level Parallelism in Fault-Tolerant Computing. | Piotr Indyk |
| 1995 | STACS | Optimal Simulation of Automata by Neural Nets. | Piotr Indyk |
| 1994 | ESA | PRAM Computations Resilient to Memory Faults. | Bogdan S. Chlebus, Anna Gambin, Piotr Indyk |