# Piotr Indyk, Ph.D. - Publications

## Affiliations: | 2001 | Stanford University, Palo Alto, CA |

##### Area:

Computer ScienceYear | Citation | Score | |||
---|---|---|---|---|---|

2016 | Indyk P, Kleinberg R, Mahabadi S, Yuan Y. Simultaneous Nearest Neighbor Search Leibniz International Proceedings in Informatics, Lipics. 51: 44.1-44.15. DOI: 10.4230/LIPIcs.SoCG.2016.44 |
1 | |||

2016 | Cheraghchi M, Indyk P. Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1: 298-317. DOI: 10.1145/3029050 |
1 | |||

2016 | Har-Peled S, Indyk P, Mahabadi S, Vakilian A. Towards tight bounds for the streaming set cover problem Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 26: 371-383. DOI: 10.1145/2902251.2902287 |
1 | |||

2016 | Backurs A, Indyk P, Razenshteyn I, Woodruff DP. Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1: 318-337. |
1 | |||

2015 | Backurs A, Indyk P. Edit distance cannot be computed in strongly subquadratic time (unless SETH is false) Proceedings of the Annual Acm Symposium On Theory of Computing. 14: 51-58. DOI: 10.1137/15M1053128 |
1 | |||

2015 | Hegde C, Indyk P, Schmidt L. Approximation Algorithms for Model-Based Compressive Sensing Ieee Transactions On Information Theory. 61: 5129-5147. DOI: 10.1109/Tit.2015.2457939 |
1 | |||

2015 | Schmidt L, Hegde C, Indyk P, Lu L, Chi X, Hohl D. Seismic feature extraction using steiner tree methods Icassp, Ieee International Conference On Acoustics, Speech and Signal Processing - Proceedings. 2015: 1647-1651. DOI: 10.1109/ICASSP.2015.7178250 |
1 | |||

2015 | Indyk P. Fast algorithms for structured sparsity Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9135: XXV. |
1 | |||

2015 | Hegde C, Indyk P, Schmidt L. A nearly-linear time framework for graph-structured sparsity 32nd International Conference On Machine Learning, Icml 2015. 2: 928-937. |
1 | |||

2015 | Andoni A, Indyk P, Laarhoven T, Razenshteyn I, Schmidt L. Practical and optimal LSH for angular distance Advances in Neural Information Processing Systems. 2015: 1225-1233. |
1 | |||

2015 | Kim A, Blais E, Parameswaran A, Indyk P, Madden S, Rubinfeld R. Rapid Sampling for Visualizations with Ordering Guarantees Proceedings of the Vldb Endowment. 8: 521-532. |
1 | |||

2014 | Indyk P, Mahabadi S, Mahdian M, Mirrokni VS. Composable core-sets for diversity and coverage maximization Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 100-108. DOI: 10.1145/2594538.2594560 |
1 | |||

2014 | Bačkurs A, Indyk P. Better embeddings for Planar Earth-Mover Distance over sparse sets Proceedings of the Annual Symposium On Computational Geometry. 280-289. DOI: 10.1145/2582112.2582120 |
1 | |||

2014 | Gilbert AC, Indyk P, Iwen M, Schmidt L. Recent developments in the sparse fourier transform: A compressed fourier transform for big data Ieee Signal Processing Magazine. 31: 91-100. DOI: 10.1109/Msp.2014.2329131 |
1 | |||

2014 | Hegde C, Indyk P, Schmidt L. A fast approximation algorithm for tree-sparse recovery Ieee International Symposium On Information Theory - Proceedings. 1842-1846. DOI: 10.1109/ISIT.2014.6875152 |
1 | |||

2014 | Schmidt L, Hegde C, Indyk P, Kane J, Lu L, Hohl D. Automatic fault localization using the generalized Earth Mover's distance Icassp, Ieee International Conference On Acoustics, Speech and Signal Processing - Proceedings. 8134-8138. DOI: 10.1109/ICASSP.2014.6855186 |
1 | |||

2014 | Indyk P, Kapralov M. Sample-optimal fourier sampling in any constant dimension Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 514-523. DOI: 10.1109/FOCS.2014.61 |
1 | |||

2014 | Hegde C, Indyk P, Schmidt L. Nearly linear-time model-based compressive sensing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8572: 588-599. DOI: 10.1007/978-3-662-43948-7_49 |
1 | |||

2014 | Hegde C, Indyk P, Schmidt L. Approximation-tolerant model-based compressive sensing Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1544-1561. |
1 | |||

