PRAM Computations Resilient to Memory Faults. - Bogdan S. Chlebus; Anna Gambin; Piotr Indyk (ESA, 1994)

Optimal Simulation of Automata by Neural Nets. - Piotr Indyk (STACS, 1995)

Shared-Memory Simulations on a Faulty-Memory DMM. - Bogdan S. Chlebus; Anna Gambin; Piotr Indyk (ICALP, 1996)

On Word-Level Parallelism in Fault-Tolerant Computing. - Piotr Indyk (STACS, 1996)

On Learning Disjunctions of Zero-One Treshold Functions with Queries. - Tibor Hegedüs; Piotr Indyk (ALT, 1997)

Probabilistic Analysis for Combinatorial Functions of Moving Points. - Li Zhang 001; Harish Devarajan; Julien Basch; Piotr Indyk (SCG, 1997)

External Inverse Pattern Matching. - Leszek Gasieniec; Piotr Indyk; Piotr Krysta (CPM, 1997)

Efficient Parallel Computing with Memory Faults. - Leszek Gasieniec; Piotr Indyk (FCT, 1997)

Deterministic Superimposed Coding with Applications to Pattern Matching. - Piotr Indyk (FOCS, 1997)

Locality-Preserving Hashing in Multidimensional Spaces. - Piotr Indyk; Rajeev Motwani 001; Prabhakar Raghavan; Santosh S. Vempala (STOC, 1997)

On Approximate Nearest Neighbors in Non-Euclidean Spaces. - Piotr Indyk (FOCS, 1998)

Faster Algorithms for String Matching Problems: Matching the Convolution Bound. - Piotr Indyk (FOCS, 1998)

Enhanced Hypertext Categorization Using Hyperlinks. - Soumen Chakrabarti; Byron Dom; Piotr Indyk (SIGMOD Conference, 1998)

Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. - Piotr Indyk; Rajeev Motwani 001 (STOC, 1998)

Geometric Pattern Matching: A Performance Study. - Martin Gavrilov; Piotr Indyk; Rajeev Motwani 001; Suresh Venkatasubramanian (SCG, 1999)

Efficient Regular Data Structures and Algorithms for Location and Proximity Problems. - Arnon Amir; Alon Efrat; Piotr Indyk; Hanan Samet (FOCS, 1999)

Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings. - Martin Farach-Colton; Piotr Indyk (FOCS, 1999)

Stochastic Load Balancing and Related Problems. - Ashish Goel; Piotr Indyk (FOCS, 1999)

A Sublinear Time Approximation Scheme for Clustering in Metric Spaces. - Piotr Indyk (FOCS, 1999)

Tree Pattern Matching and Subset Matching in Deterministic O(n log3 n)-time. - Richard Cole 001; Ramesh Hariharan; Piotr Indyk (SODA, 1999)

Geometric Matching Under Noise: Combinatorial Bounds and Algorithms. - Piotr Indyk; Rajeev Motwani 001; Suresh Venkatasubramanian (SODA, 1999)

Sublinear Time Algorithms for Metric Space Problems. - Piotr Indyk (STOC, 1999)

Inerpolation of Symmetric Functions and a New Type of Combinatorial Design. - Piotr Indyk (STOC, 1999)

Similarity Search in High Dimensions via Hashing. - Aristides Gionis; Piotr Indyk; Rajeev Motwani 001 (VLDB, 1999)

Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication). - Donald Aingworth; Chandra Chekuri; Piotr Indyk; Rajeev Motwani 001 (SIAM J. Comput., 1999)

When crossings count - approximating the minimum spanning tree. - Sariel Har-Peled; Piotr Indyk (SCG, 2000)

Mining the stock market (extended abstract): which measure is best? - Martin Gavrilov; Dragomir Anguelov; Piotr Indyk; Rajeev Motwani 001 (KDD, 2000)

Dimensionality reduction techniques for proximity problems. - Piotr Indyk (SODA, 2000)

Identifying Representative Trends in Massive Time Series Data Sets Using Sketches. - Piotr Indyk; Nick Koudas; S. Muthukrishnan 001 (VLDB, 2000)

Scalable Techniques for Clustering the Web. - Taher H. Haveliwala; Aristides Gionis; Piotr Indyk (WebDB (Informal Proceedings), 2000)

High-dimensional computational geometry. - Piotr Indyk (2000)

Expander-Based Constructions of Efficiently Decodable Codes. - Venkatesan Guruswami; Piotr Indyk (FOCS, 2001)

Algorithmic Applications of Low-Distortion Geometric Embeddings. - Piotr Indyk (FOCS, 2001)

Reductions among high dimensional proximity problems. - Ashish Goel; Piotr Indyk; Kasturi R. Varadarajan (SODA, 2001)

Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems. - Arnon Amir; Alon Efrat; Piotr Indyk; Hanan Samet (Algorithmica, 2001)

