default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPiotr Indyk
Person information
- affiliation: Massachusetts Institute of Technology, Cambridge, MA, USA
- award (2012): Paris Kanellakis Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c186]Justin Y. Chen, Piotr Indyk, David P. Woodruff:
Space-Optimal Profile Estimation in Data Streams with Applications to Symmetric Functions. ITCS 2024: 32:1-32:22- [c185]Vaggos Chatziafratis, Piotr Indyk:
Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors. SOSA 2024: 230-243 - [i69]Haike Xu, Sandeep Silwal, Piotr Indyk:
A Bi-metric Framework for Fast Similarity Search. CoRR abs/2406.02891 (2024) - [i68]Haike Xu, Zongyu Lin, Yizhou Sun, Kai-Wei Chang, Piotr Indyk:
SparseCL: Sparse Contrastive Learning for Contradiction Retrieval. CoRR abs/2406.10746 (2024) - [i67]Anders Aamand, Alexandr Andoni, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal, Haike Xu:
Statistical-Computational Trade-offs for Density Estimation. CoRR abs/2410.23087 (2024) - 2023
- [j39]Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Learning Space Partitions for Nearest Neighbor Search. IEEE Data Eng. Bull. 46(3): 55-68 (2023) - [c184]Nicholas Schiefer, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal, Tal Wagner:
Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case Guarantees. ACDA 2023: 87-97 - [c183]Ainesh Bakshi, Piotr Indyk, Praneeth Kacham, Sandeep Silwal, Samson Zhou:
Subquadratic Algorithms for Kernel Matrices via Kernel Density Estimation. ICLR 2023 - [c182]Anders Aamand, Alexandr Andoni, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal:
Data Structures for Density Estimation. ICML 2023: 1-18 - [c181]Alexandr Andoni, Piotr Indyk, Sepideh Mahabadi, Shyam Narayanan:
Differentially Private Approximate Near Neighbor Counting in High Dimensions. NeurIPS 2023 - [c180]Ainesh Bakshi, Piotr Indyk, Rajesh Jayaram, Sandeep Silwal, Erik Waingarten:
Near-Linear Time Algorithm for the Chamfer Distance. NeurIPS 2023 - [c179]Piotr Indyk, Haike Xu:
Worst-case Performance of Popular Approximate Nearest Neighbor Search Implementations: Guarantees and Limitations. NeurIPS 2023 - [c178]Tianhong Li, Lijie Fan, Yuan Yuan, Hao He, Yonglong Tian, Rogério Feris, Piotr Indyk, Dina Katabi:
Addressing Feature Suppression in Unsupervised Visual Representations. WACV 2023: 1411-1420 - [i66]Nicholas Schiefer, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal, Tal Wagner:
Learned Interpolation for Better Streaming Quantile Approximation with Worst-Case Guarantees. CoRR abs/2304.07652 (2023) - [i65]Anders Aamand, Alexandr Andoni, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal:
Data Structures for Density Estimation. CoRR abs/2306.11312 (2023) - [i64]Ainesh Bakshi, Piotr Indyk, Rajesh Jayaram, Sandeep Silwal, Erik Waingarten:
A Near-Linear Time Algorithm for the Chamfer Distance. CoRR abs/2307.03043 (2023) - [i63]Piotr Indyk, Haike Xu:
Worst-case Performance of Popular Approximate Nearest Neighbor Search Implementations: Guarantees and Limitations. CoRR abs/2310.19126 (2023) - [i62]Justin Y. Chen, Piotr Indyk, David P. Woodruff:
Space-Optimal Profile Estimation in Data Streams with Applications to Symmetric Functions. CoRR abs/2311.17868 (2023) - [i61]Vaggos Chatziafratis, Piotr Indyk:
Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors. CoRR abs/2312.13490 (2023) - 2022
- [j38]Piotr Indyk, Tal Wagner:
Optimal (Euclidean) Metric Compression. SIAM J. Comput. 51(3): 467-491 (2022) - [c177]Piotr Indyk, Frederik Mallmann-Trenn, Slobodan Mitrovic, Ronitt Rubinfeld:
Online Page Migration with ML Advice. AISTATS 2022: 1655-1670 - [c176]Peter L. Bartlett, Piotr Indyk, Tal Wagner:
Generalization Bounds for Data-Driven Numerical Linear Algebra. COLT 2022: 2013-2040 - [c175]Tianhong Li, Peng Cao, Yuan Yuan, Lijie Fan, Yuzhe Yang
, Rogério Feris, Piotr Indyk, Dina Katabi:
Targeted Supervised Contrastive Learning for Long-Tailed Recognition. CVPR 2022: 6908-6918 - [c174]Justin Y. Chen, Talya Eden, Piotr Indyk, Honghao Lin, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner, David P. Woodruff, Michael Zhang:
Triangle and Four Cycle Counting with Predictions in Graph Streams. ICLR 2022 - [c173]Justin Y. Chen, Piotr Indyk, Tal Wagner:
Streaming Algorithms for Support-Aware Histograms. ICML 2022: 3184-3203 - [c172]Talya Eden, Piotr Indyk, Haike Xu:
Embeddings and Labeling Schemes for A. ITCS 2022: 62:1-62:19 - [c171]Anders Aamand, Justin Y. Chen, Piotr Indyk:
(Optimal) Online Bipartite Matching with Degree Information. NeurIPS 2022 - [c170]Anders Aamand, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Nicholas Schiefer, Sandeep Silwal, Tal Wagner:
Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks. NeurIPS 2022 - [c169]Piotr Indyk, Sandeep Silwal:
Faster Linear Algebra for Distance Matrices. NeurIPS 2022 - [c168]Piotr Indyk, Shyam Narayanan, David P. Woodruff:
Frequency Estimation with One-Sided Error. SODA 2022: 695-707 - [i60]Justin Y. Chen, Talya Eden, Piotr Indyk, Honghao Lin, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner, David P. Woodruff, Michael Zhang:
Triangle and Four Cycle Counting with Predictions in Graph Streams. CoRR abs/2203.09572 (2022) - [i59]Peter L. Bartlett, Piotr Indyk, Tal Wagner:
Generalization Bounds for Data-Driven Numerical Linear Algebra. CoRR abs/2206.07886 (2022) - [i58]Justin Y. Chen, Piotr Indyk, Tal Wagner:
Streaming Algorithms for Support-Aware Histograms. CoRR abs/2207.08686 (2022) - [i57]Piotr Indyk, Sandeep Silwal:
Faster Linear Algebra for Distance Matrices. CoRR abs/2210.15114 (2022) - [i56]Anders Aamand, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Nicholas Schiefer, Sandeep Silwal, Tal Wagner:
Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks. CoRR abs/2211.03232 (2022) - [i55]Ainesh Bakshi, Piotr Indyk, Praneeth Kacham, Sandeep Silwal, Samson Zhou:
Sub-quadratic Algorithms for Kernel Matrices via Kernel Density Estimation. CoRR abs/2212.00642 (2022) - 2021
- [c167]Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner:
Learning-based Support Estimation in Sublinear Time. ICLR 2021 - [c166]Arturs Backurs, Piotr Indyk, Cameron Musco, Tal Wagner:
Faster Kernel Matrix Algebra via Density Estimation. ICML 2021: 500-510 - [c165]Shyam Narayanan, Sandeep Silwal, Piotr Indyk, Or Zamir:
Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering. ICML 2021: 7948-7957 - [c164]Piotr Indyk, Tal Wagner, David P. Woodruff:
Few-Shot Data-Driven Algorithms for Low Rank Approximation. NeurIPS 2021: 10678-10690 - [i54]Arturs Backurs, Piotr Indyk, Cameron Musco, Tal Wagner:
Faster Kernel Matrix Algebra via Density Estimation. CoRR abs/2102.08341 (2021) - [i53]Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner:
Learning-based Support Estimation in Sublinear Time. CoRR abs/2106.08396 (2021) - [i52]Shyam Narayanan, Sandeep Silwal, Piotr Indyk, Or Zamir:
Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering. CoRR abs/2107.01804 (2021) - [i51]Piotr Indyk, Tal Wagner:
Optimal (Euclidean) Metric Compression. CoRR abs/2110.03152 (2021) - [i50]Justin Y. Chen, Piotr Indyk:
Online Bipartite Matching with Predicted Degrees. CoRR abs/2110.11439 (2021) - [i49]Piotr Indyk, Shyam Narayanan, David P. Woodruff:
Frequency Estimation with One-Sided Error. CoRR abs/2111.03953 (2021) - [i48]Talya Eden, Piotr Indyk, Haike Xu:
Embeddings and labeling schemes for A. CoRR abs/2111.10041 (2021) - [i47]Tianhong Li, Peng Cao, Yuan Yuan, Lijie Fan, Yuzhe Yang, Rogério Feris, Piotr Indyk, Dina Katabi:
Targeted Supervised Contrastive Learning for Long-Tailed Recognition. CoRR abs/2111.13998 (2021) - 2020
- [c163]Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Learning Space Partitions for Nearest Neighbor Search. ICLR 2020 - [c162]Arturs Backurs, Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Scalable Nearest Neighbor Search for Optimal Transport. ICML 2020: 497-506 - [c161]Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei:
Composable Core-sets for Determinant Maximization Problems via Spectral Spanners. SODA 2020: 1675-1694 - [i46]Piotr Indyk, Frederik Mallmann-Trenn, Slobodan Mitrovic, Ronitt Rubinfeld:
Online Page Migration with ML Advice. CoRR abs/2006.05028 (2020)
2010 – 2019
- 2019
- [j37]Anastasios Sidiropoulos, Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Piotr Indyk, Yuri Rabinovich, Harald Räcke, R. Ravi:
Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces. SIAM J. Discret. Math. 33(1): 454-473 (2019) - [c160]Piotr Indyk, Ali Vakilian, Tal Wagner, David P. Woodruff:
Sample-Optimal Low-Rank Approximation of Distance Matrices. COLT 2019: 1723-1751 - [c159]Chen-Yu Hsu, Piotr Indyk, Dina Katabi, Ali Vakilian:
Learning-Based Frequency Estimation Algorithms. ICLR (Poster) 2019 - [c158]Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner:
Scalable Fair Clustering. ICML 2019: 405-413 - [c157]Sepideh Mahabadi, Piotr Indyk, Shayan Oveis Gharan, Alireza Rezaei:
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm. ICML 2019: 4254-4263 - [c156]Jayadev Acharya, Sourbh Bhadane, Piotr Indyk, Ziteng Sun:
Estimating Entropy of Distributions in Constant Space. NeurIPS 2019: 5163-5174 - [c155]Piotr Indyk, Ali Vakilian, Yang Yuan:
Learning-Based Low-Rank Approximations. NeurIPS 2019: 7400-7410 - [c154]Arturs Backurs, Piotr Indyk, Tal Wagner:
Space and Time Efficient Kernel Density Estimation in High Dimensions. NeurIPS 2019: 15773-15782 - [c153]Piotr Indyk, Ali Vakilian:
Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model. PODS 2019: 200-217 - [i45]Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Learning Sublinear-Time Indexing for Nearest Neighbor Search. CoRR abs/1901.08544 (2019) - [i44]Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, Tal Wagner:
Scalable Fair Clustering. CoRR abs/1902.03519 (2019) - [i43]Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee:
Set Cover in Sub-linear Time. CoRR abs/1902.03534 (2019) - [i42]Piotr Indyk, Ali Vakilian, Tal Wagner, David P. Woodruff:
Sample-Optimal Low-Rank Approximation of Distance Matrices. CoRR abs/1906.00339 (2019) - [i41]Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei:
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm. CoRR abs/1907.03197 (2019) - [i40]Anders Aamand, Piotr Indyk, Ali Vakilian:
(Learned) Frequency Estimation Algorithms under Zipfian Distribution. CoRR abs/1908.05198 (2019) - [i39]Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Scalable Nearest Neighbor Search for Optimal Transport. CoRR abs/1910.04126 (2019) - [i38]Piotr Indyk, Ali Vakilian, Yang Yuan:
Learning-Based Low-Rank Approximations. CoRR abs/1910.13984 (2019) - [i37]Jayadev Acharya, Sourbh Bhadane, Piotr Indyk, Ziteng Sun:
Estimating Entropy of Distributions in Constant Space. CoRR abs/1911.07976 (2019) - 2018
- [j36]Arturs Backurs, Piotr Indyk:
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False). SIAM J. Comput. 47(3): 1087-1097 (2018) - [c152]Piotr Indyk, Tal Wagner:
Approximate Nearest Neighbors in Limited Space. COLT 2018: 2012-2036 - [c151]Arturs Backurs, Moses Charikar, Piotr Indyk, Paris Siminelakis:
Efficient Density Evaluation for Smooth Kernels. FOCS 2018: 615-626 - [c150]Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi:
Approximate Sparse Linear Regression. ICALP 2018: 77:1-77:14 - [c149]Haitham Hassanieh, Omid Abari, Michael Rodriguez, Mohammed A. Abdelghany, Dina Katabi, Piotr Indyk:
Fast millimeter wave beam alignment. SIGCOMM 2018: 432-445 - [c148]Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee:
Set Cover in Sub-linear Time. SODA 2018: 2467-2486 - [i36]Alexandr Andoni, Piotr Indyk, Ilya P. Razenshteyn:
Approximate Nearest Neighbor Search in High Dimensions. CoRR abs/1806.09823 (2018) - [i35]Piotr Indyk, Tal Wagner:
Approximate Nearest Neighbors in Limited Space. CoRR abs/1807.00112 (2018) - [i34]Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei:
Composable Core-sets for Determinant Maximization Problems via Spectral Spanners. CoRR abs/1807.11648 (2018) - 2017
- [j35]Mahdi Cheraghchi, Piotr Indyk:
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. ACM Trans. Algorithms 13(3): 34:1-34:36 (2017) - [c147]Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan R. Ullman, Ali Vakilian, Anak Yodpinyanee:
Fractional Set Cover in the Streaming Model. APPROX-RANDOM 2017: 12:1-12:20 - [c146]Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Practical Data-Dependent Metric Compression with Provable Guarantees. NIPS 2017: 2617-2626 - [c145]Arturs Backurs, Piotr Indyk, Ludwig Schmidt:
On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks. NIPS 2017: 4308-4318 - [c144]Piotr Indyk, Tal Wagner:
Near-Optimal (Euclidean) Metric Compression. SODA 2017: 710-723 - [c143]Arturs Backurs, Piotr Indyk, Ludwig Schmidt:
Better Approximations for Tree Sparsity in Nearly-Linear Time. SODA 2017: 2215-2229 - [c142]Piotr Indyk:
Beyond P vs. NP: Quadratic-Time Hardness for Big Data Problems. SPAA 2017: 1 - [e2]Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, Anca Muscholl:
44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland. LIPIcs 80, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-041-5 [contents] - [i33]Arturs Backurs, Piotr Indyk, Ludwig Schmidt:
On the Fine-Grained Complexity of Empirical Risk Minimization: Kernel Methods and Neural Networks. CoRR abs/1704.02958 (2017) - [i32]Haitham Hassanieh, Omid Abari, Michael Rodreguez, Mohammed A. Abdelghany, Dina Katabi, Piotr Indyk:
Agile Millimeter Wave Networks with Provable Guarantees. CoRR abs/1706.06935 (2017) - [i31]Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Practical Data-Dependent Metric Compression with Provable Guarantees. CoRR abs/1711.01520 (2017) - 2016
- [j34]Piotr Indyk, Anca Muscholl, Fabian Kuhn:
ICALP 2017 - Call for Papers. Bull. EATCS 120 (2016) - [c141]Piotr Indyk, Robert D. Kleinberg, Sepideh Mahabadi, Yang Yuan:
Simultaneous Nearest Neighbor Search. SoCG 2016: 44:1-44:15 - [c140]Arturs Backurs, Piotr Indyk:
Which Regular Expression Patterns Are Hard to Match? FOCS 2016: 457-466 - [c139]Chinmay Hegde, Piotr Indyk, Ludwig Schmidt:
A Nearly-Linear Time Framework for Graph-Structured Sparsity. IJCAI 2016: 4165-4169 - [c138]Chinmay Hegde, Piotr Indyk, Ludwig Schmidt:
Fast recovery from a union of subspaces. NIPS 2016: 4394-4402 - [c137]Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian:
Towards Tight Bounds for the Streaming Set Cover Problem. PODS 2016: 371-383 - [c136]Mahdi Cheraghchi, Piotr Indyk:
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. SODA 2016: 298-317 - [c135]Arturs Backurs, Piotr Indyk, Ilya P. Razenshteyn, David P. Woodruff:
Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching. SODA 2016: 318-337 - [p2]Graham Cormode, Piotr Indyk:
Stable Distributions in Streaming Computations. Data Stream Management 2016: 283-300 - [i30]Piotr Indyk, Robert D. Kleinberg, Sepideh Mahabadi, Yang Yuan:
Simultaneous Nearest Neighbor Search. CoRR abs/1604.02188 (2016) - [i29]Piotr Indyk, Tal Wagner:
Near-Optimal (Euclidean) Metric Compression. CoRR abs/1609.06295 (2016) - [i28]Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi:
Approximate Sparse Linear Regression. CoRR abs/1609.08739 (2016) - 2015
- [j33]Chinmay Hegde, Piotr Indyk, Ludwig Schmidt:
Fast Algorithms for Structured Sparsity. Bull. EATCS 117 (2015) - [j32]Albert Kim, Eric Blais, Aditya G. Parameswaran, Piotr Indyk, Samuel Madden, Ronitt Rubinfeld:
Rapid Sampling for Visualizations with Ordering Guarantees. Proc. VLDB Endow. 8(5): 521-532 (2015) - [j31]Chinmay Hegde, Piotr Indyk, Ludwig Schmidt:
Approximation Algorithms for Model-Based Compressive Sensing. IEEE Trans. Inf. Theory 61(9): 5129-5147 (2015) - [c134]Ludwig Schmidt, Chinmay Hegde, Piotr Indyk, Ligang Lu, Xingang Chi, Detlef Hohl:
Seismic feature extraction using steiner tree methods. ICASSP 2015: 1647-1651 - [c133]Chinmay Hegde, Piotr Indyk, Ludwig Schmidt:
A Nearly-Linear Time Framework for Graph-Structured Sparsity. ICML 2015: 928-937 - [c132]Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, Ludwig Schmidt:
Practical and Optimal LSH for Angular Distance. NIPS 2015: 1225-1233 - [c131]Piotr Indyk, Reut Levi, Ronitt Rubinfeld:
Erratum for: Approximating and Testing k-Histogram Distributions in Sub-linear Time. PODS 2015: 343 - [c130]Arturs Backurs, Piotr Indyk:
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false). STOC 2015: 51-58 - [e1]Piotr Indyk:
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015. SIAM 2015, ISBN 978-1-61197-374-7 [contents] - [i27]Arturs Backurs, Piotr Indyk, Eric Price, Ilya P. Razenshteyn, David P. Woodruff:
Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching. CoRR abs/1504.01076 (2015) - [i26]Mahdi Cheraghchi, Piotr Indyk:
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. CoRR abs/1504.07648 (2015) - [i25]Piotr Indyk, Sepideh Mahabadi, Ali Vakilian:
Towards Tight Bounds for the Streaming Set Cover Problem. CoRR abs/1509.00118 (2015) - [i24]Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, Ludwig Schmidt:
Practical and Optimal LSH for Angular Distance. CoRR abs/1509.02897 (2015) - [i23]Arturs Backurs, Piotr Indyk:
Which Regular Expression Patterns are Hard to Match? CoRR abs/1511.07070 (2015) - [i22]Mahdi Cheraghchi, Piotr Indyk:
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j30]Anna C. Gilbert, Piotr Indyk, Mark A. Iwen, Ludwig Schmidt:
Recent Developments in the Sparse Fourier Transform: A compressed Fourier transform for big data. IEEE Signal Process. Mag. 31(5): 91-100 (2014) - [c129]Arturs Backurs, Piotr Indyk:
Better embeddings for planar Earth-Mover Distance over sparse sets. SoCG 2014: 280 - [c128]Piotr Indyk, Michael Kapralov:
Sample-Optimal Fourier Sampling in Any Constant Dimension. FOCS 2014: 514-523 - [c127]Chinmay Hegde, Piotr Indyk, Ludwig Schmidt:
Nearly Linear-Time Model-Based Compressive Sensing. ICALP (1) 2014: 588-599 - [c126]Ludwig Schmidt, Chinmay Hegde, Piotr Indyk, Jonathan Kane, Ligang Lu, Detlef Hohl:
Automatic fault localization using the generalized Earth Mover's distance. ICASSP 2014: 8134-8138 - [c125]Chinmay Hegde, Piotr Indyk, Ludwig Schmidt:
A fast approximation algorithm for tree-sparse recovery. ISIT 2014: 1842-1846 - [c124]Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, Vahab S. Mirrokni:
Composable core-sets for diversity and coverage maximization. PODS 2014: 100-108 - [c123]Piotr Indyk, Michael Kapralov, Eric Price:
(Nearly) Sample-Optimal Sparse Fourier Transform. SODA 2014: 480-499 - [c122]Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, Ilya P. Razenshteyn:
Beyond Locality-Sensitive Hashing. SODA 2014: 1018-1028 - [c121]Chinmay Hegde, Piotr Indyk, Ludwig Schmidt:
Approximation-Tolerant Model-Based Compressive Sensing. SODA 2014: 1544-1561 - [c120]Erik D. Demaine, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian:
On Streaming and Communication Complexity of the Set Cover Problem. DISC 2014: 484-498 - [i21]Piotr Indyk, Michael Kapralov:
Sample-Optimal Fourier Sampling in Any Constant Dimension - Part I. CoRR abs/1403.5804 (2014) - [i20]Chinmay Hegde, Piotr Indyk, Ludwig Schmidt:
Approximation Algorithms for Model-Based Compressive Sensing. CoRR abs/1406.1579 (2014) - [i19]Arturs Backurs, Piotr Indyk:
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false). CoRR abs/1412.0348 (2014) - [i18]Albert Kim, Eric Blais, Aditya G. Parameswaran, Piotr Indyk, Sam Madden, Ronitt Rubinfeld:
Rapid Sampling for Visualizations with Ordering Guarantees. CoRR abs/1412.3040 (2014) - 2013
- [j29]Narayanan Sundaram, Aizana Turmukhametova, Nadathur Satish, Todd Mostak, Piotr Indyk, Samuel Madden, Pradeep Dubey:
Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing. Proc. VLDB Endow. 6(14): 1930-1941 (2013) - [c119]Badih Ghazi, Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price, Lixin Shi:
Sample-optimal average-case sparse Fourier Transform in two dimensions. Allerton 2013: 1258-1265 - [c118]Sofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi, Kasturi R. Varadarajan:
Diverse near neighbor problem. SoCG 2013: 207-214 - [c117]Elyot Grant, Piotr Indyk:
Compressive sensing using locality-preserving matrices. SoCG 2013: 215-222 - [c116]Elyot Grant, Chinmay Hegde, Piotr Indyk:
Nearly optimal linear embeddings into very low dimensions. GlobalSIP 2013: 973-976 - [c115]Piotr Indyk, Ilya P. Razenshteyn:
On Model-Based RIP-1 Matrices. ICALP (1) 2013: 564-575 - [c114]Piotr Indyk:
Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform. PODS 2013: 87-90 - [c113]Alexandr Andoni, Piotr Indyk, Dina Katabi, Haitham Hassanieh:
Shift Finding in Sub-Linear Time. SODA 2013: 457-465 - [c112]Sariel Har-Peled, Piotr Indyk, Anastasios Sidiropoulos:
Euclidean spanners in high dimensions. SODA 2013: 804-809 - [c111]Sofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi:
Real-time recommendation of diverse related articles. WWW 2013: 1-12 - [i17]Badih Ghazi, Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price, Lixin Shi:
Sample-Optimal Average-Case Sparse Fourier Transform in Two Dimensions. CoRR abs/1303.1209 (2013) - [i16]Piotr Indyk, Ilya P. Razenshteyn:
On Model-Based RIP-1 Matrices. CoRR abs/1304.3604 (2013) - [i15]Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, Ilya P. Razenshteyn:
Beyond Locality-Sensitive Hashing. CoRR abs/1306.1547 (2013) - 2012
- [j28]Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachlin:
Compressive Sensing with Local Geometric Features. Int. J. Comput. Geom. Appl. 22(4): 365- (2012) - [j27]Sariel Har-Peled, Piotr Indyk, Rajeev Motwani:
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality. Theory Comput. 8(1): 321-350 (2012) - [c110]Lei Hamilton, Dan Parker, Chris Yu, Piotr Indyk:
Focal plane array folding for efficient information extraction and tracking. AIPR 2012: 1-6 - [c109]Haitham Hassanieh, Fadel Adib, Dina Katabi, Piotr Indyk:
Faster GPS via the sparse fourier transform. MobiCom 2012: 353-364 - [c108]Piotr Indyk, Reut Levi, Ronitt Rubinfeld:
Approximating and testing k-histogram distributions in sub-linear time. PODS 2012: 15-22 - [c107]Jue Wang, Haitham Hassanieh, Dina Katabi, Piotr Indyk:
Efficient and reliable low-power backscatter networks. SIGCOMM 2012: 61-72 - [c106]Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price:
Simple and practical algorithm for sparse Fourier transform. SODA 2012: 1183-1194 - [c105]Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price:
Nearly optimal sparse fourier transform. STOC 2012: 563-578 - [i14]Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric Price:
Nearly Optimal Sparse Fourier Transform. CoRR abs/1201.2501 (2012) - [i13]Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachlin:
Compressive Sensing with Local Geometric Features. CoRR abs/1208.2447 (2012) - 2011
- [c104]Khanh Do Ba, Piotr Indyk:
Sparse Recovery with Partial Support Knowledge. APPROX-RANDOM 2011: 26-37 - [c103]Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachlin:
Compressive sensing with local geometric features. SCG 2011: 87-96 - [c102]Piotr Indyk, Eric Price, David P. Woodruff:
On the Power of Adaptivity in Sparse Recovery. FOCS 2011: 285-294 - [c101]Arnab Bhattacharyya, Piotr Indyk, David P. Woodruff, Ning Xie:
The Complexity of Linear Dependence Problems in Vector Spaces. ICS 2011: 496-508 - [c100]Piotr Indyk, Eric Price:
K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance. STOC 2011: 627-636 - [i12]Piotr Indyk, Eric Price:
K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance. CoRR abs/1104.4674 (2011) - [i11]Khanh Do Ba, Piotr Indyk, Eric Price, David P. Woodruff:
Lower Bounds for Sparse Recovery. CoRR abs/1106.0365 (2011) - [i10]Piotr Indyk, Eric Price, David P. Woodruff:
On the Power of Adaptivity in Sparse Recovery. CoRR abs/1110.3850 (2011) - [i9]Piotr Indyk, Reut Levi, Ronitt Rubinfeld:
Approximating and Testing k-Histogram Distributions in Sub-linear time. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j26]Anna C. Gilbert, Piotr Indyk:
Sparse Recovery Using Sparse Matrices. Proc. IEEE 98(6): 937-947 (2010) - [j25]Volkan Cevher, Piotr Indyk, Lawrence Carin, Richard G. Baraniuk:
Sparse Signal Recovery and Acquisition with Graphical Models. IEEE Signal Process. Mag. 27(6): 92-103 (2010) - [j24]Zeeshan Syed, Collin M. Stultz, Manolis Kellis, Piotr Indyk, John V. Guttag:
Motif discovery in physiological datasets: A methodology for inferring predictive elements. ACM Trans. Knowl. Discov. Data 4(1): 2:1-2:23 (2010) - [j23]Radu Berinde, Piotr Indyk, Graham Cormode, Martin J. Strauss:
Space-optimal heavy hitters with strong error bounds. ACM Trans. Database Syst. 35(4): 26:1-26:28 (2010) - [c99]Rishi Gupta, Piotr Indyk, Eric Price:
Sparse recovery for Earth Mover Distance. Allerton 2010: 1742-1744 - [c98]Piotr Indyk, Avner Magen, Anastasios Sidiropoulos, Anastasios Zouzias:
Online Embeddings. APPROX-RANDOM 2010: 246-259 - [c97]Piotr Indyk, Stanislaw J. Szarek:
Almost-Euclidean Subspaces of l1N\ell_1^N via Tensor Products: A Simple Approach to Randomness Reduction. APPROX-RANDOM 2010: 632-641 - [c96]Piotr Indyk:
Sparse Recovery Using Sparse Random Matrices. LATIN 2010: 157 - [c95]Piotr Indyk, Hung Q. Ngo, Atri Rudra:
Efficiently Decodable Non-adaptive Group Testing. SODA 2010: 1126-1142 - [c94]Khanh Do Ba, Piotr Indyk, Eric Price, David P. Woodruff:
Lower Bounds for Sparse Recovery. SODA 2010: 1190-1197 - [p1]Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld:
Sublinear Algorithms in the External Memory Model. Property Testing 2010: 240-243 - [i8]Piotr Indyk, Stanislaw J. Szarek:
A simple construction of almost-Euclidean subspaces of ℓ1N via tensor products. CoRR abs/1001.0041 (2010)
2000 – 2009
- 2009
- [j22]Zeeshan Syed, Piotr Indyk, John V. Guttag:
Learning Approximate Sequential Patterns for Classification. J. Mach. Learn. Res. 10: 1913-1936 (2009) - [j21]Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat:
Efficient computations of l1 and l∞ rearrangement distances. Theor. Comput. Sci. 410(43): 4382-4390 (2009) - [c93]Radu Berinde, Piotr Indyk:
Sequential Sparse Matching Pursuit. Allerton 2009: 36-43 - [c92]Alexandr Andoni, Khanh Do Ba, Piotr Indyk, David P. Woodruff:
Efficient Sketches for Earth-Mover Distance, with Applications. FOCS 2009: 324-330 - [c91]Alexandr Andoni, Piotr Indyk, Krzysztof Onak, Ronitt Rubinfeld:
External Sampling. ICALP (1) 2009: 83-94 - [c90]Radu Berinde, Graham Cormode, Piotr Indyk, Martin J. Strauss:
Space-optimal heavy hitters with strong error bounds. PODS 2009: 157-166 - [c89]Alexandr Andoni, Piotr Indyk, Robert Krauthgamer, Huy L. Nguyen:
Approximate line nearest neighbor in high dimensions. SODA 2009: 293-301 - [c88]Alexandr Andoni, Piotr Indyk, Robert Krauthgamer:
Overcoming the l1 non-embeddability barrier: algorithms for product metrics. SODA 2009: 865-874 - 2008
- [j20]Alexandr Andoni, Piotr Indyk:
Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1): 117-122 (2008) - [j19]Gereon Frahling, Piotr Indyk, Christian Sohler:
Sampling in Dynamic Data Streams and Applications. Int. J. Comput. Geom. Appl. 18(1/2): 3-28 (2008) - [j18]Sudipto Guha, Piotr Indyk, Andrew McGregor:
Sketching information divergences. Mach. Learn. 72(1-2): 5-19 (2008) - [j17]Gregory Shakhnarovich, Trevor Darrell, Piotr Indyk:
Nearest-Neighbor Methods in Learning and Vision. IEEE Trans. Neural Networks 19(2): 377 (2008) - [c87]Radu Berinde, Piotr Indyk, Milan Ruzic:
Practical near-optimal sparse recovery in the L1 norm. Allerton 2008: 198-205 - [c86]Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss:
Combining geometry and combinatorics: A unified approach to sparse signal recovery. Allerton 2008: 798-805 - [c85]Piotr Indyk, Milan Ruzic:
Near-Optimal Sparse Recovery in the L1 Norm. FOCS 2008: 199-207 - [c84]Piotr Indyk:
Explicit constructions for compressed sensing of sparse signals. SODA 2008: 30-33 - [c83]Alexandr Andoni, Piotr Indyk, Robert Krauthgamer:
Earth mover distance over high-dimensional spaces. SODA 2008: 343-352 - [c82]Piotr Indyk, Andrew McGregor:
Declaring independence via the sketching of sketches. SODA 2008: 737-745 - [i7]Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss:
Combining geometry and combinatorics: A unified approach to sparse signal recovery. CoRR abs/0804.4666 (2008) - 2007
- [j16]Piotr Indyk, Assaf Naor:
Nearest-neighbor-preserving embeddings. ACM Trans. Algorithms 3(3): 31 (2007) - [c81]Sudipto Guha, Piotr Indyk, Andrew McGregor:
Sketching Information Divergences. COLT 2007: 424-438 - [c80]Piotr Indyk, Anastasios Sidiropoulos:
Probabilistic embeddings of bounded genus graphs into planar graphs. SCG 2007: 204-209 - [c79]Piotr Indyk:
A near linear time constant factor approximation for Euclidean bichromatic matching (cost). SODA 2007: 39-42 - [c78]Mihai Badoiu, Piotr Indyk, Anastasios Sidiropoulos:
Approximation algorithms for embedding general metrics into trees. SODA 2007: 512-521 - [c77]Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat:
Efficient Computations of l1 and linfinity Rearrangement Distances. SPIRE 2007: 39-49 - [c76]Piotr Indyk:
Uncertainty principles, extractors, and explicit embeddings of l2 into l1. STOC 2007: 615-620 - [i6]Alexandr Andoni, Piotr Indyk, Robert Krauthgamer:
Earth Mover Distance over High-Dimensional Spaces. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j15]Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk:
Low-Dimensional Embedding with Extra Information. Discret. Comput. Geom. 36(4): 609-632 (2006) - [j14]Piotr Indyk:
Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM 53(3): 307-323 (2006) - [c75]Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos:
Embedding ultrametrics into low-dimensional spaces. SCG 2006: 187-196 - [c74]Alexandr Andoni, Piotr Indyk, Mihai Patrascu:
On the Optimality of the Dimensionality Reduction Method. FOCS 2006: 449-458 - [c73]Alexandr Andoni, Piotr Indyk:
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. FOCS 2006: 459-468 - [c72]Alexandr Andoni, Piotr Indyk:
Efficient algorithms for substring near neighbor problem. SODA 2006: 1203-1212 - [c71]Piotr Indyk, David P. Woodruff:
Polylogarithmic Private Approximations and Efficient Matching. TCC 2006: 245-264 - [i5]Piotr Indyk:
Uncertainty Principles, Extractors, and Explicit Embeddings of L2 into L1. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j13]Venkatesan Guruswami, Piotr Indyk:
Linear-time encodable/decodable codes with near-optimal rate. IEEE Trans. Inf. Theory 51(10): 3393-3400 (2005) - [c70]Gereon Frahling, Piotr Indyk, Christian Sohler:
Sampling in dynamic data streams and applications. SCG 2005: 142-149 - [c69]Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler:
Facility Location in Sublinear Time. ICALP 2005: 866-877 - [c68]Piotr Indyk, David P. Woodruff:
Optimal approximations of the frequency moments of data streams. STOC 2005: 202-208 - [c67]Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasios Sidiropoulos:
Low-distortion embeddings of general metrics into the line. STOC 2005: 225-233 - [i4]Piotr Indyk, David P. Woodruff:
Polylogarithmic Private Approximations and Efficient Matching. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j12]Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian:
Combinatorial and Experimental Methods for Approximate Point Pattern Matching. Algorithmica 38(1): 59-90 (2004) - [j11]Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian:
Pattern Matching for Sets of Segments. Algorithmica 40(3): 147-160 (2004) - [c66]Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab S. Mirrokni:
Locality-sensitive hashing scheme based on p-stable distributions. SCG 2004: 253-262 - [c65]Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Piotr Indyk:
Low-dimensional embedding with extra information. SCG 2004: 320-329 - [c64]Piotr Indyk:
Streaming Algorithms for Geometric Problems. FSTTCS 2004: 32-34 - [c63]Venkatesan Guruswami, Piotr Indyk:
Linear-Time List Decoding in Error-Free Settings: (Extended Abstract). ICALP 2004: 695-707 - [c62]Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat:
Closest Pair Problems in Very High Dimensions. ICALP 2004: 782-792 - [c61]Piotr Indyk:
Approximate Nearest Neighbor under edit distance via product metrics. SODA 2004: 646-650 - [c60]Mihai Badoiu, Piotr Indyk:
Fast approximate pattern matching with few indels via embeddings. SODA 2004: 651-652 - [c59]Venkatesan Guruswami, Piotr Indyk:
Efficiently decodable codes meeting Gilbert-Varshamov bound for low rates. SODA 2004: 756-757 - [c58]Piotr Indyk:
Algorithms for dynamic geometric problems over data streams. STOC 2004: 373-380 - [r2]Piotr Indyk, Jirí Matousek:
Low-Distortion Embeddings of Finite Metric Spaces. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 177-196 - [r1]Piotr Indyk:
Nearest Neighbors in High-Dimensional Spaces. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 877-892 - 2003
- [j10]Piotr Indyk, Suresh Venkatasubramanian:
Approximate congruence in nearly linear time. Comput. Geom. 24(2): 115-128 (2003) - [j9]Julien Basch, Harish Devarajan, Piotr Indyk, Li Zhang:
Probabilistic Analysis for Discrete Attributes of Moving Points. Int. J. Comput. Geom. Appl. 13(1): 5-22 (2003) - [j8]Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan:
Comparing Data Streams Using Hamming Norms (How to Zero In). IEEE Trans. Knowl. Data Eng. 15(3): 529-540 (2003) - [c57]Piotr Indyk, David P. Woodruff:
Tight Lower Bounds for the Distinct Elements Problem. FOCS 2003: 283-288 - [c56]Alexandr Andoni, Michel Deza, Anupam Gupta, Piotr Indyk, Sofya Raskhodnikova:
Lower bounds for embedding edit distance into normed spaces. SODA 2003: 523-526 - [c55]Venkatesan Guruswami, Piotr Indyk:
Embeddings and non-approximability of geometric problems. SODA 2003: 537-538 - [c54]Piotr Indyk:
Better algorithms for high-dimensional proximity problems via asymmetric embeddings. SODA 2003: 539-545 - [c53]Venkatesan Guruswami, Piotr Indyk:
Linear time encodable and list decodable codes. STOC 2003: 126-135 - [i3]Sariel Har-Peled, Piotr Indyk:
When Crossings Count - Approximating the Minimum Spanning Tree. CoRR cs.CG/0303001 (2003) - 2002
- [j7]Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani:
Maintaining Stream Statistics over Sliding Windows. SIAM J. Comput. 31(6): 1794-1813 (2002) - [c52]Piotr Indyk:
Approximate nearest neighbor algorithms for Frechet distance via product metrics. SCG 2002: 102-106 - [c51]Moses Charikar, Piotr Indyk, Rina Panigrahy:
New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems. ICALP 2002: 451-462 - [c50]Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss:
Histogramming Data Streams with Fast Per-Item Processing. ICALP 2002: 681-692 - [c49]Graham Cormode, Piotr Indyk, Nick Koudas, S. Muthukrishnan:
Fast Mining of Massive Tabular Data via Approximate Distance Computations. ICDE 2002: 605-614 - [c48]Nitin Thaper, Sudipto Guha, Piotr Indyk, Nick Koudas:
Dynamic multidimensional histograms. SIGMOD Conference 2002: 428-439 - [c47]Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani:
Maintaining stream statistics over sliding windows (extended abstract). SODA 2002: 635-644 - [c46]Piotr Indyk:
Explicit constructions of selectors and related combinatorial structures, with applications. SODA 2002: 697-704 - [c45]Lars Engebretsen, Piotr Indyk, Ryan O'Donnell:
Derandomized dimensionality reduction with applications. SODA 2002: 705-712 - [c44]Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Muthukrishnan, Martin Strauss:
Near-optimal sparse fourier representations via sampling. STOC 2002: 152-161 - [c43]Mihai Badoiu, Sariel Har-Peled, Piotr Indyk:
Approximate clustering via core-sets. STOC 2002: 250-257 - [c42]Anna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis Kotidis, S. Muthukrishnan, Martin Strauss:
Fast, small-space algorithms for approximate histogram maintenance. STOC 2002: 389-398 - [c41]Venkatesan Guruswami, Piotr Indyk:
Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets. STOC 2002: 812-821 - [c40]Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthukrishnan:
Comparing Data Streams Using Hamming Norms (How to Zero In). VLDB 2002: 335-345 - [c39]Taher H. Haveliwala, Aristides Gionis, Dan Klein, Piotr Indyk:
Evaluating strategies for similarity search on the web. WWW 2002: 432-442 - [i2]Piotr Indyk:
List-decoding in Linear Time. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j6]Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet:
Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems. Algorithmica 30(2): 164-187 (2001) - [j5]Piotr Indyk:
A Small Approximately Min-Wise Independent Family of Hash Functions. J. Algorithms 38(1): 84-90 (2001) - [j4]Piotr Indyk:
On Approximate Nearest Neighbors under linfinity Norm. J. Comput. Syst. Sci. 63(4): 627-638 (2001) - [j3]Yair Bartal, Moses Charikar, Piotr Indyk:
On page migration and other relaxed task systems. Theor. Comput. Sci. 268(1): 43-66 (2001) - [j2]Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang:
Finding Interesting Associations without Support Pruning. IEEE Trans. Knowl. Data Eng. 13(1): 64-78 (2001) - [c38]Piotr Indyk:
Algorithmic Applications of Low-Distortion Geometric Embeddings. FOCS 2001: 10-33 - [c37]Venkatesan Guruswami, Piotr Indyk:
Expander-Based Constructions of Efficiently Decodable Codes. FOCS 2001: 658-667 - [c36]Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian:
Pattern matching for sets of segments. SODA 2001: 295-304 - [c35]Ashish Goel, Piotr Indyk, Kasturi R. Varadarajan:
Reductions among high dimensional proximity problems. SODA 2001: 769-778 - 2000
- [b1]Piotr Indyk:
High-dimensional computational geometry. Stanford University, USA, 2000 - [c34]Sariel Har-Peled, Piotr Indyk:
When crossings count - approximating the minimum spanning tree. SCG 2000: 166-175 - [c33]Piotr Indyk:
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation. FOCS 2000: 189-197 - [c32]Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang:
Finding Interesting Associations without Support Pruning. ICDE 2000: 489-500 - [c31]Martin Gavrilov, Dragomir Anguelov, Piotr Indyk, Rajeev Motwani:
Mining the stock market (extended abstract): which measure is best? KDD 2000: 487-496 - [c30]Piotr Indyk, Suresh Venkatasubramanian:
Approximate congruence in nearly linear time. SODA 2000: 354-360 - [c29]Piotr Indyk:
Dimensionality reduction techniques for proximity problems. SODA 2000: 371-378 - [c28]Piotr Indyk, Nick Koudas, S. Muthukrishnan:
Identifying Representative Trends in Massive Time Series Data Sets Using Sketches. VLDB 2000: 363-372 - [c27]Taher H. Haveliwala, Aristides Gionis, Piotr Indyk:
Scalable Techniques for Clustering the Web. WebDB (Informal Proceedings) 2000: 129-134 - [i1]Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian:
Pattern Matching for sets of segments. CoRR cs.CG/0009013 (2000)
1990 – 1999
- 1999
- [j1]Donald Aingworth, Chandra Chekuri, Piotr Indyk, Rajeev Motwani:
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication). SIAM J. Comput. 28(4): 1167-1181 (1999) - [c26]Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian:
Geometric Pattern Matching: A Performance Study. SCG 1999: 79-85 - [c25]Piotr Indyk:
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces. FOCS 1999: 154-159 - [c24]Arnon Amir, Alon Efrat, Piotr Indyk, Hanan Samet:
Efficient Regular Data Structures and Algorithms for Location and Proximity Problems. FOCS 1999: 160-170 - [c23]Martin Farach-Colton, Piotr Indyk:
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings. FOCS 1999: 171-180 - [c22]Ashish Goel, Piotr Indyk:
Stochastic Load Balancing and Related Problems. FOCS 1999: 579-586 - [c21]Richard Cole, Ramesh Hariharan, Piotr Indyk:
Tree Pattern Matching and Subset Matching in Deterministic O(n log3 n)-time. SODA 1999: 245-254 - [c20]Piotr Indyk:
A Small Approximately min-wise Independent Family of Hash Functions. SODA 1999: 454-456 - [c19]Piotr Indyk, Rajeev Motwani, Suresh Venkatasubramanian:
Geometric Matching Under Noise: Combinatorial Bounds and Algorithms. SODA 1999: 457-465 - [c18]Piotr Indyk:
Sublinear Time Algorithms for Metric Space Problems. STOC 1999: 428-434 - [c17]Piotr Indyk:
Inerpolation of Symmetric Functions and a New Type of Combinatorial Design. STOC 1999: 736-740 - [c16]Aristides Gionis, Piotr Indyk, Rajeev Motwani:
Similarity Search in High Dimensions via Hashing. VLDB 1999: 518-529 - 1998
- [c15]Piotr Indyk:
On Approximate Nearest Neighbors in Non-Euclidean Spaces. FOCS 1998: 148-155 - [c14]Piotr Indyk:
Faster Algorithms for String Matching Problems: Matching the Convolution Bound. FOCS 1998: 166-173 - [c13]Soumen Chakrabarti, Byron Dom, Piotr Indyk:
Enhanced Hypertext Categorization Using Hyperlinks. SIGMOD Conference 1998: 307-318 - [c12]Piotr Indyk, Rajeev Motwani:
Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. STOC 1998: 604-613 - 1997
- [c11]Tibor Hegedüs, Piotr Indyk:
On Learning Disjunctions of Zero-One Treshold Functions with Queries. ALT 1997: 446-460 - [c10]Li Zhang, Harish Devarajan, Julien Basch, Piotr Indyk:
Probabilistic Analysis for Combinatorial Functions of Moving Points. SCG 1997: 442-444 - [c9]Leszek Gasieniec, Piotr Indyk, Piotr Krysta:
External Inverse Pattern Matching. CPM 1997: 90-101 - [c8]Leszek Gasieniec, Piotr Indyk:
Efficient Parallel Computing with Memory Faults. FCT 1997: 188-197 - [c7]Piotr Indyk:
Deterministic Superimposed Coding with Applications to Pattern Matching. FOCS 1997: 127-136 - [c6]Yair Bartal, Moses Charikar, Piotr Indyk:
On Page Migration and Other Relaxed Task Systems. SODA 1997: 43-52 - [c5]Piotr Indyk, Rajeev Motwani, Prabhakar Raghavan, Santosh S. Vempala:
Locality-Preserving Hashing in Multidimensional Spaces. STOC 1997: 618-625 - 1996
- [c4]Bogdan S. Chlebus, Anna Gambin, Piotr Indyk:
Shared-Memory Simulations on a Faulty-Memory DMM. ICALP 1996: 586-597 - [c3]Piotr Indyk:
On Word-Level Parallelism in Fault-Tolerant Computing. STACS 1996: 193-204 - 1995
- [c2]Piotr Indyk:
Optimal Simulation of Automata by Neural Nets. STACS 1995: 337-348 - 1994
- [c1]Bogdan S. Chlebus, Anna Gambin, Piotr Indyk:
PRAM Computations Resilient to Memory Faults. ESA 1994: 401-412
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 01:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