2014 | Indyk P, Kapralov M, Price E. (Nearly) sample-optimal sparse fourier transform Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 480-499. |
1 | |||

2014 | Andon A, Indyk P, Nguyên HL, Razenshteyn I. Beyond locality-sensitive hashing Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1018-1028. |
1 | |||

2014 | Demaine ED, Indyk P, Mahabadi S, Vakilian A. On streaming and communication complexity of the set cover problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8784: 484-498. |
1 | |||

2013 | Indyk P. Sketching via hashing: From heavy hitters to compressive sensing to sparse fourier transform Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 87-90. DOI: 10.1145/2463664.2465217 |
1 | |||

2013 | Grant E, Hegde C, Indyk P. Nearly optimal linear embeddings into very low dimensions 2013 Ieee Global Conference On Signal and Information Processing, Globalsip 2013 - Proceedings. 973-976. DOI: 10.1109/GlobalSIP.2013.6737055 |
1 | |||

2013 | Ghazi B, Hassanieh H, Indyk P, Katabi D, Price E, Shi L. Sample-optimal average-case sparse Fourier Transform in two dimensions 2013 51st Annual Allerton Conference On Communication, Control, and Computing, Allerton 2013. 1258-1265. DOI: 10.1109/Allerton.2013.6736670 |
1 | |||

2013 | Indyk P, Razenshteyn I. On model-based RIP-1 matrices |
1 | |||

2013 | Grant E, Indyk P. Compressive sensing using locality-preserving matrices Proceedings of the Annual Symposium On Computational Geometry. 215-222. |
1 | |||

2013 | Har-Peled S, Indyk P, Sidiropoulos A. Euclidean spanners in high dimensions Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 804-809. |
1 | |||

2013 | Andoni A, Hassanieh H, Indyk P, Katabi D. Shift finding in sub-linear time Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 457-465. |
1 | |||

2013 | Abbar S, Amer-Yahia S, Indyk P, Mahabadi S. Real-time recommendation of diverse related articles Www 2013 - Proceedings of the 22nd International Conference On World Wide Web. 1-11. |
1 | |||

2013 | Abbar S, Amer-Yahia S, Indyk P, Mahabadi S, Varadarajan KR. Diverse near neighbor problem Proceedings of the Annual Symposium On Computational Geometry. 207-213. |
1 | |||

2013 | Sundaram N, Turmukhametova A, Satish N, Mostak T, Indyk P, Madden S, Dubey P. Streaming similarity search over one billion tweets using parallel locality-sensitive hashing Proceedings of the Vldb Endowment. 6: 1930-1941. |
1 | |||

2012 | Hassanieh H, Adid F, Katabi D, Indyk P. Faster GPS via the sparse fourier transform Proceedings of the Annual International Conference On Mobile Computing and Networking, Mobicom. 353-364. DOI: 10.1145/2348543.2348587 |
1 | |||

2012 | Wang J, Hassanieh H, Katabi D, Indyk P. Efficient and reliable low-power backscatter networks Sigcomm'12 - Proceedings of the Acm Sigcomm 2012 Conference Applications, Technologies, Architectures, and Protocols For Computer Communication. 61-72. DOI: 10.1145/2342356.2342364 |
1 | |||

2012 | Hassanieh H, Indyk P, Katabi D, Price E. Nearly optimal sparse fourier transform Proceedings of the Annual Acm Symposium On Theory of Computing. 563-577. DOI: 10.1145/2213977.2214029 |
1 | |||

2012 | Indyk P, Levi R, Rubinfeld R. Approximating and testing k-histogram distributions in sub-linear time Proceedings of the Acm Sigact-Sigmod-Sigart Symposium On Principles of Database Systems. 15-21. DOI: 10.1145/2213556.2213561 |
1 | |||

2012 | Gupta R, Indyk P, Price E, Rachlin Y. Compressive sensing with local geometric features International Journal of Computational Geometry and Applications. 22: 365-390. DOI: 10.1142/S0218195912600102 |
1 | |||

2012 | Hamilton L, Parker D, Yu C, Indyk P. Focal plane array folding for efficient information extraction and tracking Proceedings - Applied Imagery Pattern Recognition Workshop. DOI: 10.1109/AIPR.2012.6528209 |
1 | |||

2012 | Hassanieh H, Indyk P, Katabi D, Price E. Simple and practical algorithm for sparse fourier transform Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1183-1194. |
1 | |||