A Small Approximately Min-Wise Independent Family of Hash Functions. - Piotr Indyk (J. Algorithms, 2001)

On Approximate Nearest Neighbors under linfinity Norm. - Piotr Indyk (J. Comput. Syst. Sci., 2001)

On page migration and other relaxed task systems. - Yair Bartal; Moses Charikar; Piotr Indyk (Theor. Comput. Sci., 2001)

Finding Interesting Associations without Support Pruning. - Edith Cohen; Mayur Datar; Shinji Fujiwara; Aristides Gionis; Piotr Indyk; Rajeev Motwani 001; Jeffrey D. Ullman; Cheng Yang (IEEE Trans. Knowl. Data Eng., 2001)

Approximate nearest neighbor algorithms for Frechet distance via product metrics. - Piotr Indyk (SCG, 2002)

New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. - Moses Charikar; Piotr Indyk; Rina Panigrahy (ICALP, 2002)

Histogramming Data Streams with Fast Per-Item Processing. - Sudipto Guha; Piotr Indyk; S. Muthukrishnan 001; Martin Strauss 001 (ICALP, 2002)

Fast Mining of Massive Tabular Data via Approximate Distance Computations. - Graham Cormode; Piotr Indyk; Nick Koudas; S. Muthukrishnan 001 (ICDE, 2002)

Dynamic multidimensional histograms. - Nitin Thaper; Sudipto Guha; Piotr Indyk; Nick Koudas (SIGMOD Conference, 2002)

Maintaining stream statistics over sliding windows (extended abstract). - Mayur Datar; Aristides Gionis; Piotr Indyk; Rajeev Motwani 001 (SODA, 2002)

Derandomized dimensionality reduction with applications. - Lars Engebretsen; Piotr Indyk; Ryan O'Donnell (SODA, 2002)

Explicit constructions of selectors and related combinatorial structures, with applications. - Piotr Indyk (SODA, 2002)

Approximate clustering via core-sets. - Mihai Badoiu; Sariel Har-Peled; Piotr Indyk (STOC, 2002)

Fast, small-space algorithms for approximate histogram maintenance. - Anna C. Gilbert; Sudipto Guha; Piotr Indyk; Yannis Kotidis; S. Muthukrishnan 001; Martin Strauss 001 (STOC, 2002)

Near-optimal sparse fourier representations via sampling. - Anna C. Gilbert; Sudipto Guha; Piotr Indyk; S. Muthukrishnan 001; Martin Strauss 001 (STOC, 2002)

Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets. - Venkatesan Guruswami; Piotr Indyk (STOC, 2002)

Evaluating strategies for similarity search on the web. - Taher H. Haveliwala; Aristides Gionis; Dan Klein 001; Piotr Indyk (WWW, 2002)

List-decoding in Linear Time - Piotr Indyk (Electron. Colloquium Comput. Complex., 2002)

Maintaining Stream Statistics over Sliding Windows. - Mayur Datar; Aristides Gionis; Piotr Indyk; Rajeev Motwani 001 (SIAM J. Comput., 2002)

Tight Lower Bounds for the Distinct Elements Problem. - Piotr Indyk; David P. Woodruff (FOCS, 2003)

Lower bounds for embedding edit distance into normed spaces. - Alexandr Andoni; Michel Deza; Anupam Gupta 001; Piotr Indyk; Sofya Raskhodnikova (SODA, 2003)

Embeddings and non-approximability of geometric problems. - Venkatesan Guruswami; Piotr Indyk (SODA, 2003)

Better algorithms for high-dimensional proximity problems via asymmetric embeddings. - Piotr Indyk (SODA, 2003)

Linear time encodable and list decodable codes. - Venkatesan Guruswami; Piotr Indyk (STOC, 2003)

Approximate congruence in nearly linear time. - Piotr Indyk; Suresh Venkatasubramanian (Comput. Geom., 2003)

Probabilistic Analysis for Discrete Attributes of Moving Points. - Julien Basch; Harish Devarajan; Piotr Indyk; Li Zhang 001 (Int. J. Comput. Geom. Appl., 2003)

Comparing Data Streams Using Hamming Norms (How to Zero In). - Graham Cormode; Mayur Datar; Piotr Indyk; S. Muthukrishnan 001 (IEEE Trans. Knowl. Data Eng., 2003)

Locality-sensitive hashing scheme based on p-stable distributions. - Mayur Datar; Nicole Immorlica; Piotr Indyk; Vahab S. Mirrokni (SCG, 2004)

Streaming Algorithms for Geometric Problems. - Piotr Indyk (FSTTCS, 2004)

Linear-Time List Decoding in Error-Free Settings: (Extended Abstract). - Venkatesan Guruswami; Piotr Indyk (ICALP, 2004)

Closest Pair Problems in Very High Dimensions. - Piotr Indyk; Moshe Lewenstein; Ohad Lipsky; Ely Porat (ICALP, 2004)

Fast approximate pattern matching with few indels via embeddings. - Mihai Badoiu; Piotr Indyk (SODA, 2004)

Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates. - Venkatesan Guruswami; Piotr Indyk (SODA, 2004)

Approximate Nearest Neighbor under edit distance via product metrics. - Piotr Indyk (SODA, 2004)

Algorithms for dynamic geometric problems over data streams. - Piotr Indyk (STOC, 2004)

Pattern Matching for Sets of Segments. - Alon Efrat; Piotr Indyk; Suresh Venkatasubramanian (Algorithmica, 2004)

Combinatorial and Experimental Methods for Approximate Point Pattern Matching. - Martin Gavrilov; Piotr Indyk; Rajeev Motwani 001; Suresh Venkatasubramanian (Algorithmica, 2004)

Nearest Neighbors in High-Dimensional Spaces. - Piotr Indyk (Handbook of Discrete and Computational Geometry, 2nd Ed., 2004)

Low-Distortion Embeddings of Finite Metric Spaces. - Piotr Indyk; Jirí Matousek 001 (Handbook of Discrete and Computational Geometry, 2nd Ed., 2004)

Facility Location in Sublinear Time. - Mihai Badoiu; Artur Czumaj; Piotr Indyk; Christian Sohler (ICALP, 2005)

Low-distortion embeddings of general metrics into the line. - Mihai Badoiu; Julia Chuzhoy; Piotr Indyk; Anastasios Sidiropoulos (STOC, 2005)

Optimal approximations of the frequency moments of data streams. - Piotr Indyk; David P. Woodruff (STOC, 2005)

Polylogarithmic Private Approximations and Efficient Matching - Piotr Indyk; David P. Woodruff (Electron. Colloquium Comput. Complex., 2005)

Linear-time encodable/decodable codes with near-optimal rate. - Venkatesan Guruswami; Piotr Indyk (IEEE Trans. Inf. Theory, 2005)

Embedding ultrametrics into low-dimensional spaces. - Mihai Badoiu; Julia Chuzhoy; Piotr Indyk; Anastasios Sidiropoulos (SCG, 2006)

On the Optimality of the Dimensionality Reduction Method. - Alexandr Andoni; Piotr Indyk; Mihai Patrascu (FOCS, 2006)

Efficient algorithms for substring near neighbor problem. - Alexandr Andoni; Piotr Indyk (SODA, 2006)

Low-Dimensional Embedding with Extra Information. - Mihai Badoiu; Erik D. Demaine; Mohammad Taghi Hajiaghayi; Piotr Indyk (Discret. Comput. Geom., 2006)

Uncertainty Principles, Extractors, and Explicit Embeddings of L2 into L1. - Piotr Indyk (Electron. Colloquium Comput. Complex., 2006)

Stable distributions, pseudorandom generators, embeddings, and data stream computation. - Piotr Indyk (J. ACM, 2006)

Probabilistic embeddings of bounded genus graphs into planar graphs. - Piotr Indyk; Anastasios Sidiropoulos (SCG, 2007)

Approximation algorithms for embedding general metrics into trees. - Mihai Badoiu; Piotr Indyk; Anastasios Sidiropoulos (SODA, 2007)

A near linear time constant factor approximation for Euclidean bichromatic matching (cost). - Piotr Indyk (SODA, 2007)

Efficient Computations of l1 and linfinity Rearrangement Distances. - Amihood Amir; Yonatan Aumann; Piotr Indyk; Avivit Levy; Ely Porat (SPIRE, 2007)

Earth Mover Distance over High-Dimensional Spaces. - Alexandr Andoni; Piotr Indyk; Robert Krauthgamer (Electron. Colloquium Comput. Complex., 2007)

Nearest-neighbor-preserving embeddings. - Piotr Indyk; Assaf Naor (ACM Trans. Algorithms, 2007)

Combining geometry and combinatorics: A unified approach to sparse signal recovery. - Radu Berinde; Anna C. Gilbert; Piotr Indyk; Howard J. Karloff; Martin J. Strauss (Allerton, 2008)

Practical near-optimal sparse recovery in the L1 norm. - Radu Berinde; Piotr Indyk; Milan Ruzic (Allerton, 2008)

Near-Optimal Sparse Recovery in the L1 Norm. - Piotr Indyk; Milan Ruzic (FOCS, 2008)

Explicit constructions for compressed sensing of sparse signals. - Piotr Indyk (SODA, 2008)

