Piotr Indyk - RankMe

315 papers A* 140A 9B 9C 1Misc 2Journal 113Unranked 36

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Leveraging contrastive learning for cross-modal(X-modal) person identification. Neural Comput. Appl. Unse Fatima, Zafran Khan, Piotr Indyk, Kin Choong Yow, Moongu Jeon
2025	B	`conf`	Challenges and Opportunities of Graph-Based Algorithms for Similarity Search (Invited Talk). ISAAC Piotr Indyk
2025	A*	`conf`	Contradiction Retrieval via Contrastive Learning with Sparsity. ICML Haike Xu, Zongyu Lin, Kai-Wei Chang, Yizhou Sun, Piotr Indyk
2025	A*	`conf`	Even Faster Algorithm for the Chamfer Distance. ICALP Ying Feng, Piotr Indyk
2025	J	`jnl`	Even Faster Algorithm for the Chamfer Distance. CoRR Ying Feng, Piotr Indyk
2025	A*	`conf`	Graph-Based Algorithms for Diverse Similarity Search. ICML Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy, Sepideh Mahabadi, Vikas C. Raykar, Kirankumar Shiragur, Haike Xu
2025	J	`jnl`	Graph-Based Algorithms for Diverse Similarity Search. CoRR Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy, Sepideh Mahabadi, Vikas C. Raykar, Kirankumar Shiragur, Haike Xu
2025	A*	`conf`	Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions. ICLR Piotr Indyk, Michael Kapralov, Kshiteej Sheth, Tal Wagner
2025	J	`jnl`	Improved Algorithms for Kernel Matrix-Vector Multiplication Under Sparsity Assumptions. CoRR Piotr Indyk, Michael Kapralov, Kshiteej Sheth, Tal Wagner
2025	B	`conf`	Optimal and learned algorithms for the online list update problem with Zipfian accesses. ALT Piotr Indyk, Isabelle Quaye, Ronitt Rubinfeld, Sandeep Silwal
2025	—	`conf`	Towards overcoming the reranking bottleneck. CCCG Piotr Indyk
2024	J	`jnl`	A Bi-metric Framework for Fast Similarity Search. CoRR Haike Xu, Sandeep Silwal, Piotr Indyk
2024	—	`conf`	Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors. SOSA Vaggos Chatziafratis, Piotr Indyk
2024	A*	`conf`	Optimal Algorithms for Augmented Testing of Discrete Distributions. NeurIPS Maryam Aliakbarpour, Piotr Indyk, Ronitt Rubinfeld, Sandeep Silwal
2024	J	`jnl`	Optimal Algorithms for Augmented Testing of Discrete Distributions. CoRR Maryam Aliakbarpour, Piotr Indyk, Ronitt Rubinfeld, Sandeep Silwal
2024	A	`conf`	Space-Optimal Profile Estimation in Data Streams with Applications to Symmetric Functions. ITCS Justin Y. Chen, Piotr Indyk, David P. Woodruff
2024	J	`jnl`	SparseCL: Sparse Contrastive Learning for Contradiction Retrieval. CoRR Haike Xu, Zongyu Lin, Yizhou Sun, Kai-Wei Chang, Piotr Indyk
2024	A*	`conf`	Statistical-Computational Trade-offs for Density Estimation. NeurIPS Anders Aamand, Alexandr Andoni, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal, Haike Xu
2024	J	`jnl`	Statistical-Computational Trade-offs for Density Estimation. CoRR Anders Aamand, Alexandr Andoni, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal, Haike Xu
2023	J	`jnl`	A Near-Linear Time Algorithm for the Chamfer Distance. CoRR Ainesh Bakshi, Piotr Indyk, Rajesh Jayaram, Sandeep Silwal, Erik Waingarten
2023	A	`conf`	Addressing Feature Suppression in Unsupervised Visual Representations. WACV Tianhong Li, Lijie Fan, Yuan Yuan, Hao He, Yonglong Tian, Rogério Feris, Piotr Indyk, Dina Katabi
2023	A*	`conf`	Data Structures for Density Estimation. ICML Anders Aamand, Alexandr Andoni, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal
2023	J	`jnl`	Data Structures for Density Estimation. CoRR Anders Aamand, Alexandr Andoni, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal
2023	A*	`conf`	Differentially Private Approximate Near Neighbor Counting in High Dimensions. NeurIPS Alexandr Andoni, Piotr Indyk, Sepideh Mahabadi, Shyam Narayanan
2023	J	`jnl`	Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors. CoRR Vaggos Chatziafratis, Piotr Indyk
2023	—	`conf`	Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case Guarantees. ACDA Nicholas Schiefer, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal, Tal Wagner
2023	J	`jnl`	Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case Guarantees. CoRR Nicholas Schiefer, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal, Tal Wagner
2023	J	`jnl`	Learning Space Partitions for Nearest Neighbor Search. IEEE Data Eng. Bull. Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
2023	A*	`conf`	Near-Linear Time Algorithm for the Chamfer Distance. NeurIPS Ainesh Bakshi, Piotr Indyk, Rajesh Jayaram, Sandeep Silwal, Erik Waingarten
2023	J	`jnl`	Space-Optimal Profile Estimation in Data Streams with Applications to Symmetric Functions. CoRR Justin Y. Chen, Piotr Indyk, David P. Woodruff
2023	A*	`conf`	Subquadratic Algorithms for Kernel Matrices via Kernel Density Estimation. ICLR Ainesh Bakshi, Piotr Indyk, Praneeth Kacham, Sandeep Silwal, Samson Zhou
2023	A*	`conf`	Worst-case Performance of Popular Approximate Nearest Neighbor Search Implementations: Guarantees and Limitations. NeurIPS Piotr Indyk, Haike Xu
2023	J	`jnl`	Worst-case Performance of Popular Approximate Nearest Neighbor Search Implementations: Guarantees and Limitations. CoRR Piotr Indyk, Haike Xu
2022	A*	`conf`	(Optimal) Online Bipartite Matching with Degree Information. NeurIPS Anders Aamand, Justin Y. Chen, Piotr Indyk
2022	A	`conf`	Embeddings and Labeling Schemes for A. ITCS Talya Eden, Piotr Indyk, Haike Xu
2022	A*	`conf`	Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks. NeurIPS Anders Aamand, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Nicholas Schiefer, Sandeep Silwal, Tal Wagner
2022	J	`jnl`	Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks. CoRR Anders Aamand, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Nicholas Schiefer, Sandeep Silwal, Tal Wagner
2022	A*	`conf`	Faster Linear Algebra for Distance Matrices. NeurIPS Piotr Indyk, Sandeep Silwal
2022	J	`jnl`	Faster Linear Algebra for Distance Matrices. CoRR Piotr Indyk, Sandeep Silwal
2022	A*	`conf`	Frequency Estimation with One-Sided Error. SODA Piotr Indyk, Shyam Narayanan, David P. Woodruff
2022	A*	`conf`	Generalization Bounds for Data-Driven Numerical Linear Algebra. COLT Peter L. Bartlett, Piotr Indyk, Tal Wagner
2022	J	`jnl`	Generalization Bounds for Data-Driven Numerical Linear Algebra. CoRR Peter L. Bartlett, Piotr Indyk, Tal Wagner
2022	A	`conf`	Online Page Migration with ML Advice. AISTATS Piotr Indyk, Frederik Mallmann-Trenn, Slobodan Mitrovic, Ronitt Rubinfeld
2022	J	`jnl`	Optimal (Euclidean) Metric Compression. SIAM J. Comput. Piotr Indyk, Tal Wagner
2022	A*	`conf`	Streaming Algorithms for Support-Aware Histograms. ICML Justin Y. Chen, Piotr Indyk, Tal Wagner
2022	J	`jnl`	Streaming Algorithms for Support-Aware Histograms. CoRR Justin Y. Chen, Piotr Indyk, Tal Wagner
2022	J	`jnl`	Sub-quadratic Algorithms for Kernel Matrices via Kernel Density Estimation. CoRR Ainesh Bakshi, Piotr Indyk, Praneeth Kacham, Sandeep Silwal, Samson Zhou
2022	A*	`conf`	Targeted Supervised Contrastive Learning for Long-Tailed Recognition. CVPR Tianhong Li, Peng Cao, Yuan Yuan, Lijie Fan, Yuzhe Yang, Rogério Feris, Piotr Indyk, Dina Katabi
2022	A*	`conf`	Triangle and Four Cycle Counting with Predictions in Graph Streams. ICLR Justin Y. Chen, Talya Eden, Piotr Indyk, Honghao Lin, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner, David P. Woodruff, Michael Zhang
2022	J	`jnl`	Triangle and Four Cycle Counting with Predictions in Graph Streams. CoRR Justin Y. Chen, Talya Eden, Piotr Indyk, Honghao Lin, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner, David P. Woodruff, Michael Zhang
2021	J	`jnl`	Embeddings and labeling schemes for A. CoRR Talya Eden, Piotr Indyk, Haike Xu
2021	A*	`conf`	Faster Kernel Matrix Algebra via Density Estimation. ICML Arturs Backurs, Piotr Indyk, Cameron Musco, Tal Wagner
2021	J	`jnl`	Faster Kernel Matrix Algebra via Density Estimation. CoRR Arturs Backurs, Piotr Indyk, Cameron Musco, Tal Wagner
2021	A*	`conf`	Few-Shot Data-Driven Algorithms for Low Rank Approximation. NeurIPS Piotr Indyk, Tal Wagner, David P. Woodruff
2021	J	`jnl`	Frequency Estimation with One-Sided Error. CoRR Piotr Indyk, Shyam Narayanan, David P. Woodruff
2021	A*	`conf`	Learning-based Support Estimation in Sublinear Time. ICLR Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner
2021	J	`jnl`	Learning-based Support Estimation in Sublinear Time. CoRR Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner
2021	J	`jnl`	Online Bipartite Matching with Predicted Degrees. CoRR Justin Y. Chen, Piotr Indyk
2021	J	`jnl`	Optimal (Euclidean) Metric Compression. CoRR Piotr Indyk, Tal Wagner
2021	A*	`conf`	Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering. ICML Shyam Narayanan, Sandeep Silwal, Piotr Indyk, Or Zamir
2021	J	`jnl`	Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering. CoRR Shyam Narayanan, Sandeep Silwal, Piotr Indyk, Or Zamir
2021	J	`jnl`	Targeted Supervised Contrastive Learning for Long-Tailed Recognition. CoRR Tianhong Li, Peng Cao, Yuan Yuan, Lijie Fan, Yuzhe Yang, Rogério Feris, Piotr Indyk, Dina Katabi
2020	A*	`conf`	Composable Core-sets for Determinant Maximization Problems via Spectral Spanners. SODA Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei
2020	A*	`conf`	Learning Space Partitions for Nearest Neighbor Search. ICLR Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
2020	J	`jnl`	Online Page Migration with ML Advice. CoRR Piotr Indyk, Frederik Mallmann-Trenn, Slobodan Mitrovic, Ronitt Rubinfeld
2020	A*	`conf`	Scalable Nearest Neighbor Search for Optimal Transport. ICML Arturs Backurs, Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
2019	J	`jnl`	(Learned) Frequency Estimation Algorithms under Zipfian Distribution. CoRR Anders Aamand, Piotr Indyk, Ali Vakilian
2019	J	`jnl`	Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces. SIAM J. Discret. Math. Anastasios Sidiropoulos, Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Piotr Indyk, Yuri Rabinovich, Harald Räcke, R. Ravi
2019	A*	`conf`	Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm. ICML Sepideh Mahabadi, Piotr Indyk, Shayan Oveis Gharan, Alireza Rezaei
2019	J	`jnl`	Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm. CoRR Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei
2019	A*	`conf`	Estimating Entropy of Distributions in Constant Space. NeurIPS Jayadev Acharya, Sourbh Bhadane, Piotr Indyk, Ziteng Sun
2019	J	`jnl`	Estimating Entropy of Distributions in Constant Space. CoRR Jayadev Acharya, Sourbh Bhadane, Piotr Indyk, Ziteng Sun
2019	J	`jnl`	Learning Sublinear-Time Indexing for Nearest Neighbor Search. CoRR Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
2019	—	`conf`	Learning-Based Frequency Estimation Algorithms. ICLR (Poster) Chen-Yu Hsu, Piotr Indyk, Dina Katabi, Ali Vakilian
2019	A*	`conf`	Learning-Based Low-Rank Approximations. NeurIPS Piotr Indyk, Ali Vakilian, Yang Yuan
2019	J	`jnl`	Learning-Based Low-Rank Approximations. CoRR Piotr Indyk, Ali Vakilian, Yang Yuan
2019	A*	`conf`	Sample-Optimal Low-Rank Approximation of Distance Matrices. COLT Piotr Indyk, Ali Vakilian, Tal Wagner, David P. Woodruff
2019	J	`jnl`	Sample-Optimal Low-Rank Approximation of Distance Matrices. CoRR Piotr Indyk, Ali Vakilian, Tal Wagner, David P. Woodruff
2019	A*	`conf`	Scalable Fair Clustering. ICML Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner
2019	J	`jnl`	Scalable Fair Clustering. CoRR Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner
2019	J	`jnl`	Scalable Nearest Neighbor Search for Optimal Transport. CoRR Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
2019	J	`jnl`	Set Cover in Sub-linear Time. CoRR Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee
2019	A*	`conf`	Space and Time Efficient Kernel Density Estimation in High Dimensions. NeurIPS Arturs Backurs, Piotr Indyk, Tal Wagner
2019	A*	`conf`	Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model. PODS Piotr Indyk, Ali Vakilian
2018	J	`jnl`	Approximate Nearest Neighbor Search in High Dimensions. CoRR Alexandr Andoni, Piotr Indyk, Ilya P. Razenshteyn
2018	A*	`conf`	Approximate Nearest Neighbors in Limited Space. COLT Piotr Indyk, Tal Wagner
2018	J	`jnl`	Approximate Nearest Neighbors in Limited Space. CoRR Piotr Indyk, Tal Wagner
2018	A*	`conf`	Approximate Sparse Linear Regression. ICALP Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi
2018	J	`jnl`	Composable Core-sets for Determinant Maximization Problems via Spectral Spanners. CoRR Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei
2018	J	`jnl`	Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False). SIAM J. Comput. Arturs Backurs, Piotr Indyk
2018	A*	`conf`	Efficient Density Evaluation for Smooth Kernels. FOCS Arturs Backurs, Moses Charikar, Piotr Indyk, Paris Siminelakis
2018	A*	`conf`	Fast millimeter wave beam alignment. SIGCOMM Haitham Hassanieh, Omid Abari, Michael Rodriguez, Mohammed A. Abdelghany, Dina Katabi, Piotr Indyk
2018	A*	`conf`	Set Cover in Sub-linear Time. SODA Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee
2017	A*	`ed.`	44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, Warsaw, Poland, July 10-14, 2017 ICALP Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, Anca Muscholl
2017	J	`jnl`	Agile Millimeter Wave Networks with Provable Guarantees. CoRR Haitham Hassanieh, Omid Abari, Michael Rodreguez, Mohammed A. Abdelghany, Dina Katabi, Piotr Indyk
2017	A*	`conf`	Better Approximations for Tree Sparsity in Nearly-Linear Time. SODA Arturs Backurs, Piotr Indyk, Ludwig Schmidt
2017	B	`conf`	Beyond P vs. NP: Quadratic-Time Hardness for Big Data Problems. SPAA Piotr Indyk
2017	—	`conf`	Fractional Set Cover in the Streaming Model. APPROX-RANDOM Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan R. Ullman, Ali Vakilian, Anak Yodpinyanee
2017	A*	`conf`	Near-Optimal (Euclidean) Metric Compression. SODA Piotr Indyk, Tal Wagner
2017	J	`jnl`	Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. ACM Trans. Algorithms Mahdi Cheraghchi, Piotr Indyk
2017	—	`conf`	On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks. NIPS Arturs Backurs, Piotr Indyk, Ludwig Schmidt
2017	J	`jnl`	On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks. CoRR Arturs Backurs, Piotr Indyk, Ludwig Schmidt
2017	—	`conf`	Practical Data-Dependent Metric Compression with Provable Guarantees. NIPS Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
2017	J	`jnl`	Practical Data-Dependent Metric Compression with Provable Guarantees. CoRR Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
2016	A*	`conf`	A Nearly-Linear Time Framework for Graph-Structured Sparsity. IJCAI Chinmay Hegde, Piotr Indyk, Ludwig Schmidt
2016	J	`jnl`	Approximate Sparse Linear Regression. CoRR Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi
2016	—	`conf`	Fast recovery from a union of subspaces. NIPS Chinmay Hegde, Piotr Indyk, Ludwig Schmidt
2016	J	`jnl`	ICALP 2017 - Call for Papers. Bull. EATCS Piotr Indyk, Anca Muscholl, Fabian Kuhn
2016	J	`jnl`	Near-Optimal (Euclidean) Metric Compression. CoRR Piotr Indyk, Tal Wagner
2016	A*	`conf`	Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. SODA Mahdi Cheraghchi, Piotr Indyk
2016	A*	`conf`	Nearly-optimal bounds for sparse recovery in generic norms, with applications to SODA Arturs Backurs, Piotr Indyk, Ilya P. Razenshteyn, David P. Woodruff
2016	A*	`conf`	Simultaneous Nearest Neighbor Search. SoCG Piotr Indyk, Robert D. Kleinberg, Sepideh Mahabadi, Yang Yuan
2016	J	`jnl`	Simultaneous Nearest Neighbor Search. CoRR Piotr Indyk, Robert D. Kleinberg, Sepideh Mahabadi, Yang Yuan
2016	—	`ch.`	Stable Distributions in Streaming Computations. Data Stream Management Graham Cormode, Piotr Indyk
2016	A*	`conf`	Towards Tight Bounds for the Streaming Set Cover Problem. PODS Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
2016	A*	`conf`	Which Regular Expression Patterns Are Hard to Match? FOCS Arturs Backurs, Piotr Indyk
2015	A*	`conf`	A Nearly-Linear Time Framework for Graph-Structured Sparsity. ICML Chinmay Hegde, Piotr Indyk, Ludwig Schmidt
2015	J	`jnl`	Approximation Algorithms for Model-Based Compressive Sensing. IEEE Trans. Inf. Theory Chinmay Hegde, Piotr Indyk, Ludwig Schmidt
2015	A*	`conf`	Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false). STOC Arturs Backurs, Piotr Indyk
2015	A*	`conf`	Erratum for: Approximating and Testing PODS Piotr Indyk, Reut Levi, Ronitt Rubinfeld
2015	J	`jnl`	Fast Algorithms for Structured Sparsity. Bull. EATCS Chinmay Hegde, Piotr Indyk, Ludwig Schmidt
2015	J	`jnl`	Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. CoRR Mahdi Cheraghchi, Piotr Indyk
2015	J	`jnl`	Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. Electron. Colloquium Comput. Complex. Mahdi Cheraghchi, Piotr Indyk
2015	J	`jnl`	Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching. CoRR Arturs Backurs, Piotr Indyk, Eric Price, Ilya P. Razenshteyn, David P. Woodruff
2015	—	`conf`	Practical and Optimal LSH for Angular Distance. NIPS Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, Ludwig Schmidt
2015	J	`jnl`	Practical and Optimal LSH for Angular Distance. CoRR Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, Ludwig Schmidt
2015	A*	`ed.`	Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015 SODA Piotr Indyk
2015	J	`jnl`	Rapid Sampling for Visualizations with Ordering Guarantees. Proc. VLDB Endow. Albert Kim, Eric Blais, Aditya G. Parameswaran, Piotr Indyk, Samuel Madden, Ronitt Rubinfeld
2015	Misc	`conf`	Seismic feature extraction using steiner tree methods. ICASSP Ludwig Schmidt, Chinmay Hegde, Piotr Indyk, Ligang Lu, Xingang Chi, Detlef Hohl
2015	J	`jnl`	Towards Tight Bounds for the Streaming Set Cover Problem. CoRR Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
2015	J	`jnl`	Which Regular Expression Patterns are Hard to Match? CoRR Arturs Backurs, Piotr Indyk
2014	A*	`conf`	(Nearly) Sample-Optimal Sparse Fourier Transform. SODA Piotr Indyk, Michael Kapralov, Eric Price
2014	B	`conf`	A fast approximation algorithm for tree-sparse recovery. ISIT Chinmay Hegde, Piotr Indyk, Ludwig Schmidt
2014	J	`jnl`	Approximation Algorithms for Model-Based Compressive Sensing. CoRR Chinmay Hegde, Piotr Indyk, Ludwig Schmidt
2014	A*	`conf`	Approximation-Tolerant Model-Based Compressive Sensing. SODA Chinmay Hegde, Piotr Indyk, Ludwig Schmidt
2014	Misc	`conf`	Automatic fault localization using the generalized Earth Mover's distance. ICASSP Ludwig Schmidt, Chinmay Hegde, Piotr Indyk, Jonathan Kane, Ligang Lu, Detlef Hohl
2014	A*	`conf`	Better embeddings for planar Earth-Mover Distance over sparse sets. SoCG Arturs Backurs, Piotr Indyk
2014	A*	`conf`	Beyond Locality-Sensitive Hashing. SODA Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, Ilya P. Razenshteyn
2014	A*	`conf`	Composable core-sets for diversity and coverage maximization. PODS Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, Vahab S. Mirrokni
2014	J	`jnl`	Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false). CoRR Arturs Backurs, Piotr Indyk
2014	—	`conf`	Nearly Linear-Time Model-Based Compressive Sensing. ICALP (1) Chinmay Hegde, Piotr Indyk, Ludwig Schmidt
2014	A	`conf`	On Streaming and Communication Complexity of the Set Cover Problem. DISC Erik D. Demaine, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
2014	J	`jnl`	Rapid Sampling for Visualizations with Ordering Guarantees. CoRR Albert Kim, Eric Blais, Aditya G. Parameswaran, Piotr Indyk, Sam Madden, Ronitt Rubinfeld
2014	J	`jnl`	Recent Developments in the Sparse Fourier Transform: A compressed Fourier transform for big data. IEEE Signal Process. Mag. Anna C. Gilbert, Piotr Indyk, Mark A. Iwen, Ludwig Schmidt
2014	J	`jnl`	Sample-Optimal Fourier Sampling in Any Constant Dimension - Part I. CoRR Piotr Indyk, Michael Kapralov
2014	A*	`conf`	Sample-Optimal Fourier Sampling in Any Constant Dimension. FOCS Piotr Indyk, Michael Kapralov
2013	J	`jnl`	Beyond Locality-Sensitive Hashing. CoRR Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, Ilya P. Razenshteyn
2013	A*	`conf`	Compressive sensing using locality-preserving matrices. SoCG Elyot Grant, Piotr Indyk
2013	A*	`conf`	Diverse near neighbor problem. SoCG Sofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi, Kasturi R. Varadarajan
2013	A*	`conf`	Euclidean spanners in high dimensions. SODA Sariel Har-Peled, Piotr Indyk, Anastasios Sidiropoulos
2013	—	`conf`	Nearly optimal linear embeddings into very low dimensions. GlobalSIP Elyot Grant, Chinmay Hegde, Piotr Indyk
2013	J	`jnl`	On Model-Based RIP-1 Matrices CoRR Piotr Indyk, Ilya P. Razenshteyn
2013	—	`conf`	On Model-Based RIP-1 Matrices. ICALP (1) Piotr Indyk, Ilya P. Razenshteyn
2013	A*	`conf`	Real-time recommendation of diverse related articles. WWW Sofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi
2013	J	`jnl`	Sample-Optimal Average-Case Sparse Fourier Transform in Two Dimensions CoRR Badih Ghazi, Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price, Lixin Shi
2013	—	`conf`	Sample-optimal average-case sparse Fourier Transform in two dimensions. Allerton Badih Ghazi, Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price, Lixin Shi
2013	A*	`conf`	Shift Finding in Sub-Linear Time. SODA Alexandr Andoni, Piotr Indyk, Dina Katabi, Haitham Hassanieh
2013	A*	`conf`	Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform. PODS Piotr Indyk
2013	J	`jnl`	Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing. Proc. VLDB Endow. Narayanan Sundaram, Aizana Turmukhametova, Nadathur Satish, Todd Mostak, Piotr Indyk, Samuel Madden, Pradeep Dubey
2012	J	`jnl`	Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality. Theory Comput. Sariel Har-Peled, Piotr Indyk, Rajeev Motwani
2012	A*	`conf`	Approximating and testing k-histogram distributions in sub-linear time. PODS Piotr Indyk, Reut Levi, Ronitt Rubinfeld
2012	J	`jnl`	Compressive Sensing with Local Geometric Features CoRR Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachlin
2012	J	`jnl`	Compressive Sensing with Local Geometric Features. Int. J. Comput. Geom. Appl. Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachlin
2012	A*	`conf`	Efficient and reliable low-power backscatter networks. SIGCOMM Jue Wang, Haitham Hassanieh, Dina Katabi, Piotr Indyk
2012	A*	`conf`	Faster GPS via the sparse fourier transform. MobiCom Haitham Hassanieh, Fadel Adib, Dina Katabi, Piotr Indyk
2012	—	`conf`	Focal plane array folding for efficient information extraction and tracking. AIPR Lei Hamilton, Dan Parker, Chris Yu, Piotr Indyk
2012	J	`jnl`	Nearly Optimal Sparse Fourier Transform CoRR Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price
2012	A*	`conf`	Nearly optimal sparse fourier transform. STOC Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price
2012	A*	`conf`	Simple and practical algorithm for sparse Fourier transform. SODA Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price
2011	J	`jnl`	Approximating and Testing Electron. Colloquium Comput. Complex. Piotr Indyk, Reut Levi, Ronitt Rubinfeld
2011	—	`conf`	Compressive sensing with local geometric features. SCG Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachlin
2011	J	`jnl`	K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance CoRR Piotr Indyk, Eric Price
2011	A*	`conf`	K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance. STOC Piotr Indyk, Eric Price
2011	J	`jnl`	Lower Bounds for Sparse Recovery CoRR Khanh Do Ba, Piotr Indyk, Eric Price, David P. Woodruff
2011	J	`jnl`	On the Power of Adaptivity in Sparse Recovery CoRR Piotr Indyk, Eric Price, David P. Woodruff
2011	A*	`conf`	On the Power of Adaptivity in Sparse Recovery. FOCS Piotr Indyk, Eric Price, David P. Woodruff
2011	—	`conf`	Sparse Recovery with Partial Support Knowledge. APPROX-RANDOM Khanh Do Ba, Piotr Indyk
2011	A	`conf`	The Complexity of Linear Dependence Problems in Vector Spaces. ICS Arnab Bhattacharyya, Piotr Indyk, David P. Woodruff, Ning Xie
2010	J	`jnl`	A simple construction of almost-Euclidean subspaces of ℓ CoRR Piotr Indyk, Stanislaw J. Szarek
2010	—	`conf`	Almost-Euclidean Subspaces of APPROX-RANDOM Piotr Indyk, Stanislaw J. Szarek
2010	A*	`conf`	Efficiently Decodable Non-adaptive Group Testing. SODA Piotr Indyk, Hung Q. Ngo, Atri Rudra
2010	A*	`conf`	Lower Bounds for Sparse Recovery. SODA Khanh Do Ba, Piotr Indyk, Eric Price, David P. Woodruff
2010	J	`jnl`	Motif discovery in physiological datasets: A methodology for inferring predictive elements. ACM Trans. Knowl. Discov. Data Zeeshan Syed, Collin M. Stultz, Manolis Kellis, Piotr Indyk, John V. Guttag
2010	—	`conf`	Online Embeddings. APPROX-RANDOM Piotr Indyk, Avner Magen, Anastasios Sidiropoulos, Anastasios Zouzias
2010	J	`jnl`	Space-optimal heavy hitters with strong error bounds. ACM Trans. Database Syst. Radu Berinde, Piotr Indyk, Graham Cormode, Martin J. Strauss
2010	J	`jnl`	Sparse Recovery Using Sparse Matrices. Proc. IEEE Anna C. Gilbert, Piotr Indyk
2010	B	`conf`	Sparse Recovery Using Sparse Random Matrices. LATIN Piotr Indyk
2010	J	`jnl`	Sparse Signal Recovery and Acquisition with Graphical Models. IEEE Signal Process. Mag. Volkan Cevher, Piotr Indyk, Lawrence Carin, Richard G. Baraniuk
2010	—	`conf`	Sparse recovery for Earth Mover Distance. Allerton Rishi Gupta, Piotr Indyk, Eric Price
2010	—	`ch.`	Sublinear Algorithms in the External Memory Model. Property Testing Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld
2009	A*	`conf`	Approximate line nearest neighbor in high dimensions. SODA Alexandr Andoni, Piotr Indyk, Robert Krauthgamer, Huy L. Nguyen
2009	A*	`conf`	Efficient Sketches for Earth-Mover Distance, with Applications. FOCS Alexandr Andoni, Khanh Do Ba, Piotr Indyk, David P. Woodruff
2009	J	`jnl`	Efficient computations of Theor. Comput. Sci. Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat
2009	—	`conf`	External Sampling. ICALP (1) Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld
2009	J	`jnl`	Learning Approximate Sequential Patterns for Classification. J. Mach. Learn. Res. Zeeshan Syed, Piotr Indyk, John V. Guttag
2009	A*	`conf`	Overcoming the SODA Alexandr Andoni, Piotr Indyk, Robert Krauthgamer
2009	—	`conf`	Sequential Sparse Matching Pursuit. Allerton Radu Berinde, Piotr Indyk
2009	A*	`conf`	Space-optimal heavy hitters with strong error bounds. PODS Radu Berinde, Graham Cormode, Piotr Indyk, Martin J. Strauss
2008	J	`jnl`	Combining geometry and combinatorics: A unified approach to sparse signal recovery CoRR Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss
2008	—	`conf`	Combining geometry and combinatorics: A unified approach to sparse signal recovery. Allerton Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss
2008	A*	`conf`	Declaring independence via the sketching of sketches. SODA Piotr Indyk, Andrew McGregor
2008	A*	`conf`	Earth mover distance over high-dimensional spaces. SODA Alexandr Andoni, Piotr Indyk, Robert Krauthgamer
2008	A*	`conf`	Explicit constructions for compressed sensing of sparse signals. SODA Piotr Indyk
2008	A*	`conf`	Near-Optimal Sparse Recovery in the L1 Norm. FOCS Piotr Indyk, Milan Ruzic
2008	J	`jnl`	Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM Alexandr Andoni, Piotr Indyk
2008	J	`jnl`	Nearest-Neighbor Methods in Learning and Vision. IEEE Trans. Neural Networks Gregory Shakhnarovich, Trevor Darrell, Piotr Indyk
2008	—	`conf`	Practical near-optimal sparse recovery in the L1 norm. Allerton Radu Berinde, Piotr Indyk, Milan Ruzic
2008	J	`jnl`	Sampling in Dynamic Data Streams and Applications. Int. J. Comput. Geom. Appl. Gereon Frahling, Piotr Indyk, Christian Sohler
2008	J	`jnl`	Sketching information divergences. Mach. Learn. Sudipto Guha, Piotr Indyk, Andrew McGregor
2007	A*	`conf`	A near linear time constant factor approximation for Euclidean bichromatic matching (cost). SODA Piotr Indyk
2007	A*	`conf`	Approximation algorithms for embedding general metrics into trees. SODA Mihai Badoiu, Piotr Indyk, Anastasios Sidiropoulos
2007	J	`jnl`	Earth Mover Distance over High-Dimensional Spaces. Electron. Colloquium Comput. Complex. Alexandr Andoni, Piotr Indyk, Robert Krauthgamer
2007	C	`conf`	Efficient Computations of SPIRE Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat
2007	J	`jnl`	Nearest-neighbor-preserving embeddings. ACM Trans. Algorithms Piotr Indyk, Assaf Naor
2007	—	`conf`	Probabilistic embeddings of bounded genus graphs into planar graphs. SCG Piotr Indyk, Anastasios Sidiropoulos
2007	A*	`conf`	Sketching Information Divergences. COLT Sudipto Guha, Piotr Indyk, Andrew McGregor
2007	A*	`conf`	Uncertainty principles, extractors, and explicit embeddings of l2 into l1. STOC Piotr Indyk
2006	A*	`conf`	Efficient algorithms for substring near neighbor problem. SODA Alexandr Andoni, Piotr Indyk
2006	—	`conf`	Embedding ultrametrics into low-dimensional spaces. SCG Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos
2006	J	`jnl`	Low-Dimensional Embedding with Extra Information. Discret. Comput. Geom. Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk
2006	A*	`conf`	Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. FOCS Alexandr Andoni, Piotr Indyk
2006	A*	`conf`	On the Optimality of the Dimensionality Reduction Method. FOCS Alexandr Andoni, Piotr Indyk, Mihai Patrascu
2006	B	`conf`	Polylogarithmic Private Approximations and Efficient Matching. TCC Piotr Indyk, David P. Woodruff
2006	J	`jnl`	Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM Piotr Indyk
2006	J	`jnl`	Uncertainty Principles, Extractors, and Explicit Embeddings of L2 into L1. Electron. Colloquium Comput. Complex. Piotr Indyk
2005	A*	`conf`	Facility Location in Sublinear Time. ICALP Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler
2005	J	`jnl`	Linear-time encodable/decodable codes with near-optimal rate. IEEE Trans. Inf. Theory Venkatesan Guruswami, Piotr Indyk
2005	A*	`conf`	Low-distortion embeddings of general metrics into the line. STOC Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos
2005	A*	`conf`	Optimal approximations of the frequency moments of data streams. STOC Piotr Indyk, David P. Woodruff
2005	J	`jnl`	Polylogarithmic Private Approximations and Efficient Matching Electron. Colloquium Comput. Complex. Piotr Indyk, David P. Woodruff
2005	—	`conf`	Sampling in dynamic data streams and applications. SCG Gereon Frahling, Piotr Indyk, Christian Sohler
2004	A*	`conf`	Algorithms for dynamic geometric problems over data streams. STOC Piotr Indyk
2004	A*	`conf`	Approximate Nearest Neighbor under edit distance via product metrics. SODA Piotr Indyk
2004	A*	`conf`	Closest Pair Problems in Very High Dimensions. ICALP Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat
2004	J	`jnl`	Combinatorial and Experimental Methods for Approximate Point Pattern Matching. Algorithmica Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian
2004	A*	`conf`	Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates. SODA Venkatesan Guruswami, Piotr Indyk
2004	A*	`conf`	Fast approximate pattern matching with few indels via embeddings. SODA Mihai Badoiu, Piotr Indyk
2004	A*	`conf`	Linear-Time List Decoding in Error-Free Settings: (Extended Abstract). ICALP Venkatesan Guruswami, Piotr Indyk
2004	—	`conf`	Locality-sensitive hashing scheme based on p-stable distributions. SCG Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni
2004	—	`ch.`	Low-Distortion Embeddings of Finite Metric Spaces. Handbook of Discrete and Computational Geometry, 2nd Ed. Piotr Indyk, Jirí Matousek
2004	—	`conf`	Low-dimensional embedding with extra information. SCG Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk
2004	—	`ch.`	Nearest Neighbors in High-Dimensional Spaces. Handbook of Discrete and Computational Geometry, 2nd Ed. Piotr Indyk
2004	J	`jnl`	Pattern Matching for Sets of Segments. Algorithmica Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
2004	—	`conf`	Streaming Algorithms for Geometric Problems. FSTTCS Piotr Indyk
2003	J	`jnl`	Approximate congruence in nearly linear time. Comput. Geom. Piotr Indyk, Suresh Venkatasubramanian
2003	A*	`conf`	Better algorithms for high-dimensional proximity problems via asymmetric embeddings. SODA Piotr Indyk
2003	J	`jnl`	Comparing Data Streams Using Hamming Norms (How to Zero In). IEEE Trans. Knowl. Data Eng. Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan
2003	A*	`conf`	Embeddings and non-approximability of geometric problems. SODA Venkatesan Guruswami, Piotr Indyk
2003	A*	`conf`	Linear time encodable and list decodable codes. STOC Venkatesan Guruswami, Piotr Indyk
2003	A*	`conf`	Lower bounds for embedding edit distance into normed spaces. SODA Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova
2003	J	`jnl`	Probabilistic Analysis for Discrete Attributes of Moving Points. Int. J. Comput. Geom. Appl. Julien Basch, Harish Devarajan, Piotr Indyk, Li Zhang
2003	A*	`conf`	Tight Lower Bounds for the Distinct Elements Problem. FOCS Piotr Indyk, David P. Woodruff
2003	J	`jnl`	When Crossings Count - Approximating the Minimum Spanning Tree CoRR Sariel Har-Peled, Piotr Indyk
2002	A*	`conf`	Approximate clustering via core-sets. STOC Mihai Badoiu, Sariel Har-Peled, Piotr Indyk
2002	—	`conf`	Approximate nearest neighbor algorithms for Frechet distance via product metrics. SCG Piotr Indyk
2002	A*	`conf`	Comparing Data Streams Using Hamming Norms (How to Zero In). VLDB Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan
2002	A*	`conf`	Derandomized dimensionality reduction with applications. SODA Lars Engebretsen, Piotr Indyk, Ryan O'Donnell
2002	—	`conf`	Dynamic multidimensional histograms. SIGMOD Conference Nitin Thaper, Sudipto Guha, Piotr Indyk, Nick Koudas
2002	A*	`conf`	Evaluating strategies for similarity search on the web. WWW Taher H. Haveliwala, Aristides Gionis, Dan Klein, Piotr Indyk
2002	A*	`conf`	Explicit constructions of selectors and related combinatorial structures, with applications. SODA Piotr Indyk
2002	A*	`conf`	Fast Mining of Massive Tabular Data via Approximate Distance Computations. ICDE Graham Cormode, Piotr Indyk, Nick Koudas, S. Muthukrishnan
2002	A*	`conf`	Fast, small-space algorithms for approximate histogram maintenance. STOC Anna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis Kotidis, S. Muthukrishnan, Martin Strauss
2002	A*	`conf`	Histogramming Data Streams with Fast Per-Item Processing. ICALP Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss
2002	J	`jnl`	List-decoding in Linear Time Electron. Colloquium Comput. Complex. Piotr Indyk
2002	J	`jnl`	Maintaining Stream Statistics over Sliding Windows. SIAM J. Comput. Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani
2002	A*	`conf`	Maintaining stream statistics over sliding windows (extended abstract). SODA Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani
2002	A*	`conf`	Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets. STOC Venkatesan Guruswami, Piotr Indyk
2002	A*	`conf`	Near-optimal sparse fourier representations via sampling. STOC Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss
2002	A*	`conf`	New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. ICALP Moses Charikar, Piotr Indyk, Rina Panigrahy
2001	J	`jnl`	A Small Approximately Min-Wise Independent Family of Hash Functions. J. Algorithms Piotr Indyk
2001	A*	`conf`	Algorithmic Applications of Low-Distortion Geometric Embeddings. FOCS Piotr Indyk
2001	J	`jnl`	Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems. Algorithmica Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet
2001	A*	`conf`	Expander-Based Constructions of Efficiently Decodable Codes. FOCS Venkatesan Guruswami, Piotr Indyk
2001	J	`jnl`	Finding Interesting Associations without Support Pruning. IEEE Trans. Knowl. Data Eng. Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang
2001	J	`jnl`	On Approximate Nearest Neighbors under l J. Comput. Syst. Sci. Piotr Indyk
2001	J	`jnl`	On page migration and other relaxed task systems. Theor. Comput. Sci. Yair Bartal, Moses Charikar, Piotr Indyk
2001	A*	`conf`	Pattern matching for sets of segments. SODA Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
2001	A*	`conf`	Reductions among high dimensional proximity problems. SODA Ashish Goel, Piotr Indyk, Kasturi R. Varadarajan
2000	A*	`conf`	Approximate congruence in nearly linear time. SODA Piotr Indyk, Suresh Venkatasubramanian
2000	A*	`conf`	Dimensionality reduction techniques for proximity problems. SODA Piotr Indyk
2000	A*	`conf`	Finding Interesting Associations without Support Pruning. ICDE Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang
2000	—	`—`	High-dimensional computational geometry. Piotr Indyk
2000	A*	`conf`	Identifying Representative Trends in Massive Time Series Data Sets Using Sketches. VLDB Piotr Indyk, Nick Koudas, S. Muthukrishnan
2000	A*	`conf`	Mining the stock market (extended abstract): which measure is best? KDD Martin Gavrilov, Dragomir Anguelov, Piotr Indyk, Rajeev Motwani
2000	J	`jnl`	Pattern Matching for sets of segments CoRR Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
2000	—	`conf`	Scalable Techniques for Clustering the Web. WebDB (Informal Proceedings) Taher H. Haveliwala, Aristides Gionis, Piotr Indyk
2000	A*	`conf`	Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation. FOCS Piotr Indyk
2000	—	`conf`	When crossings count - approximating the minimum spanning tree. SCG Sariel Har-Peled, Piotr Indyk
1999	A*	`conf`	A Small Approximately min-wise Independent Family of Hash Functions. SODA Piotr Indyk
1999	A*	`conf`	A Sublinear Time Approximation Scheme for Clustering in Metric Spaces. FOCS Piotr Indyk
1999	A*	`conf`	Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings. FOCS Martin Farach-Colton, Piotr Indyk
1999	A*	`conf`	Efficient Regular Data Structures and Algorithms for Location and Proximity Problems. FOCS Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet
1999	J	`jnl`	Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication). SIAM J. Comput. Donald Aingworth, Chandra Chekuri, Piotr Indyk, Rajeev Motwani
1999	A*	`conf`	Geometric Matching Under Noise: Combinatorial Bounds and Algorithms. SODA Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian
1999	—	`conf`	Geometric Pattern Matching: A Performance Study. SCG Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian
1999	A*	`conf`	Inerpolation of Symmetric Functions and a New Type of Combinatorial Design. STOC Piotr Indyk
1999	A*	`conf`	Similarity Search in High Dimensions via Hashing. VLDB Aristides Gionis, Piotr Indyk, Rajeev Motwani
1999	A*	`conf`	Stochastic Load Balancing and Related Problems. FOCS Ashish Goel, Piotr Indyk
1999	A*	`conf`	Sublinear Time Algorithms for Metric Space Problems. STOC Piotr Indyk
1999	A*	`conf`	Tree Pattern Matching and Subset Matching in Deterministic SODA Richard Cole, Ramesh Hariharan, Piotr Indyk
1998	A*	`conf`	Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. STOC Piotr Indyk, Rajeev Motwani
1998	—	`conf`	Enhanced Hypertext Categorization Using Hyperlinks. SIGMOD Conference Soumen Chakrabarti, Byron Dom, Piotr Indyk
1998	A*	`conf`	Faster Algorithms for String Matching Problems: Matching the Convolution Bound. FOCS Piotr Indyk
1998	A*	`conf`	On Approximate Nearest Neighbors in Non-Euclidean Spaces. FOCS Piotr Indyk
1997	A*	`conf`	Deterministic Superimposed Coding with Applications to Pattern Matching. FOCS Piotr Indyk
1997	B	`conf`	Efficient Parallel Computing with Memory Faults. FCT Leszek Gasieniec, Piotr Indyk
1997	B	`conf`	External Inverse Pattern Matching. CPM Leszek Gasieniec, Piotr Indyk, Piotr Krysta
1997	A*	`conf`	Locality-Preserving Hashing in Multidimensional Spaces. STOC Piotr Indyk, Rajeev Motwani, Prabhakar Raghavan, Santosh S. Vempala
1997	B	`conf`	On Learning Disjunctions of Zero-One Treshold Functions with Queries. ALT Tibor Hegedüs, Piotr Indyk
1997	A*	`conf`	On Page Migration and Other Relaxed Task Systems. SODA Yair Bartal, Moses Charikar, Piotr Indyk
1997	—	`conf`	Probabilistic Analysis for Combinatorial Functions of Moving Points. SCG Li Zhang, Harish Devarajan, Julien Basch, Piotr Indyk
1996	A	`conf`	On Word-Level Parallelism in Fault-Tolerant Computing. STACS Piotr Indyk
1996	A*	`conf`	Shared-Memory Simulations on a Faulty-Memory DMM. ICALP Bogdan S. Chlebus, Anna Gambin, Piotr Indyk
1995	A	`conf`	Optimal Simulation of Automata by Neural Nets. STACS Piotr Indyk
1994	A	`conf`	PRAM Computations Resilient to Memory Faults. ESA Bogdan S. Chlebus, Anna Gambin, Piotr Indyk