2011 | Indyk P, Price E. K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance Proceedings of the Annual Acm Symposium On Theory of Computing. 627-636. DOI: 10.1145/1993636.1993720 |
1 | |||

2011 | Indyk P, Price E, Woodruff DP. On the power of adaptivity in sparse recovery Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 285-294. DOI: 10.1109/FOCS.2011.83 |
1 | |||

2011 | Ba KD, Indyk P. Sparse recovery with partial support knowledge |
1 | |||

2010 | Syed Z, Stultz C, Kellis M, Indyk P, Guttag J. Motif Discovery in Physiological Datasets: A Methodology for Inferring Predictive Elements. Acm Transactions On Knowledge Discovery From Data. 4: 2. PMID 20730037 DOI: 10.1145/1644873.1644875 |
1 | |||

2010 | Berinde R, Indyk P, Cormode G, Strauss MJ. Space-optimal heavy hitters with strong error bounds Acm Transactions On Database Systems. 35. DOI: 10.1145/1862919.1862923 |
1 | |||

2010 | Cevher V, Indyk P, Carin L, Baraniuk R. Sparse signal recovery and acquisition with graphical models Ieee Signal Processing Magazine. 27: 92-103. DOI: 10.1109/Msp.2010.938029 |
1 | |||

2010 | Gilbert A, Indyk P. Sparse recovery using sparse matrices Proceedings of the Ieee. 98: 937-947. DOI: 10.1109/JPROC.2010.2045092 |
1 | |||

2010 | Gupta R, Indyk P, Price E. Sparse recovery for earth mover distance 2010 48th Annual Allerton Conference On Communication, Control, and Computing, Allerton 2010. 1742-1744. DOI: 10.1109/ALLERTON.2010.5707127 |
1 | |||

2010 | Andoni A, Indyk P, Onak K, Rubinfeld R. Sublinear algorithms in the external memory model |
1 | |||

2010 | Indyk P, Szarek S. Almost-Euclidean subspaces of ℓ1N via tensor products: A simple approach to randomness reduction |
1 | |||

2010 | Indyk P, Magen A, Sidiropoulos A, Zouzias A. Online embeddings |
1 | |||

2010 | Ba KD, Indyk P, Price E, Woodruff DP. Lower bounds for sparse recovery Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1190-1197. |
1 | |||

2010 | Indyk P, Ngo HQ, Rudra A. Efficiently decodable non-adaptive group testing Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1126-1142. |
1 | |||

2009 | Andoni A, Ba KD, Indyk P, Woodruff D. Efficient sketches for Earth-Mover Distance, with applications Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 324-330. DOI: 10.1109/FOCS.2009.25 |
1 | |||

2009 | Berinde R, Indyk P. Sequential sparse matching pursuit 2009 47th Annual Allerton Conference On Communication, Control, and Computing, Allerton 2009. 36-43. DOI: 10.1109/ALLERTON.2009.5394834 |
1 | |||

2009 | Amir A, Aumann Y, Indyk P, Levy A, Porat E. Efficient computations of ℓTheoretical Computer Science. 410: 4382-4390. DOI: 10.1016/J.Tcs.2009.07.019 |
1 | |||

2009 | Andoni A, Indyk P, Onak K, Rubinfeld R. External sampling |
1 | |||

2009 | Syed Z, Indyk P, Guttag J. Learning approximate sequential patterns for classification Journal of Machine Learning Research. 10: 1913-1936. |
1 | |||

2009 | Andoni A, Indyk P, Krauthgamer R. Overcoming the ℓ 1 non-embeddability barrier: Algorithms for product metrics Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 865-874. |
1 | |||

2009 | Andoni A, Indyk P, Krauthgamer R, Nguyen HL. Approximate line nearest neighbor in high dimensions Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 293-301. |
1 | |||

2008 | Andoni A, Indyk P. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions Communications of the Acm. 51: 117-122. DOI: 10.1145/1327452.1327494 |
1 | |||

2008 | Indyk P, Ružić M. Near-optimal sparse recovery in the LProceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 199-207. DOI: 10.1109/FOCS.2008.82 |
1 | |||

2008 | Berinde R, Gilbert AC, Indyk P, Karloff H, Strauss MJ. Combining geometry and combinatorics: A unified approach to sparse signal recovery 46th Annual Allerton Conference On Communication, Control, and Computing. 798-805. DOI: 10.1109/ALLERTON.2008.4797639 |
1 | |||

2008 | Berinde R, Indyk P, Ružić M. Practical near-optimal sparse recovery in the L1 norm 46th Annual Allerton Conference On Communication, Control, and Computing. 198-205. DOI: 10.1109/ALLERTON.2008.4797556 |
1 | |||