Declaring independence via the sketching of sketches. - Piotr Indyk; Andrew McGregor 001 (SODA, 2008)

Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. - Alexandr Andoni; Piotr Indyk (Commun. ACM, 2008)

Sampling in Dynamic Data Streams and Applications. - Gereon Frahling; Piotr Indyk; Christian Sohler (Int. J. Comput. Geom. Appl., 2008)

Sketching information divergences. - Sudipto Guha; Piotr Indyk; Andrew McGregor 001 (Mach. Learn., 2008)

Nearest-Neighbor Methods in Learning and Vision. - Gregory Shakhnarovich; Trevor Darrell; Piotr Indyk (IEEE Trans. Neural Networks, 2008)

Sequential Sparse Matching Pursuit. - Radu Berinde; Piotr Indyk (Allerton, 2009)

Efficient Sketches for Earth-Mover Distance, with Applications. - Alexandr Andoni; Khanh Do Ba; Piotr Indyk; David P. Woodruff (FOCS, 2009)

External Sampling. - Alexandr Andoni; Piotr Indyk; Krzysztof Onak; Ronitt Rubinfeld (ICALP (1), 2009)

Overcoming the l1 non-embeddability barrier: algorithms for product metrics. - Alexandr Andoni; Piotr Indyk; Robert Krauthgamer (SODA, 2009)

Approximate line nearest neighbor in high dimensions. - Alexandr Andoni; Piotr Indyk; Robert Krauthgamer; Huy L. Nguyen (SODA, 2009)

Learning Approximate Sequential Patterns for Classification. - Zeeshan Syed; Piotr Indyk; John V. Guttag (J. Mach. Learn. Res., 2009)

Efficient computations of l1 and l∞ rearrangement distances. - Amihood Amir; Yonatan Aumann; Piotr Indyk; Avivit Levy; Ely Porat (Theor. Comput. Sci., 2009)

Sparse recovery for Earth Mover Distance. - Rishi Gupta; Piotr Indyk; Eric Price 001 (Allerton, 2010)

Online Embeddings. - Piotr Indyk; Avner Magen; Anastasios Sidiropoulos; Anastasios Zouzias (APPROX-RANDOM, 2010)

Almost-Euclidean Subspaces of l1N ell_1^N via Tensor Products: A Simple Approach to Randomness Reduction. - Piotr Indyk; Stanislaw J. Szarek (APPROX-RANDOM, 2010)

Sparse Recovery Using Sparse Random Matrices. - Piotr Indyk (LATIN, 2010)

Sublinear Algorithms in the External Memory Model. - Alexandr Andoni; Piotr Indyk; Krzysztof Onak; Ronitt Rubinfeld (Property Testing, 2010)

Lower Bounds for Sparse Recovery. - Khanh Do Ba; Piotr Indyk; Eric Price 001; David P. Woodruff (SODA, 2010)

Efficiently Decodable Non-adaptive Group Testing. - Piotr Indyk; Hung Q. Ngo 001; Atri Rudra (SODA, 2010)

A simple construction of almost-Euclidean subspaces of ℓ1N via tensor products - Piotr Indyk; Stanislaw J. Szarek (CoRR, 2010)

Sparse Recovery Using Sparse Matrices. - Anna C. Gilbert; Piotr Indyk (Proc. IEEE, 2010)

Sparse Signal Recovery and Acquisition with Graphical Models. - Volkan Cevher; Piotr Indyk; Lawrence Carin; Richard G. Baraniuk (IEEE Signal Process. Mag., 2010)

Motif discovery in physiological datasets: A methodology for inferring predictive elements. - Zeeshan Syed; Collin M. Stultz; Manolis Kellis; Piotr Indyk; John V. Guttag (ACM Trans. Knowl. Discov. Data, 2010)

Space-optimal heavy hitters with strong error bounds. - Radu Berinde; Piotr Indyk; Graham Cormode; Martin J. Strauss (ACM Trans. Database Syst., 2010)

Sparse Recovery with Partial Support Knowledge. - Khanh Do Ba; Piotr Indyk (APPROX-RANDOM, 2011)

On the Power of Adaptivity in Sparse Recovery. - Piotr Indyk; Eric Price 001; David P. Woodruff (FOCS, 2011)

The Complexity of Linear Dependence Problems in Vector Spaces. - Arnab Bhattacharyya 001; Piotr Indyk; David P. Woodruff; Ning Xie 002 (ICS, 2011)

K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance. - Piotr Indyk; Eric Price 001 (STOC, 2011)

Approximating and Testing k-Histogram Distributions in Sub-linear time. - Piotr Indyk; Reut Levi; Ronitt Rubinfeld (Electron. Colloquium Comput. Complex., 2011)

