Piotr Indyk

Citado por

	Todos	Desde 2019
Citações	44533	14506
Índice h	85	50
Índice i10	200	157

3100

1550

775

2325

19992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024117 171 253 447 649 754 932 1043 1183 1338 1501 1780 1755 1895 2225 2402 2405 2711 3035 2847 2847 2727 2506 2365 2301 1751

Acesso público

Ver tudo

41 artigos

0 artigos

disponível

não disponível

Com base em autorizações de financiamento

Coautores

Alexandr AndoniAssociate Professor, Columbia UniversityEmail confirmado em mit.edu
Dina KatabiThuan and Nicole Pham Professor, MITEmail confirmado em ai.mit.edu
Ludwig SchmidtStanford University and AnthropicEmail confirmado em cs.washington.edu
Tal WagnerAmazonEmail confirmado em mit.edu
David WoodruffProfessor of Computer Science, Carnegie Mellon UniversityEmail confirmado em cs.cmu.edu
Eric PriceAssociate Professor of Computer Science at the University of Texas at AustinEmail confirmado em cs.utexas.edu
Aristides GionisKTH Royal Institute of Technology, and Aalto UniversityEmail confirmado em kth.se
Mayur DatarFlipkartEmail confirmado em cs.stanford.edu
S MuthukrishnanRutgers UnivEmail confirmado em cs.rutgers.edu
Haitham HassaniehAssociate Professor, EPFLEmail confirmado em epfl.ch
Arturs BackursMicrosoft ResearchEmail confirmado em microsoft.com
Trevor DarrellProfessor of Computer Science, U.C. BerkeleyEmail confirmado em eecs.berkeley.edu
Greg ShakhnarovichProfessor, TTI-ChicagoEmail confirmado em ttic.edu
Vahab MirrokniGoogle Fellow, VP, Google ResearchEmail confirmado em google.com
Ilya RazenshteynCipherMode LabsEmail confirmado em mit.edu
Sepideh MahabadiMicrosoft ResearchEmail confirmado em ttic.edu
Chinmay HegdeNew York UniversityEmail confirmado em nyu.edu
Sudipto Guha`Email confirmado em zscaler.com
Ali VakilianToyota Technological Institute at Chicago (TTIC)Email confirmado em ttic.edu
Mihai BadoiuEdgestream Partners LPEmail confirmado em theory.csail.mit.edu

Seguir

Piotr Indyk

Professor of Electrical Engineering and Computer Science, MIT

Email confirmado em mit.edu - Página inicial

Algorithms Computational Geometry Theoretical Computer Science


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
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	6165	1998
Similarity search in high dimensions via hashing A Gionis, P Indyk, R Motwani Vldb 99 (6), 518-529, 1999	4877	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	3967	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	3203	2008
Maintaining stream statistics over sliding windows M Datar, A Gionis, P Indyk, R Motwani SIAM journal on computing 31 (6), 1794-1813, 2002	1309	2002
Enhanced hypertext categorization using hyperlinks S Chakrabarti, B Dom, P Indyk Acm Sigmod Record 27 (2), 307-318, 1998	1214	1998
Nearest-neighbor methods for learning and vision: theory and practice editors G Shakhnarovich, T Darrell, P Indyk	1036*	2006
Stable distributions, pseudorandom generators, embeddings, and data stream computation P Indyk Journal of the ACM (JACM) 53 (3), 307-323, 2006	872	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	636	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	576	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	549	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	482	2008
Approximate nearest neighbor: Towards removing the curse of dimensionality S Har-Peled, P Indyk, R Motwani Theory of Computing Exchange, 2012	468	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	467	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	449	2015
Sparse recovery using sparse matrices A Gilbert, P Indyk Proceedings of the IEEE 98 (6), 937-947, 2010	432	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	389	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	385	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	375	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	369	1999

O sistema não pode efectuar a operação agora. Tente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações unidas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores