Piotr Indyk

发表

Geometric matching under noise: combinatorial bounds and algorithms

Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian, 1999, SODA '99.

Adaptive Mean Shift Based Clustering in High Dimensions

Trevor Darrell, Piotr Indyk, Gregory Shakhnarovich, 2006 .

Sparse Signal Recovery and Acquisition with Graphical Models

Volkan Cevher, Piotr Indyk, Richard G. Baraniuk, 2010, IEEE Signal Processing Magazine.

Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm pdf

Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, 2019, ICML.

Nearly optimal linear embeddings into very low dimensions

Piotr Indyk, Chinmay Hegde, Elyot Grant, 2013, 2013 IEEE Global Conference on Signal and Information Processing.

Low-Distortion Embeddings of Finite Metric Spaces

Jirí Matousek, Piotr Indyk, P. Indyk, 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

ICALP 2017 - Call for Papers

Piotr Indyk, Anca Muscholl, Fabian Kuhn, 2016, Bull. EATCS.

Practical and Optimal LSH for Angular Distance

Alexandr Andoni, Piotr Indyk, Ilya P. Razenshteyn, 2015, NIPS.

Neural Embeddings for Nearest Neighbor Search Under Edit Distance

Xiyuan Zhang, Piotr Indyk, Yang Yuan, 2019 .

Automatic fault localization using the generalized Earth Mover's distance

Piotr Indyk, Chinmay Hegde, Ludwig Schmidt, 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

Geometric pattern matching: a performance study

Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian, 1999, SCG '99.

Sublinear time algorithms for metric space problems

Piotr Indyk, P. Indyk, 1999, STOC '99.

K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance pdf

Piotr Indyk, Eric Price, P. Indyk, 2011, STOC '11.

Diverse near neighbor problem

Sihem Amer-Yahia, Piotr Indyk, Sofiane Abbar, 2013, SoCG '13.

Faster algorithms for string matching problems: matching the convolution bound

Piotr Indyk, P. Indyk, 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

Compressive sensing with local geometric features

Piotr Indyk, Eric Price, Yaron Rachlin, 2011, SoCG '11.

Learning Approximate Sequential Patterns for Classification

Piotr Indyk, Zeeshan Syed, John V. Guttag, 2009, J. Mach. Learn. Res..

Facility Location in Sublinear Time

Piotr Indyk, Artur Czumaj, Christian Sohler, 2005, ICALP.

Motif discovery in physiological datasets: A methodology for inferring predictive elements

Piotr Indyk, Manolis Kellis, Zeeshan Syed, 2010, TKDD.

Tree pattern matching and subset matching in deterministic O(n log3 n)-time

Richard Cole, Piotr Indyk, Ramesh Hariharan, 1999, SODA '99.

Learning-Based Frequency Estimation Algorithms

Piotr Indyk, Dina Katabi, Ali Vakilian, 2018, ICLR.

Closest Pair Problems in Very High Dimensions

Moshe Lewenstein, Piotr Indyk, Ely Porat, 2004, ICALP.

External Inverse Pattern Matching

Piotr Indyk, Piotr Krysta, Leszek Gasieniec, 1997, CPM.

A near linear time constant factor approximation for Euclidean bichromatic matching (cost)

Piotr Indyk, P. Indyk, 2007, SODA '07.

Approximation algorithms for embedding general metrics into trees

Piotr Indyk, Mihai Badoiu, Anastasios Sidiropoulos, 2007, SODA '07.

A Nearly-Linear Time Framework for Graph-Structured Sparsity

Piotr Indyk, Chinmay Hegde, Ludwig Schmidt, 2015, ICML.

Near-optimal sparse fourier representations via sampling

Sudipto Guha, Piotr Indyk, S. Muthukrishnan, 2002, STOC '02.

Locality-preserving hashing in multidimensional spaces

Santosh S. Vempala, Piotr Indyk, Rajeev Motwani, 1997, STOC '97.

Space and Time Efficient Kernel Density Estimation in High Dimensions

Piotr Indyk, Tal Wagner, Arturs Backurs, 2019, NeurIPS.

Nearly Linear-Time Model-Based Compressive Sensing

Piotr Indyk, Chinmay Hegde, Ludwig Schmidt, 2014, ICALP.

