| Year |
Citation |
Score |
| 2019 |
Sidiropoulos A, Badoiu M, Dhamdhere K, Gupta A, Indyk P, Rabinovich Y, Racke H, Ravi R. Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces Siam Journal On Discrete Mathematics. 33: 454-473. DOI: 10.1137/17M1113527 |
0.466 |
|
| 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 |
0.444 |
|
| 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 |
0.439 |
|
| 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 |
0.484 |
|
| 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 |
0.413 |
|
| 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. |
0.324 |
|
| 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. |
0.304 |
|
| 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. |
0.344 |
|
| 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 |
0.377 |
|
| 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 |
0.356 |
|
| 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 |
0.367 |
|
| 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 |
0.314 |
|
| 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. |
0.393 |
|
| 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. |
0.392 |
|
| 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. |
0.403 |
|
| 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. |
0.357 |
|
| 2012 |
Har-Peled S, Indyk P, Motwani R. Theory of Computing. 8: 321-350. DOI: 10.4086/Toc.2012.V008A014 |
0.525 |
|
| 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 |
0.355 |
|
| 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 |
0.316 |
|
| 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 |
0.432 |
|
| 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 |
0.334 |
|
| 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 |
0.319 |
|
| 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 |
0.453 |
|
| 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 |
0.311 |
|
| 2010 |
Gilbert A, Indyk P. Sparse recovery using sparse matrices Proceedings of the Ieee. 98: 937-947. DOI: 10.1109/JPROC.2010.2045092 |
0.35 |
|
| 2010 |
Andoni A, Indyk P, Onak K, Rubinfeld R. Sublinear algorithms in the external memory model Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6390: 240-243. DOI: 10.1007/978-3-642-16367-8_15 |
0.418 |
|
| 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 |
0.374 |
|
| 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 |
0.398 |
|
| 2009 |
Amir A, Aumann Y, Indyk P, Levy A, Porat E. Efficient computations of ℓ1 and ℓ∞ rearrangement distances Theoretical Computer Science. 410: 4382-4390. DOI: 10.1016/J.Tcs.2009.07.019 |
0.41 |
|
| 2009 |
Andoni A, Indyk P, Onak K, Rubinfeld R. External sampling Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5555: 83-94. DOI: 10.1007/978-3-642-02927-1_9 |
0.42 |
|
| 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. |
0.342 |
|
| 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 |
0.439 |
|
| 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 |
0.34 |
|
| 2008 |
Guha S, Indyk P, McGregor A. Sketching information divergences Machine Learning. 72: 5-19. DOI: 10.1007/S10994-008-5054-X |
0.377 |
|
| 2007 |
Indyk P, Naor A. Nearest-neighbor-preserving embeddings Acm Transactions On Algorithms. 3. DOI: 10.1145/1273340.1273347 |
0.354 |
|
| 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. |
0.403 |
|
| 2007 |
Amir A, Aumann Y, Indyk P, Levy A, Porat E. Efficient computations of ℓ1 and ℓ∞ rearrangement distances Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4726: 39-49. |
0.311 |
|
| 2006 |
Indyk P. Stable distributions, pseudorandom generators, embeddings, and data stream computation Journal of the Acm. 53: 307-323. DOI: 10.1145/1147954.1147955 |
0.422 |
|
| 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 |
0.301 |
|
| 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 |
0.393 |
|
| 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. |
0.329 |
|
| 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 |
0.362 |
|
| 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 |
0.369 |
|
| 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. |
0.345 |
|
| 2005 |
Bǎdoiu M, Czumaj A, Indyk P, Sohler C. Facility Location in sublinear time Lecture Notes in Computer Science. 3580: 866-877. |
0.368 |
|
| 2004 |
Indyk P. Streaming algorithms for geometric problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3328: 32-34. |
0.386 |
|
| 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. |
0.509 |
|
| 2004 |
Indyk P. Algorithms for dynamic geometric problems over data streams Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 373-380. |
0.428 |
|
| 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 |
0.326 |
|
| 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 |
0.611 |
|
| 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 |
0.475 |
|
| 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 |
0.638 |
|
| 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. |
0.367 |
|
| 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 |
0.524 |
|
| 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 |
0.74 |
|
| 2002 |
Guha S, Indyk P, Muthukrishnan S, Strauss MJ. Histogramming data streams with fast per-item processing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2380: 681-692. |
0.401 |
|
| 2002 |
Indyk P. Approximate nearest neighbor algorithms for frechet distance via product metrics Proceedings of the Annual Symposium On Computational Geometry. 102-106. |
0.338 |
|
| 2002 |
Charikar M, Indyk P, Panigrahy R. New algorithms for subset query, partial match, orthogonal range searching, and related problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2380: 451-462. |
0.723 |
|
| 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. |
0.748 |
|
| 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. |
0.322 |
|
| 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 |
0.729 |
|
| 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 |
0.643 |
|
| 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 |
0.414 |
|
| 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 |
0.524 |
|
| 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. |
0.414 |
|
| 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. |
0.357 |
|
| 2001 |
Indyk P. Algorithmic applications of low-distortion geometric embeddings Annual Symposium On Foundations of Computer Science - Proceedings. 10-33. |
0.369 |
|
| 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. |
0.433 |
|
| 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 |
0.704 |
|
| 1997 |
Hegedűs T, Indyk P. On learning disjunctions of zero-one threshold functions with queries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1316: 446-460. DOI: 10.1007/3-540-63577-7_60 |
0.337 |
|
| 1997 |
Gąsieniec L, Indyk P, Krysta P. External inverse pattern matching Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1264: 90-101. |
0.369 |
|
| Show low-probability matches. |