Focal plane array folding for efficient information extraction and tracking. - Lei Hamilton; Dan Parker; Chris Yu 001; Piotr Indyk (AIPR, 2012)

Faster GPS via the sparse fourier transform. - Haitham Hassanieh; Fadel Adib; Dina Katabi; Piotr Indyk (MobiCom, 2012)

Approximating and testing k-histogram distributions in sub-linear time. - Piotr Indyk; Reut Levi; Ronitt Rubinfeld (PODS, 2012)

Efficient and reliable low-power backscatter networks. - Jue Wang 012; Haitham Hassanieh; Dina Katabi; Piotr Indyk (SIGCOMM, 2012)

Simple and practical algorithm for sparse Fourier transform. - Haitham Hassanieh; Piotr Indyk; Dina Katabi; Eric Price 001 (SODA, 2012)

Nearly optimal sparse fourier transform. - Haitham Hassanieh; Piotr Indyk; Dina Katabi; Eric Price 001 (STOC, 2012)

Compressive Sensing with Local Geometric Features. - Rishi Gupta; Piotr Indyk; Eric Price 001; Yaron Rachlin (Int. J. Comput. Geom. Appl., 2012)

Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality. - Sariel Har-Peled; Piotr Indyk; Rajeev Motwani 001 (Theory Comput., 2012)

Sample-optimal average-case sparse Fourier Transform in two dimensions. - Badih Ghazi; Haitham Hassanieh; Piotr Indyk; Dina Katabi; Eric Price 001; Lixin Shi (Allerton, 2013)

Diverse near neighbor problem. - Sofiane Abbar; Sihem Amer-Yahia; Piotr Indyk; Sepideh Mahabadi; Kasturi R. Varadarajan (SoCG, 2013)

Compressive sensing using locality-preserving matrices. - Elyot Grant; Piotr Indyk (SoCG, 2013)

Nearly optimal linear embeddings into very low dimensions. - Elyot Grant; Chinmay Hegde; Piotr Indyk (GlobalSIP, 2013)

On Model-Based RIP-1 Matrices. - Piotr Indyk; Ilya P. Razenshteyn (ICALP (1), 2013)

Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform. - Piotr Indyk (PODS, 2013)

Shift Finding in Sub-Linear Time. - Alexandr Andoni; Piotr Indyk; Dina Katabi; Haitham Hassanieh (SODA, 2013)

Euclidean spanners in high dimensions. - Sariel Har-Peled; Piotr Indyk; Anastasios Sidiropoulos (SODA, 2013)

Real-time recommendation of diverse related articles. - Sofiane Abbar; Sihem Amer-Yahia; Piotr Indyk; Sepideh Mahabadi (WWW, 2013)

Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing. - Narayanan Sundaram; Aizana Turmukhametova; Nadathur Satish; Todd Mostak; Piotr Indyk; Samuel Madden 001; Pradeep Dubey (Proc. VLDB Endow., 2013)

Better embeddings for planar Earth-Mover Distance over sparse sets. - Arturs Backurs; Piotr Indyk (SoCG, 2014)

Sample-Optimal Fourier Sampling in Any Constant Dimension. - Piotr Indyk; Michael Kapralov (FOCS, 2014)

Nearly Linear-Time Model-Based Compressive Sensing. - Chinmay Hegde; Piotr Indyk; Ludwig Schmidt (ICALP (1), 2014)

Automatic fault localization using the generalized Earth Mover's distance. - Ludwig Schmidt; Chinmay Hegde; Piotr Indyk; Jonathan Kane; Ligang Lu; Detlef Hohl (ICASSP, 2014)

A fast approximation algorithm for tree-sparse recovery. - Chinmay Hegde; Piotr Indyk; Ludwig Schmidt (ISIT, 2014)

Composable core-sets for diversity and coverage maximization. - Piotr Indyk; Sepideh Mahabadi; Mohammad Mahdian; Vahab S. Mirrokni (PODS, 2014)

Beyond Locality-Sensitive Hashing. - Alexandr Andoni; Piotr Indyk; Huy L. Nguyen; Ilya P. Razenshteyn (SODA, 2014)

Approximation-Tolerant Model-Based Compressive Sensing. - Chinmay Hegde; Piotr Indyk; Ludwig Schmidt (SODA, 2014)

(Nearly) Sample-Optimal Sparse Fourier Transform. - Piotr Indyk; Michael Kapralov; Eric Price 001 (SODA, 2014)

On Streaming and Communication Complexity of the Set Cover Problem. - Erik D. Demaine; Piotr Indyk; Sepideh Mahabadi; Ali Vakilian (DISC, 2014)

Sample-Optimal Fourier Sampling in Any Constant Dimension - Part I. - Piotr Indyk; Michael Kapralov (CoRR, 2014)