Finding interesting associations without support pruning

Edith Cohen, Piotr Indyk, Rajeev Motwani, 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

Parameter-Sensitive Hashing for Fast Pose Estimation

Trevor Darrell, Piotr Indyk, Gregory Shakhnarovich, 2006 .

Lower bounds for embedding edit distance into normed spaces

Alexandr Andoni, Piotr Indyk, Sofya Raskhodnikova, 2003, SODA '03.

Linear-Time List Decoding in Error-Free Settings: (Extended Abstract)

Venkatesan Guruswami, Piotr Indyk, 2004, ICALP.

Probabilistic analysis for combinatorial functions of moving points

Piotr Indyk, Li Zhang, Harish Devarajan, 1997, SCG '97.

Efficient regular data structures and algorithms for location and proximity problems

Hanan Samet, Piotr Indyk, Alon Efrat, 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

Interpolation of symmetric functions and a new type of combinatorial design

Piotr Indyk, P. Indyk, 1999, STOC '99.

Sparse Recovery Using Sparse Matrices Significant results in predicting the operation of equipment such as network routers, or the results of group testing for defective items, can often be obtained from a few samples.

Piotr Indyk, Anna Rebecca Gilbert, P. Indyk, 2010 .

(Nearly) Sample-Optimal Sparse Fourier Transform

Piotr Indyk, Eric Price, Mikhail Kapralov, 2014, SODA.

On page migration and other relaxed task systems

Piotr Indyk, Moses Charikar, Yair Bartal, 1997, SODA '97.

Efficient Parallel Computing with Memory Faults

Piotr Indyk, Leszek Gasieniec, P. Indyk, 1997, FCT.

Agile Millimeter Wave Networks with Provable Guarantees pdf

Piotr Indyk, Omid Salehi-Abari, Dina Katabi, 2017, ArXiv.

Scalable Nearest Neighbor Search for Optimal Transport pdf

Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner, 2019, ICML.

Space-optimal heavy hitters with strong error bounds

Piotr Indyk, Graham Cormode, Martin J. Strauss, 2009, PODS.

Piotr Indyk, Aristides Gionis, Taher H. Haveliwala, 2001 .

Combining geometry and combinatorics: A unified approach to sparse signal recovery

Piotr Indyk, Howard J. Karloff, Anna C. Gilbert, 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

Shared-Memory Simulations on a Faulty-Memory DMM

Piotr Indyk, Bogdan S. Chlebus, Anna Gambin, 1996, ICALP.

Rapid Sampling for Visualizations with Ordering Guarantees

Ronitt Rubinfeld, Piotr Indyk, Aditya G. Parameswaran, 2014, Proc. VLDB Endow..

Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform

Piotr Indyk, Mahdi Cheraghchi, P. Indyk, 2015, SODA.

Simple and practical algorithm for sparse Fourier transform

Piotr Indyk, Dina Katabi, Haitham Hassanieh, 2012, SODA.

Efficient Density Evaluation for Smooth Kernels

Piotr Indyk, Moses Charikar, Paris Siminelakis, 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

Optimal approximations of the frequency moments of data streams

David P. Woodruff, Piotr Indyk, P. Indyk, 2005, STOC '05.

On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks

Piotr Indyk, Ludwig Schmidt, Arturs Backurs, 2017, NIPS.

On the Optimality of the Dimensionality Reduction Method

Alexandr Andoni, Piotr Indyk, Mihai Patrascu, 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

Compressive sensing using locality-preserving matrices

Piotr Indyk, Elyot Grant, P. Indyk, 2013, SoCG '13.

On Word-Level Parallelism in Fault-Tolerant Computing

Piotr Indyk, P. Indyk, 1996, STACS.

Maintaining stream statistics over sliding windows: (extended abstract)

Piotr Indyk, Rajeev Motwani, Aristides Gionis, 2002, SODA '02.

Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)

Piotr Indyk, Arturs Backurs, P. Indyk, 2014, STOC.

Sparse Recovery with Partial Support Knowledge

Piotr Indyk, Khanh Do Ba, P. Indyk, 2011, APPROX-RANDOM.

Deterministic superimposed coding with applications to pattern matching