2008 | Guha S, Indyk P, McGregor A. Sketching information divergences Machine Learning. 72: 5-19. DOI: 10.1007/S10994-008-5054-X |
1 | |||

2008 | Indyk P. Explicit constructions for compressed sensing of sparse signals Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 30-33. |
1 | |||

2008 | McGregor A, Indyk P. Declaring independence via the sketching of sketches Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 737-745. |
1 | |||

2008 | Andoni A, Indyk P, Krauthgamer R. Earth Mover Distance over high-dimensional spaces Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 343-352. |
1 | |||

2007 | Indyk P, Naor A. Nearest-neighbor-preserving embeddings Acm Transactions On Algorithms. 3. DOI: 10.1145/1273340.1273347 |
1 | |||

2007 | Indyk P. Uncertainty principles, extractors, and explicit embeddings of l2 into l1 Proceedings of the Annual Acm Symposium On Theory of Computing. 615-620. DOI: 10.1145/1250790.1250881 |
1 | |||

2007 | Indyk P, Sidiropoulos A. Probabilistic embeddings of bounded genus graphs into planar graphs Proceedings of the Annual Symposium On Computational Geometry. 204-209. DOI: 10.1145/1247069.1247107 |
1 | |||

2007 | Chan AM, Feldman J, Madyastha R, Indyk P, Karger D. Low-complexity localized walsh decoding for CDMA systems Proceedings - Ieee Military Communications Conference Milcom. DOI: 10.1109/MILCOM.2006.302017 |
1 | |||

2007 | Indyk P. A near linear time constant factor approximation for Euclidean bichromatic matching (cost) Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 7: 39-42. |
1 | |||

2007 | BǍdoiu M, Indyk P, Sidiropoulos A. Approximation algorithms for embedding general metrics into trees Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 7: 512-521. |
1 | |||

2007 | Amir A, Aumann Y, Indyk P, Levy A, Porat E. Efficient computations of ℓ1 and ℓ∞ rearrangement distances |
1 | |||

2006 | Indyk P. Stable distributions, pseudorandom generators, embeddings, and data stream computation Journal of the Acm. 53: 307-323. DOI: 10.1145/1147954.1147955 |
1 | |||

2006 | Andoni A, Indyk P. Efficient algorithms for substring near neighbor problem Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1203-1212. DOI: 10.1145/1109557.1109690 |
1 | |||

2006 | Andoni A, Indyk P, Pǎtraşcu M. On the optimality of the dimensionality reduction method Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 449-458. DOI: 10.1109/FOCS.2006.56 |
1 | |||

2006 | Badoiu M, Demaine ED, Hajiaghayi M, Indyk P. Low-dimensional embedding with extra information Discrete and Computational Geometry. 36: 609-632. DOI: 10.1007/S00454-006-1268-5 |
1 | |||

2006 | Bǎdoiu M, Chuzhoy J, Indyk P, Sidiropoulos A. Embedding ultrametrics into low-dimensional spaces Proceedings of the Annual Symposium On Computational Geometry. 2006: 187-196. |
1 | |||

2005 | Indyk P, Woodruff D. Optimal approximations of the frequency moments of data streams Proceedings of the Annual Acm Symposium On Theory of Computing. 202-208. DOI: 10.1145/1060590.1060621 |
1 | |||

2005 | Frahling G, Indyk P, Sohler C. Sampling in dynamic data streams and applications Proceedings of the Annual Symposium On Computational Geometry. 142-149. DOI: 10.1142/S0218195908002520 |
1 | |||

2005 | Guruswami V, Indyk P. Linear-time encodable/decodable codes with near-optimal rate Ieee Transactions On Information Theory. 51: 3393-3400. DOI: 10.1109/Tit.2005.855587 |
1 | |||

2005 | Bǎdoiu M, Chuzhoy J, Indyk P, Sidiropoulos A. Low-distortion embeddings of general metrics into the line Proceedings of the Annual Acm Symposium On Theory of Computing. 225-233. |
1 | |||

2005 | Bǎdoiu M, Czumaj A, Indyk P, Sohler C. Facility Location in sublinear time Lecture Notes in Computer Science. 3580: 866-877. |
1 | |||

2005 | Azar Y, Buchsbaum A, Chazelle B, Cole R, Fleischer L, Golin M, Goodrich M, Grossi R, Guha S, Halldorsson MM, Indyk P, Italiano GF, Kaplan H, Myrvold W, Pruhs K, et al. Proceeding of the Annual ACM-SIAM Symposium on Discrete Algorithms: Preface Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. xiii. |
1 | |||

