| Approximate nearest neighbors: towards removing the curse of dimensionality P Indyk, R Motwani Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998 | 6285 | 1998 |
| Similarity search in high dimensions via hashing A Gionis, P Indyk, R Motwani Vldb 99 (6), 518-529, 1999 | 4944 | 1999 |
| Locality-sensitive hashing scheme based on p-stable distributions M Datar, N Immorlica, P Indyk, VS Mirrokni Proceedings of the twentieth annual symposium on Computational geometry, 253-262, 2004 | 4043 | 2004 |
| Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions A Andoni, P Indyk Communications of the ACM 51 (1), 117-122, 2008 | 3255 | 2008 |
| Maintaining stream statistics over sliding windows M Datar, A Gionis, P Indyk, R Motwani SIAM journal on computing 31 (6), 1794-1813, 2002 | 1324 | 2002 |
| Enhanced hypertext categorization using hyperlinks S Chakrabarti, B Dom, P Indyk Acm Sigmod Record 27 (2), 307-318, 1998 | 1216 | 1998 |
| Nearest-neighbor methods for learning and vision: theory and practice editors G Shakhnarovich, T Darrell, P Indyk | 1050* | 2006 |
| Stable distributions, pseudorandom generators, embeddings, and data stream computation P Indyk Journal of the ACM (JACM) 53 (3), 307-323, 2006 | 879 | 2006 |
| Finding interesting associations without support pruning E Cohen, M Datar, S Fujiwara, A Gionis, P Indyk, R Motwani, JD Ullman, ... IEEE Transactions on Knowledge and Data Engineering 13 (1), 64-78, 2001 | 638 | 2001 |
| Practical and optimal LSH for angular distance A Andoni, P Indyk, T Laarhoven, I Razenshteyn, L Schmidt Advances in neural information processing systems 28, 2015 | 615 | 2015 |
| Approximate clustering via core-sets M Bādoiu, S Har-Peled, P Indyk Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 559 | 2002 |
| Combining geometry and combinatorics: A unified approach to sparse signal recovery R Berinde, AC Gilbert, P Indyk, H Karloff, MJ Strauss 2008 46th Annual Allerton Conference on Communication, Control, and …, 2008 | 485 | 2008 |
| Approximate nearest neighbor: Towards removing the curse of dimensionality S Har-Peled, P Indyk, R Motwani Theory of Computing Exchange, 2012 | 483 | 2012 |
| Simple and practical algorithm for sparse Fourier transform H Hassanieh, P Indyk, D Katabi, E Price Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 475 | 2012 |
| Edit distance cannot be computed in strongly subquadratic time (unless SETH is false) A Backurs, P Indyk Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 460 | 2015 |
| Sparse recovery using sparse matrices A Gilbert, P Indyk Proceedings of the IEEE 98 (6), 937-947, 2010 | 436 | 2010 |
| Nearly optimal sparse Fourier transform H Hassanieh, P Indyk, D Katabi, E Price Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 393 | 2012 |
| Fast, small-space algorithms for approximate histogram maintenance AC Gilbert, S Guha, P Indyk, Y Kotidis, S Muthukrishnan, MJ Strauss Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 386 | 2002 |
| Near-optimal sparse Fourier representations via sampling AC Gilbert, S Guha, P Indyk, S Muthukrishnan, M Strauss Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 376 | 2002 |
| Fast estimation of diameter and shortest paths (without matrix multiplication) D Aingworth, C Chekuri, P Indyk, R Motwani SIAM Journal on Computing 28 (4), 1167-1181, 1999 | 376 | 1999 |
Alexandr AndoniAssociate Professor, Columbia University確認したメール アドレス: mit.edu