Piotr Indyk, P. Indyk, 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

Almost-Euclidean Subspaces of l1N\ell_1^N via Tensor Products: A Simple Approach to Randomness Reduction

Piotr Indyk, Stanislaw J. Szarek, 2010, APPROX-RANDOM.

Mining the stock market (extended abstract): which measure is best?

Piotr Indyk, Rajeev Motwani, Dragomir Anguelov, 2000, KDD '00.

Composable core-sets for diversity and coverage maximization

Vahab S. Mirrokni, Piotr Indyk, Mohammad Mahdian, 2014, PODS.

Learning Embeddings for Fast Approximate Nearest Neighbor Retrieval

Trevor Darrell, Piotr Indyk, Gregory Shakhnarovich, 2006 .

Efficient and reliable low-power backscatter networks

Piotr Indyk, Dina Katabi, Haitham Hassanieh, 2012, CCRV.

Lower bounds for sparse recovery pdf

David P. Woodruff, Piotr Indyk, Eric Price, 2010, SODA '10.

Efficiently decodable non-adaptive group testing

Atri Rudra, Piotr Indyk, Hung Q. Ngo, 2010, SODA '10.

The Complexity of Linear Dependence Problems in Vector Spaces

David P. Woodruff, Piotr Indyk, Arnab Bhattacharyya, 2011, ICS.

Declaring independence via the sketching of sketches

Piotr Indyk, Andrew McGregor, P. Indyk, 2008, SODA '08.

Fractional Set Cover in the Streaming Model

Ronitt Rubinfeld, Piotr Indyk, Sepideh Mahabadi, 2017, APPROX-RANDOM.

Practical Data-Dependent Metric Compression with Provable Guarantees

Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner, 2017, NIPS.

Proceeding of the Annual ACM-SIAM Symposium on Discrete Algorithms: Preface

Kirk Pruhs, Sudipto Guha, Haim Kaplan, 2005, ACM-SIAM Symposium on Discrete Algorithms.

Fast, small-space algorithms for approximate histogram maintenance

Sudipto Guha, Piotr Indyk, S. Muthukrishnan, 2002, STOC '02.

Probabilistic embeddings of bounded genus graphs into planar graphs

Piotr Indyk, Anastasios Sidiropoulos, P. Indyk, 2007, SCG '07.

Better Approximations for Tree Sparsity in Nearly-Linear Time

Piotr Indyk, Ludwig Schmidt, Arturs Backurs, 2017, SODA.

Seismic feature extraction using steiner tree methods

Piotr Indyk, Chinmay Hegde, Ludwig Schmidt, 2015, 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

Derandomized dimensionality reduction with applications

Ryan O'Donnell, Piotr Indyk, Lars Engebretsen, 2002, SODA '02.

Pattern Matching for Sets of Segments

Piotr Indyk, Suresh Venkatasubramanian, Alon Efrat, 2000, SODA '01.

Algorithms for dynamic geometric problems over data streams

Piotr Indyk, P. Indyk, 2004, STOC '04.

Low-Dimensional Embedding with Extra Information

Piotr Indyk, Erik D. Demaine, Mohammad Taghi Hajiaghayi, 2006, Discret. Comput. Geom..

Fast estimation of diameter and shortest paths (without matrix multiplication)

Piotr Indyk, Rajeev Motwani, Chandra Chekuri, 1996, SODA '96.

A sublinear time approximation scheme for clustering in metric spaces

Piotr Indyk, 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

Fast millimeter wave beam alignment

Piotr Indyk, Omid Salehi-Abari, Dina Katabi, 2018, SIGCOMM.

On Streaming and Communication Complexity of the Set Cover Problem

Piotr Indyk, Erik D. Demaine, Sepideh Mahabadi, 2014, DISC.

Approximate clustering via core-sets

Piotr Indyk, Sariel Har-Peled, Mihai Badoiu, 2002, STOC '02.

Low-distortion embeddings of general metrics into the line

Piotr Indyk, Mihai Badoiu, Anastasios Sidiropoulos, 2005, STOC '05.

Linear-time encodable/decodable codes with near-optimal rate

Venkatesan Guruswami, Piotr Indyk, P. Indyk, 2005, IEEE Transactions on Information Theory.