Recent Developments in the Sparse Fourier Transform: A compressed Fourier transform for big data. - Anna C. Gilbert; Piotr Indyk; Mark A. Iwen; Ludwig Schmidt (IEEE Signal Process. Mag., 2014)

Seismic feature extraction using steiner tree methods. - Ludwig Schmidt; Chinmay Hegde; Piotr Indyk; Ligang Lu; Xingang Chi; Detlef Hohl (ICASSP, 2015)

A Nearly-Linear Time Framework for Graph-Structured Sparsity. - Chinmay Hegde; Piotr Indyk; Ludwig Schmidt (ICML, 2015)

Practical and Optimal LSH for Angular Distance. - Alexandr Andoni; Piotr Indyk; Thijs Laarhoven; Ilya P. Razenshteyn; Ludwig Schmidt (NIPS, 2015)

Erratum for: Approximating and Testing k-Histogram Distributions in Sub-linear Time. - Piotr Indyk; Reut Levi; Ronitt Rubinfeld (PODS, 2015)

Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching. - Arturs Backurs; Piotr Indyk; Eric Price 001; Ilya P. Razenshteyn; David P. Woodruff (CoRR, 2015)

Towards Tight Bounds for the Streaming Set Cover Problem. - Piotr Indyk; Sepideh Mahabadi; Ali Vakilian (CoRR, 2015)

Fast Algorithms for Structured Sparsity. - Chinmay Hegde; Piotr Indyk; Ludwig Schmidt (Bull. EATCS, 2015)

Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. - Mahdi Cheraghchi; Piotr Indyk (Electron. Colloquium Comput. Complex., 2015)

Rapid Sampling for Visualizations with Ordering Guarantees. - Albert Kim; Eric Blais; Aditya G. Parameswaran; Piotr Indyk; Samuel Madden 001; Ronitt Rubinfeld (Proc. VLDB Endow., 2015)

Approximation Algorithms for Model-Based Compressive Sensing. - Chinmay Hegde; Piotr Indyk; Ludwig Schmidt (IEEE Trans. Inf. Theory, 2015)

Stable Distributions in Streaming Computations. - Graham Cormode; Piotr Indyk (Data Stream Management, 2016)

Simultaneous Nearest Neighbor Search. - Piotr Indyk; Robert D. Kleinberg; Sepideh Mahabadi; Yang Yuan (SoCG, 2016)

Which Regular Expression Patterns Are Hard to Match? - Arturs Backurs; Piotr Indyk (FOCS, 2016)

Fast recovery from a union of subspaces. - Chinmay Hegde; Piotr Indyk; Ludwig Schmidt (NIPS, 2016)

Towards Tight Bounds for the Streaming Set Cover Problem. - Sariel Har-Peled; Piotr Indyk; Sepideh Mahabadi; Ali Vakilian (PODS, 2016)

Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching. - Arturs Backurs; Piotr Indyk; Ilya P. Razenshteyn; David P. Woodruff (SODA, 2016)

ICALP 2017 - Call for Papers. - Piotr Indyk; Anca Muscholl; Fabian Kuhn (Bull. EATCS, 2016)

Fractional Set Cover in the Streaming Model. - Piotr Indyk; Sepideh Mahabadi; Ronitt Rubinfeld; Jonathan R. Ullman; Ali Vakilian; Anak Yodpinyanee (APPROX-RANDOM, 2017)

On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks. - Arturs Backurs; Piotr Indyk; Ludwig Schmidt (NIPS, 2017)

Practical Data-Dependent Metric Compression with Provable Guarantees. - Piotr Indyk; Ilya P. Razenshteyn; Tal Wagner (NIPS, 2017)

Better Approximations for Tree Sparsity in Nearly-Linear Time. - Arturs Backurs; Piotr Indyk; Ludwig Schmidt (SODA, 2017)

Near-Optimal (Euclidean) Metric Compression. - Piotr Indyk; Tal Wagner (SODA, 2017)

Beyond P vs. NP: Quadratic-Time Hardness for Big Data Problems. - Piotr Indyk (SPAA, 2017)

Agile Millimeter Wave Networks with Provable Guarantees. - Haitham Hassanieh; Omid Abari; Michael Rodreguez; Mohammed A. Abdelghany; Dina Katabi; Piotr Indyk (CoRR, 2017)

Approximate Nearest Neighbors in Limited Space. - Piotr Indyk; Tal Wagner (COLT, 2018)

Efficient Density Evaluation for Smooth Kernels. - Arturs Backurs; Moses Charikar; Piotr Indyk; Paris Siminelakis (FOCS, 2018)

Approximate Sparse Linear Regression. - Sariel Har-Peled; Piotr Indyk; Sepideh Mahabadi (ICALP, 2018)