2004 | Indyk P. Algorithms for dynamic geometric problems over data streams Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 373-380. |
1 | |||

2004 | Indyk P. Approximate Nearest Neighbor under Edit Distance via Product Metrics Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 639-643. |
1 | |||

2004 | Indyk P. Streaming algorithms for geometric problems |
1 | |||

2004 | Guruswami V, Indyk P. Efficiently Decodable Codes Meeting Gilbert-Varshamov Bound for Low Rates Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 749-750. |
1 | |||

2004 | Bǎdoiu M, Indyk P. Fast Approximate Pattern Matching with Few Indels via Embeddings Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 644-645. |
1 | |||

2004 | Guruswami V, Indyk P. Linear-time list decoding in error-free settings (extended abstract) |
1 | |||

2004 | Indyk P, Lewenstein M, Lipsky O, Porat E. Closest pair problems in very high dimensions |
1 | |||

2004 | Datar M, Indyk P, Immorlica N, Mirrokni VS. Locality-sensitive hashing scheme based on p-stable distributions Proceedings of the Annual Symposium On Computational Geometry. 253-262. |
1 | |||

2003 | Basch J, Devarajan H, Indyk P, Zhang L. Probabilistic analysis for discrete attributes of moving points International Journal of Computational Geometry and Applications. 13: 5-22. DOI: 10.1142/S0218195903001050 |
1 | |||

2003 | Cormode G, Datar M, Indyk P, Muthukrishnan S. Comparing data streams using Hamming norms (how to zero in) Ieee Transactions On Knowledge and Data Engineering. 15: 529-540. DOI: 10.1109/Tkde.2003.1198388 |
1 | |||

2003 | Indyk P, Woodruff D. Tight lower bounds for the distinct elements problem Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2003: 283-288. DOI: 10.1109/SFCS.2003.1238202 |
1 | |||

2003 | Indyk P, Venkatasubramanian S. Approximate congruence in nearly linear time Computational Geometry: Theory and Applications. 24: 115-128. DOI: 10.1016/S0925-7721(02)00095-0 |
1 | |||

2003 | Gavrilov M, Indyk P, Motwani R, Venkatasubramanian S. Combinatorial and experimental methods for approximate point pattern matching Algorithmica (New York). 38: 59-90. DOI: 10.1007/S00453-003-1043-4 |
1 | |||

2003 | Indyk P. Better algorithms for high-dimensional proximity problems via asymmetric embeddings Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 539-545. |
1 | |||

2003 | Guruswami V, Indyk P. Embeddings and non-approximability of geometric problems Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 537-538. |
1 | |||

2003 | Guruswami V, Indyk P. Linear time encodable and list decodable codes Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 126-135. |
1 | |||

2003 | Andoni A, Deza M, Gupta A, Indyk P, Raskhodnikova S. Lower bounds for embedding edit distance into normed spaces Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 523-526. |
1 | |||

2002 | Haveliwala TH, Gionis A, Klein D, Indyk P. Evaluating strategies for similarity search on the web Proceedings of the 11th International Conference On World Wide Web, Www '02. 432-442. DOI: 10.1145/511446.511502 |
1 | |||

2002 | Datar M, Gionis A, Indyk P, Motwani R. Maintaining stream statistics over sliding windows Siam Journal On Computing. 31: 1794-1813. DOI: 10.1137/S0097539701398363 |
1 | |||

2002 | Indyk P. Approximate nearest neighbor algorithms for frechet distance via product metrics Proceedings of the Annual Symposium On Computational Geometry. 102-106. |
1 | |||

2002 | Indyk P. Explicit constructions of selectors and related combinatorial structures, with applications Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 6: 697-704. |
1 | |||

2002 | Guruswami V, Indyk P. Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 812-821. |
1 | |||

2002 | Bǎdoiu M, Har-Peled S, Indyk P. Approximate clustering via core-sets Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 250-257. |
1 | |||

2002 | Cormode G, Indyk P, Koudas N, Muthukrishnan S. Fast mining of massive tabular data via approximate distance computations Proceedings - International Conference On Data Engineering. 605-614. |
1 | |||

2002 | Thaper N, Guha S, Indyk P, Koudas N. Dynamic multidimensional histograms Proceedings of the Acm Sigmod International Conference On Management of Data. 428-439. |
1 | |||