On Model-Based RIP-1 Matrices pdf

Piotr Indyk, Ilya P. Razenshteyn, P. Indyk, 2013, ICALP.

Probabilistic Analysis for Discrete Attributes of Moving Points

Piotr Indyk, Li Zhang, Harish Devarajan, 2003, Int. J. Comput. Geom. Appl..

Overcoming the l1 non-embeddability barrier: algorithms for product metrics

Alexandr Andoni, Robert Krauthgamer, Piotr Indyk, 2009, SODA.

Beyond Locality-Sensitive Hashing

Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, 2013, SODA.

Beyond P vs. NP: Quadratic-Time Hardness for Big Data Problems

Piotr Indyk, 2017, SPAA.

Euclidean spanners in high dimensions

Piotr Indyk, Sariel Har-Peled, Anastasios Sidiropoulos, 2013, SODA.

Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions

Alexandr Andoni, Piotr Indyk, P. Indyk, 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

Piotr Indyk, Rajeev Motwani, Aristides Gionis, 1999, VLDB.

Sequential Sparse Matching Pursuit

Piotr Indyk, Radu Berinde, P. Indyk, 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

Erratum for: Approximating and Testing k-Histogram Distributions in Sub-linear Time

Ronitt Rubinfeld, Piotr Indyk, Reut Levi, 2015, PODS.

Online Page Migration with ML Advice pdf

Ronitt Rubinfeld, Piotr Indyk, Frederik Mallmann-Trenn, 2020, AISTATS.

Explicit constructions for compressed sensing of sparse signals

Piotr Indyk, 2008, SODA '08.

Fast recovery from a union of subspaces

Piotr Indyk, Chinmay Hegde, Ludwig Schmidt, 2016, NIPS.

Scalable Fair Clustering pdf

Krzysztof Onak, Piotr Indyk, Baruch Schieber, 2019, ICML.

Pradeep Dubey, Piotr Indyk, Samuel Madden, 2013, Proc. VLDB Endow..

Learning Sublinear-Time Indexing for Nearest Neighbor Search pdf

Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner, 2019, ArXiv.

Nearest Neighbors in High-Dimensional Spaces

Piotr Indyk, P. Indyk, 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

Linear time encodable and list decodable codes

Venkatesan Guruswami, Piotr Indyk, P. Indyk, 2003, STOC '03.

Learning Space Partitions for Nearest Neighbor Search

Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner, 2019, ICLR.

Sampling in dynamic data streams and applications

Piotr Indyk, Christian Sohler, Gereon Frahling, 2005, Int. J. Comput. Geom. Appl..

Embedding ultrametrics into low-dimensional spaces

Piotr Indyk, Mihai Badoiu, Anastasios Sidiropoulos, 2006, SCG '06.

When crossings count — approximating the minimum spanning tree

Piotr Indyk, Sariel Har-Peled, 2000, SCG '00.

Streaming Algorithms for Geometric Problems

Piotr Indyk, P. Indyk, 2004, FSTTCS.

Sampling in Dynamic Data Streams and Applications

Piotr Indyk, Christian Sohler, Gereon Frahling, 2008, Int. J. Comput. Geom. Appl..

Nearest-Neighbor Methods in Learning and Vision: Theory and Practice (Neural Information Processing)

Trevor Darrell, Piotr Indyk, Gregory Shakhnarovich, 2006 .

Approximate nearest neighbors: towards removing the curse of dimensionality

Piotr Indyk, Rajeev Motwani, R. Motwani, 1998, STOC '98.

Efficient computations of l1 and l∞ rearrangement distances

Piotr Indyk, Yonatan Aumann, Ely Porat, 2009, Theor. Comput. Sci..

Stable distributions, pseudorandom generators, embeddings, and data stream computation

Piotr Indyk, P. Indyk, 2006, JACM.

Near-Optimal (Euclidean) Metric Compression

Piotr Indyk, Tal Wagner, 2017, SODA.

External Sampling

Alexandr Andoni, Krzysztof Onak, Ronitt Rubinfeld, 2009, ICALP.

Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems

Hanan Samet, Piotr Indyk, Alon Efrat, 1999, Algorithmica.

Simultaneous Nearest Neighbor Search pdf