Fast millimeter wave beam alignment. - Haitham Hassanieh; Omid Abari; Michael Rodriguez; Mohammed A. Abdelghany; Dina Katabi; Piotr Indyk (SIGCOMM, 2018)

Set Cover in Sub-linear Time. - Piotr Indyk; Sepideh Mahabadi; Ronitt Rubinfeld; Ali Vakilian; Anak Yodpinyanee (SODA, 2018)

Approximate Nearest Neighbor Search in High Dimensions. - Alexandr Andoni; Piotr Indyk; Ilya P. Razenshteyn (CoRR, 2018)

Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False). - Arturs Backurs; Piotr Indyk (SIAM J. Comput., 2018)

Sample-Optimal Low-Rank Approximation of Distance Matrices. - Piotr Indyk; Ali Vakilian; Tal Wagner; David P. Woodruff (COLT, 2019)

Learning-Based Frequency Estimation Algorithms. - Chen-Yu Hsu 001; Piotr Indyk; Dina Katabi; Ali Vakilian (ICLR (Poster), 2019)

Scalable Fair Clustering. - Arturs Backurs; Piotr Indyk; Krzysztof Onak; Baruch Schieber; Ali Vakilian; Tal Wagner (ICML, 2019)

Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm. - Sepideh Mahabadi; Piotr Indyk; Shayan Oveis Gharan; Alireza Rezaei 001 (ICML, 2019)

Estimating Entropy of Distributions in Constant Space. - Jayadev Acharya; Sourbh Bhadane; Piotr Indyk; Ziteng Sun (NeurIPS, 2019)

Space and Time Efficient Kernel Density Estimation in High Dimensions. - Arturs Backurs; Piotr Indyk; Tal Wagner (NeurIPS, 2019)

Learning-Based Low-Rank Approximations. - Piotr Indyk; Ali Vakilian; Yang Yuan (NeurIPS, 2019)

Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model. - Piotr Indyk; Ali Vakilian (PODS, 2019)

Learning Sublinear-Time Indexing for Nearest Neighbor Search. - Yihe Dong; Piotr Indyk; Ilya P. Razenshteyn; Tal Wagner (CoRR, 2019)

(Learned) Frequency Estimation Algorithms under Zipfian Distribution. - Anders Aamand; Piotr Indyk; Ali Vakilian (CoRR, 2019)

Scalable Nearest Neighbor Search for Optimal Transport. - Yihe Dong; Piotr Indyk; Ilya P. Razenshteyn; Tal Wagner (CoRR, 2019)

Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces. - Anastasios Sidiropoulos; Mihai Badoiu; Kedar Dhamdhere; Anupam Gupta 001; Piotr Indyk; Yuri Rabinovich; Harald Räcke; R. Ravi 001 (SIAM J. Discret. Math., 2019)

Scalable Nearest Neighbor Search for Optimal Transport. - Arturs Backurs; Yihe Dong; Piotr Indyk; Ilya P. Razenshteyn; Tal Wagner (ICML, 2020)

Composable Core-sets for Determinant Maximization Problems via Spectral Spanners. - Piotr Indyk; Sepideh Mahabadi; Shayan Oveis Gharan; Alireza Rezaei 001 (SODA, 2020)

Learning-based Support Estimation in Sublinear Time. - Talya Eden; Piotr Indyk; Shyam Narayanan; Ronitt Rubinfeld; Sandeep Silwal; Tal Wagner (ICLR, 2021)

Faster Kernel Matrix Algebra via Density Estimation. - Arturs Backurs; Piotr Indyk; Cameron Musco; Tal Wagner (ICML, 2021)

Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering. - Shyam Narayanan; Sandeep Silwal; Piotr Indyk; Or Zamir (ICML, 2021)

Few-Shot Data-Driven Algorithms for Low Rank Approximation. - Piotr Indyk; Tal Wagner; David P. Woodruff (NeurIPS, 2021)

Online Bipartite Matching with Predicted Degrees. - Justin Y. Chen; Piotr Indyk (CoRR, 2021)

Online Page Migration with ML Advice. - Piotr Indyk; Frederik Mallmann-Trenn; Slobodan Mitrovic; Ronitt Rubinfeld (AISTATS, 2022)

Generalization Bounds for Data-Driven Numerical Linear Algebra. - Peter L. Bartlett; Piotr Indyk; Tal Wagner (COLT, 2022)

Targeted Supervised Contrastive Learning for Long-Tailed Recognition. - Tianhong Li; Peng Cao; Yuan Yuan 002; Lijie Fan; Yuzhe Yang 003; Rogério Feris; Piotr Indyk; Dina Katabi (CVPR, 2022)

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 (ICLR, 2022)

Streaming Algorithms for Support-Aware Histograms. - Justin Y. Chen; Piotr Indyk; Tal Wagner (ICML, 2022)