2002 | Charikar M, Indyk P, Panigrahy R. New algorithms for subset query, partial match, orthogonal range searching, and related problems |
1 | |||

2002 | Engebretsen L, Indyk P, O'Donnell R. Derandomized dimensionality reduction with applications Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 6: 705-712. |
1 | |||

2002 | Gilbert AC, Guha S, Indyk P, Muthukrishnan S, Strauss M. Near-optimal sparse Fourier representations via sampling Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 152-161. |
1 | |||

2002 | Datar M, Gionis A, Indyk P, Motwani R. Maintaining stream statistics over sliding windows (extended abstract) Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 6: 635-644. |
1 | |||

2002 | Guha S, Indyk P, Muthukrishnan S, Strauss MJ. Histogramming data streams with fast per-item processing |
1 | |||

2002 | Gilbert AC, Guha S, Indyk P, Kotidis Y, Muthukrishnan S, Strauss MJ. Fast, small-space algorithms for approximate histogram maintenance Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 389-398. |
1 | |||

2001 | Indyk P. A Small Approximately Min-Wise Independent Family of Hash Functions Journal of Algorithms. 38: 84-90. DOI: doi:10.1006/jagm.2000.1131 |
1 | |||

2001 | Cohen E, Datar M, Fujiwara S, Gionis A, Indyk P, Motwani R, Ullman JD, Yang C. Finding interesting associations without support pruning Ieee Transactions On Knowledge and Data Engineering. 13: 64-78. DOI: 10.1109/69.908981 |
1 | |||

2001 | Bartal Y, Charikar M, Indyk P. On page migration and other relaxed task systems Theoretical Computer Science. 268: 43-66. DOI: 10.1016/S0304-3975(00)00259-0 |
1 | |||

2001 | Efrat A, Indyk P, Venkatasubramanian S. Pattern matching for sets of segments Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 295-304. DOI: 10.1007/s00453-004-1089-y |
1 | |||

2001 | Indyk P. On approximate nearest neighbors under I∞ norm Journal of Computer and System Sciences. 63: 627-638. DOI: 10.1006/Jcss.2001.1781 |
1 | |||

2001 | Indyk P. Algorithmic applications of low-distortion geometric embeddings Annual Symposium On Foundations of Computer Science - Proceedings. 10-33. |
1 | |||

2001 | Guruswami V, Indyk P. Expander-based constructions of efficiently decodable codes Annual Symposium On Foundations of Computer Science - Proceedings. 658-667. |
1 | |||

2001 | Goel A, Indyk P, Varadarajan K. Reductions among high dimensional proximity problems Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 769-778. |
1 | |||

2001 | Efrat A, Indyk P, Venkatasubramanian S. Pattern matching for sets of segments Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 295-304. |
1 | |||

2001 | Amir A, Efrat A, Indyk P, Samet H. Efficient regular data structures and algorithms for dilation, location, and proximity problems Algorithmica (New York). 30: 164-187. |
1 | |||

2000 | Indyk P, Koudas N, Muthukrishnan S. Identifying representative trends in massive time series data sets using sketches Proceedings of the 26th International Conference On Very Large Data Bases, Vldb'00. 363-372. |
1 | |||

2000 | Gavrilov M, Anguelov D, Indyk P, Motwani R. Mining the stock market: Which measure is best? Proceeding of the Sixth Acm Sigkdd International Conference On Knowledge Discovery and Data Mining. 487-496. |
1 | |||

1999 | Aingworth D, Chekuri C, Indyk P, Motwani R. Fast estimation of diameter and shortest paths (without matrix multiplication) Siam Journal On Computing. 28: 1167-1181. DOI: 10.1137/S0097539796303421 |
1 | |||

1998 | Chakrabarti S, Dom B, Indyk P. Enhanced hypertext categorization using hyperlinks Sigmod Record. 27: 307-318. |
1 | |||

1997 | Gasieniec L, Indyk P. Efficient parallel computing with memory faults |
1 | |||

1997 | Hegedűs T, Indyk P. On learning disjunctions of zero-one threshold functions with queries |
1 | |||

1997 | Gąsieniec L, Indyk P, Krysta P. External inverse pattern matching |
1 | |||

1996 | Indyk P. On word-level parallelism in fault-tolerant computing |
1 | |||

1996 | Chlebus BS, Gambin A, Indyk P. Shared-memory simulations on a faulty-memory DMM |
1 | |||

1995 | Indyk P. Optimal simulation of automata by neural nets |
1 | |||

Show low-probability matches. |