Piotr Indyk, Yang Yuan, Sepideh Mahabadi, 2016, SoCG.

Sketching information divergences

Sudipto Guha, Piotr Indyk, Andrew McGregor, 2007, Machine Learning.

Embeddings and non-approximability of geometric problems

Venkatesan Guruswami, Piotr Indyk, P. Indyk, 2003, SODA '03.

Scalable Techniques for Clustering the Web (Extended Abstract)

Piotr Indyk, Aristides Gionis, Taher H. Haveliwala, 2000 .

Real-time recommendation of diverse related articles

Sihem Amer-Yahia, Piotr Indyk, Sofiane Abbar, 2013, WWW.

Object Recognition using Locality Sensitive Hashing of Shape Contexts

Trevor Darrell, Piotr Indyk, Gregory Shakhnarovich, 2006 .

Shared-Memory Simulation on a FaultyMemory DMM

Piotr Indyk, Bogdan S. Chlebus, Anna Gambin, 1996 .

Sparse Recovery Using Sparse Matrices

Piotr Indyk, Anna C. Gilbert, A. Gilbert, 2010, Proceedings of the IEEE.

Approximation Algorithms for Model-Based Compressive Sensing

Piotr Indyk, Chinmay Hegde, Ludwig Schmidt, 2014, IEEE Transactions on Information Theory.

Efficient algorithms for substring near neighbor problem

Alexandr Andoni, Piotr Indyk, 2006, SODA '06.

Combinatorial and Experimental Methods for Approximate Point Pattern Matching

Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian, 2003, Algorithmica.

Sketching Information Divergences

Sudipto Guha, Piotr Indyk, Andrew McGregor, 2007, COLT.

Online Embeddings

Piotr Indyk, Anastasios Sidiropoulos, Avner Magen, 2010, APPROX-RANDOM.

On the Power of Adaptivity in Sparse Recovery

David P. Woodruff, Piotr Indyk, Eric Price, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

Learning-Based Low-Rank Approximations

Piotr Indyk, Yang Yuan, Ali Vakilian, 2019, NeurIPS.

Approximation-Tolerant Model-Based Compressive Sensing

Piotr Indyk, Chinmay Hegde, Ludwig Schmidt, 2014, SODA.

Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)

Piotr Indyk, Arturs Backurs, P. Indyk, 2014, STOC.

Sample-Optimal Fourier Sampling in Any Constant Dimension

Piotr Indyk, Mikhail Kapralov, P. Indyk, 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

Better embeddings for planar Earth-Mover Distance over sparse sets

Piotr Indyk, Arturs Backurs, P. Indyk, 2014, SoCG.

Approximate congruence in nearly linear time

Piotr Indyk, Suresh Venkatasubramanian, Suresh Venkatasubramanian, 2000, SODA '00.

Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model

Piotr Indyk, Ali Vakilian, 2019, PODS.

Sparse Recovery Using Sparse Random Matrices

Piotr Indyk, P. Indyk, 2010, LATIN.

Sublinear Algorithms in the External Memory Model

Alexandr Andoni, Krzysztof Onak, Ronitt Rubinfeld, 2010, Property Testing.

Approximate Nearest Neighbor under edit distance via product metrics

Piotr Indyk, P. Indyk, 2004, SODA '04.

Finding Interesting Associations without Support Pruning

Edith Cohen, Piotr Indyk, Rajeev Motwani, 2001, IEEE Trans. Knowl. Data Eng..

Enhanced hypertext categorization using hyperlinks

Piotr Indyk, Soumen Chakrabarti, Byron Dom, 1998, SIGMOD '98.

Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions

Alexandr Andoni, Piotr Indyk, P. Indyk, 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems

Piotr Indyk, Rina Panigrahy, Moses Charikar, 2002, ICALP.

Explicit constructions of selectors and related combinatorial structures, with applications

Piotr Indyk, P. Indyk, 2002, SODA '02.

( A review of a broad set of sparse models, analysis tools, and recovery algorithms within the graphical models formalism )

Piotr Indyk, Richard G. Baraniuk, Lawrence Carin, 2010 .

Approximate Sparse Linear Regression

Piotr Indyk, Sariel Har-Peled, Sepideh Mahabadi, 2018, ICALP.

Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform

Piotr Indyk, P. Indyk, 2013, PODS '13.

Efficient Sketches for Earth-Mover Distance, with Applications

David P. Woodruff, Alexandr Andoni, Piotr Indyk, 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

Nearest-neighbor-preserving embeddings

Piotr Indyk, Assaf Naor, P. Indyk, 2007, TALG.

Composable Core-sets for Determinant Maximization Problems via Spectral Spanners pdf

Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, 2018, SODA.

A small approximately min-wise independent family of hash functions

Piotr Indyk, P. Indyk, 1999, SODA '99.

Uncertainty principles, extractors, and explicit embeddings of l2 into l1

Piotr Indyk, P. Indyk, 2007, STOC '07.

Nearest-Neighbor Methods in Learning and Vision

Trevor Darrell, Piotr Indyk, Gregory Shakhnarovich, 2008, IEEE Trans. Neural Networks.

List-decoding in Linear Time

Piotr Indyk, 2002, Electron. Colloquium Comput. Complex..

Better algorithms for high-dimensional proximity problems via asymmetric embeddings

Piotr Indyk, P. Indyk, 2003, SODA '03.

Algorithmic applications of low-distortion geometric embeddings

Piotr Indyk, P. Indyk, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

Compressive Sensing with Local Geometric Features

Piotr Indyk, Eric Price, Yaron Rachlin, 2012, Int. J. Comput. Geom. Appl..

PRAM Computations Resilient to Memory Faults

Piotr Indyk, Bogdan S. Chlebus, Anna Gambin, 1994, ESA.

A fast approximation algorithm for tree-sparse recovery

Piotr Indyk, Chinmay Hegde, Ludwig Schmidt, 2014, 2014 IEEE International Symposium on Information Theory.

Nearly optimal sparse fourier transform

Piotr Indyk, Dina Katabi, Haitham Hassanieh, 2012, STOC '12.

Approximate Nearest Neighbors in Limited Space

Piotr Indyk, Tal Wagner, 2018, COLT.

Dynamic multidimensional histograms

Sudipto Guha, Piotr Indyk, Nick Koudas, 2002, SIGMOD '02.

Optimal Simulation of Automata by Neural Nets

Piotr Indyk, 1995, STACS.

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015

Piotr Indyk, 2015, SODA.

Space-optimal heavy hitters with strong error bounds

Piotr Indyk, Graham Cormode, Martin Strauss, 2010, TODS.

On approximate nearest neighbors in non-Euclidean spaces

Piotr Indyk, 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

Fast mining of massive tabular data via approximate distance computations

Piotr Indyk, Graham Cormode, S. Muthukrishnan, 2002, Proceedings 18th International Conference on Data Engineering.

Stable Distributions in Streaming Computations

Piotr Indyk, Graham Cormode, P. Indyk, 2016, Data Stream Management.

Evaluating strategies for similarity search on the web

Dan Klein, Piotr Indyk, Aristides Gionis, 2002, WWW '02.

Stochastic load balancing and related problems

Ashish Goel, Piotr Indyk, P. Indyk, 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

Recent Developments in the Sparse Fourier Transform: A compressed Fourier transform for big data

Piotr Indyk, Anna C. Gilbert, Ludwig Schmidt, 2014, IEEE Signal Processing Magazine.

Fast approximate pattern matching with few indels via embeddings

Piotr Indyk, Mihai Badoiu, 2004, SODA '04.

A simple construction of almost-Euclidean subspaces of ℓ1N via tensor products pdf

Piotr Indyk, Stanislaw J. Szarek, 2010, ArXiv.

Set Cover in Sub-linear Time pdf

Ronitt Rubinfeld, Piotr Indyk, Sepideh Mahabadi, 2018, SODA.

Approximate nearest neighbor algorithms for Hausdorff metrics via embeddings

Piotr Indyk, Martin Farach-Colton, P. Indyk, 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

Shift Finding in Sub-Linear Time

Alexandr Andoni, Piotr Indyk, Dina Katabi, 2013, SODA.

Dimensionality reduction techniques for proximity problems

Piotr Indyk, 2000, SODA '00.

Low-Dimensional Embedding with Extra Information