Embeddings and Labeling Schemes for A. - Talya Eden; Piotr Indyk; Haike Xu (ITCS, 2022)

(Optimal) Online Bipartite Matching with Degree Information. - Anders Aamand; Justin Y. Chen; Piotr Indyk (NeurIPS, 2022)

Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks. - Anders Aamand; Justin Y. Chen; Piotr Indyk; Shyam Narayanan; Ronitt Rubinfeld; Nicholas Schiefer; Sandeep Silwal; Tal Wagner (NeurIPS, 2022)

Faster Linear Algebra for Distance Matrices. - Piotr Indyk; Sandeep Silwal (NeurIPS, 2022)

Frequency Estimation with One-Sided Error. - Piotr Indyk; Shyam Narayanan; David P. Woodruff (SODA, 2022)

Sub-quadratic Algorithms for Kernel Matrices via Kernel Density Estimation. - Ainesh Bakshi; Piotr Indyk; Praneeth Kacham; Sandeep Silwal; Samson Zhou (CoRR, 2022)

Optimal (Euclidean) Metric Compression. - Piotr Indyk; Tal Wagner (SIAM J. Comput., 2022)

Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case Guarantees. - Nicholas Schiefer; Justin Y. Chen; Piotr Indyk; Shyam Narayanan; Sandeep Silwal; Tal Wagner (ACDA, 2023)

Subquadratic Algorithms for Kernel Matrices via Kernel Density Estimation. - Ainesh Bakshi; Piotr Indyk; Praneeth Kacham; Sandeep Silwal; Samson Zhou (ICLR, 2023)

Data Structures for Density Estimation. - Anders Aamand; Alexandr Andoni; Justin Y. Chen; Piotr Indyk; Shyam Narayanan; Sandeep Silwal (ICML, 2023)

Differentially Private Approximate Near Neighbor Counting in High Dimensions. - Alexandr Andoni; Piotr Indyk; Sepideh Mahabadi; Shyam Narayanan (NeurIPS, 2023)

Near-Linear Time Algorithm for the Chamfer Distance. - Ainesh Bakshi; Piotr Indyk; Rajesh Jayaram; Sandeep Silwal; Erik Waingarten (NeurIPS, 2023)

Worst-case Performance of Popular Approximate Nearest Neighbor Search Implementations: Guarantees and Limitations. - Piotr Indyk; Haike Xu (NeurIPS, 2023)

Addressing Feature Suppression in Unsupervised Visual Representations. - Tianhong Li; Lijie Fan; Yuan Yuan 002; Hao He 011; Yonglong Tian; Rogério Feris; Piotr Indyk; Dina Katabi (WACV, 2023)

Learning Space Partitions for Nearest Neighbor Search. - Yihe Dong; Piotr Indyk; Ilya P. Razenshteyn; Tal Wagner (IEEE Data Eng. Bull., 2023)

Space-Optimal Profile Estimation in Data Streams with Applications to Symmetric Functions. - Justin Y. Chen; Piotr Indyk; David P. Woodruff (ITCS, 2024)

Statistical-Computational Trade-offs for Density Estimation. - Anders Aamand; Alexandr Andoni; Justin Y. Chen; Piotr Indyk; Shyam Narayanan; Sandeep Silwal; Haike Xu (NeurIPS, 2024)

Optimal Algorithms for Augmented Testing of Discrete Distributions. - Maryam Aliakbarpour; Piotr Indyk; Ronitt Rubinfeld; Sandeep Silwal (NeurIPS, 2024)

Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors. - Vaggos Chatziafratis; Piotr Indyk (SOSA, 2024)

A Bi-metric Framework for Fast Similarity Search. - Haike Xu; Sandeep Silwal; Piotr Indyk (CoRR, 2024)

SparseCL: Sparse Contrastive Learning for Contradiction Retrieval. - Haike Xu; Zongyu Lin; Yizhou Sun; Kai-Wei Chang; Piotr Indyk (CoRR, 2024)

Optimal and learned algorithms for the online list update problem with Zipfian accesses. - Piotr Indyk; Isabelle Quaye; Ronitt Rubinfeld; Sandeep Silwal (ALT, 2025)

Even Faster Algorithm for the Chamfer Distance. - Ying Feng; Piotr Indyk (ICALP, 2025)

Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions. - Piotr Indyk; Michael Kapralov; Kshiteej Sheth; Tal Wagner (ICLR, 2025)

Graph-Based Algorithms for Diverse Similarity Search. - Piyush Anand; Piotr Indyk; Ravishankar Krishnaswamy; Sepideh Mahabadi; Vikas C. Raykar; Kirankumar Shiragur; Haike Xu (CoRR, 2025)