Piotr Indyk, Erik D. Demaine, Mohammad Taghi Hajiaghayi, 2004, SCG '04.

Approximate Nearest Neighbor Search in High Dimensions pdf

Alexandr Andoni, Piotr Indyk, Ilya P. Razenshteyn, 2018, Proceedings of the International Congress of Mathematicians (ICM 2018).

Comparing Data Streams Using Hamming Norms (How to Zero In)

Piotr Indyk, Graham Cormode, S. Muthukrishnan, 2002, VLDB.

Sample-optimal average-case sparse Fourier Transform in two dimensions

Piotr Indyk, Badih Ghazi, Lixin Shi, 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

Approximating and testing k-histogram distributions in sub-linear time

Ronitt Rubinfeld, Piotr Indyk, Reut Levi, 2012, PODS '12.

Model-based compressive sensing with Earth Mover's Distance constraints

Piotr Indyk, Leslie A. Kolodziejski, 2013 .

Fast Algorithms for Structured Sparsity

Piotr Indyk, Chinmay Hegde, Ludwig Schmidt, 2015, Bull. EATCS.

Faster GPS via the sparse fourier transform

Piotr Indyk, Fadel Adib, Dina Katabi, 2012, Mobicom '12.

Scalable Techniques for Clustering the Web

Piotr Indyk, Aristides Gionis, Taher H. Haveliwala, 2000, WebDB.

On Learning Disjunctions of Zero-One Treshold Functions with Queries

Piotr Indyk, Tibor Hegedüs, P. Indyk, 1997, ALT.

Efficient Computations of l1 and linfinity Rearrangement Distances

Piotr Indyk, Yonatan Aumann, Ely Porat, 2007, SPIRE.

Polylogarithmic Private Approximations and Efficient Matching

David P. Woodruff, Piotr Indyk, P. Indyk, 2006, TCC.

Identifying Representative Trends in Massive Time Series Data Sets Using Sketches

Piotr Indyk, S. Muthukrishnan, Nick Koudas, 2000, VLDB.

(Learned) Frequency Estimation Algorithms under Zipfian Distribution pdf

Piotr Indyk, Anders Aamand, Ali Vakilian, 2019, ArXiv.

Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates

Venkatesan Guruswami, Piotr Indyk, P. Indyk, 2004, SODA '04.

Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets

Venkatesan Guruswami, Piotr Indyk, P. Indyk, 2002, STOC '02.

Reductions among high dimensional proximity problems

Ashish Goel, Piotr Indyk, Kasturi R. Varadarajan, 2001, SODA '01.

Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching pdf

David P. Woodruff, Piotr Indyk, Ilya P. Razenshteyn, 2015, SODA.

On Approximate Nearest Neighbors under linfinity Norm

Piotr Indyk, P. Indyk, 2001, J. Comput. Syst. Sci..

Locality-Sensitive Hashing Using Stable Distributions

Trevor Darrell, Piotr Indyk, Gregory Shakhnarovich, 2006 .

Focal plane array folding for efficient information extraction and tracking

Piotr Indyk, Chris Yu, Lei Hamilton, 2012, 2012 IEEE Applied Imagery Pattern Recognition Workshop (AIPR).

Towards Tight Bounds for the Streaming Set Cover Problem

Piotr Indyk, Sepideh Mahabadi, Ali Vakilian, 2015, PODS.

Approximate line nearest neighbor in high dimensions

Alexandr Andoni, Robert Krauthgamer, Piotr Indyk, 2009, SODA.

Expander-based constructions of efficiently decodable codes

Venkatesan Guruswami, Piotr Indyk, P. Indyk, 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

Histogramming Data Streams with Fast Per-Item Processing

Sudipto Guha, Piotr Indyk, S. Muthukrishnan, 2002, ICALP.

Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality

Piotr Indyk, Rajeev Motwani, Sariel Har-Peled, 2012, Theory Comput..

LOCAL DECODING OF WALSH CODES TO REDUCE CDMA DESPREADING COMPUTATION

Jon Feldman, David R. Karger, Piotr Indyk, 2005 .

Approximate nearest neighbor algorithms for Frechet distance via product metrics

Piotr Indyk, P. Indyk, 2002, SCG '02.

Shot encoding with random projections

Piotr Indyk, Ludwig Schmidt, Detlef Hohl, 2013 .

Which Regular Expression Patterns Are Hard to Match?

Piotr Indyk, Arturs Backurs, P. Indyk, 2015, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

New Algorithms for Efficient High-Dimensional Nonparametric Classification

Trevor Darrell, Piotr Indyk, Gregory Shakhnarovich, 2006 .

Earth mover distance over high-dimensional spaces

Alexandr Andoni, Robert Krauthgamer, Piotr Indyk, 2008, SODA '08.

Approximate Sparse Linear Regression pdf

Piotr Indyk, Sariel Har-Peled, Sepideh Mahabadi, 2016, ICALP.

Locality-sensitive hashing scheme based on p-stable distributions

Nicole Immorlica, Vahab S. Mirrokni, Piotr Indyk, 2004, SCG '04.

Sample-Optimal Low-Rank Approximation of Distance Matrices

David P. Woodruff, Piotr Indyk, Tal Wagner, 2019, COLT.

Maintaining Stream Statistics over Sliding Windows

Piotr Indyk, Rajeev Motwani, Aristides Gionis, 2002, SIAM J. Comput..

Tight lower bounds for the distinct elements problem

David P. Woodruff, Piotr Indyk, P. Indyk, 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

Estimating Entropy of Distributions in Constant Space

Piotr Indyk, Ziteng Sun, Jayadev Acharya, 2019, NeurIPS.

Frequency Estimation with One-Sided Error pdf

David P. Woodruff, Piotr Indyk, Shyam Narayanan, 2021, SODA.

Targeted Supervised Contrastive Learning for Long-Tailed Recognition

Piotr Indyk, Dina Katabi, Peng Cao, 2021 .

Optimal (Euclidean) Metric Compression pdf

Piotr Indyk, Tal Wagner, 2021, ArXiv.

Learning-based Support Estimation in Sublinear Time pdf

Ronitt Rubinfeld, Piotr Indyk, Tal Wagner, 2021, ICLR.

Embeddings and labeling schemes for A

Piotr Indyk, Talya Eden, Haike Xu, 2021, ITCS.

Faster Kernel Matrix Algebra via Density Estimation pdf

Piotr Indyk, Tal Wagner, Cameron Musco, 2021, ICML.

Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering

Piotr Indyk, Sandeep Silwal, Shyam Narayanan, 2021, ICML.

Online Bipartite Matching with Predicted Degrees pdf

Piotr Indyk, Justin Y. Chen, 2021, ArXiv.

Efficient Computations of l 1 and l infinity Rearrangement Distances.

Piotr Indyk, Yonatan Aumann, Ely Porat, 2007 .

New LSH-based Algorithm for Approximate Nearest Neighbor

Alexandr Andoni, Piotr Indyk, P. Indyk, 2005 .

Sparse recovery for Earth Mover Distance

Piotr Indyk, Eric Price, P. Indyk, 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

Nearly optimal deterministic algorithm for sparse walsh-hadamard transform

Piotr Indyk, Mahdi Cheraghchi, 2016, SODA 2016.

Approximate Nearest Neighbor Regression in Very High Dimensions

Trevor Darrell, Piotr Indyk, Gregory Shakhnarovich, 2006 .

The Constrained Earth Mover Distance Model, with Applications to Compressive Sensing

Piotr Indyk, Chinmay Hegde, Ludwig Schmidt, 2013 .

Linear-time Codes to Correct a Maximum Possible Fraction of Errors

Venkatesan Guruswami, Piotr Indyk, 2001 .

A Fast , Adaptive Variant of the Goemans-Williamson Scheme for the Prize-Collecting Steiner Tree Problem

Piotr Indyk, Chinmay Hegde, Ludwig Schmidt, 2015 .

Block Heavy Hitters

Alexandr Andoni, Piotr Indyk, Khanh Do Ba, 2008 .

Greedy strategies for data-adaptive shot selection

Piotr Indyk, Chinmay Hegde, Ludwig Schmidt, 2015 .

8 LOW-DISTORTION EMBEDDINGS OF FINITE METRIC SPACES

Piotr Indyk, Anastasios Sidiropoulos, P. Indyk, 2017 .