Piotr Indyk

Citado por

	Total	Desde 2019
Citas	45010	14942
Índice h	85	50
Índice i10	200	158

3100

1550

775

2325

19992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024117 171 252 447 651 755 933 1045 1183 1338 1500 1784 1752 1897 2228 2402 2408 2709 3036 2850 2846 2733 2524 2369 2323 2137

Acceso público

Ver todo

41 artículos

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Alexandr AndoniAssociate Professor, Columbia UniversityDirección de correo verificada de mit.edu
Dina KatabiThuan and Nicole Pham Professor, MITDirección de correo verificada de ai.mit.edu
Ludwig SchmidtStanford University and AnthropicDirección de correo verificada de cs.washington.edu
Tal WagnerTel-Aviv University and AmazonDirección de correo verificada de mit.edu
David WoodruffProfessor of Computer Science, Carnegie Mellon UniversityDirección de correo verificada de cs.cmu.edu
Eric PriceAssociate Professor of Computer Science at the University of Texas at AustinDirección de correo verificada de cs.utexas.edu
Aristides GionisKTH Royal Institute of Technology, and Aalto UniversityDirección de correo verificada de kth.se
Mayur DatarFlipkartDirección de correo verificada de cs.stanford.edu
S MuthukrishnanRutgers UnivDirección de correo verificada de cs.rutgers.edu
Haitham HassaniehAssociate Professor, EPFLDirección de correo verificada de epfl.ch
Arturs BackursMicrosoft ResearchDirección de correo verificada de microsoft.com
Trevor DarrellProfessor of Computer Science, U.C. BerkeleyDirección de correo verificada de eecs.berkeley.edu
Greg ShakhnarovichProfessor, TTI-ChicagoDirección de correo verificada de ttic.edu
Ilya RazenshteynCipherMode LabsDirección de correo verificada de mit.edu
Vahab MirrokniGoogle Fellow, VP, Google ResearchDirección de correo verificada de google.com
Sepideh MahabadiMicrosoft ResearchDirección de correo verificada de ttic.edu
Chinmay HegdeNew York UniversityDirección de correo verificada de nyu.edu
Sudipto Guha`Dirección de correo verificada de zscaler.com
Ali VakilianToyota Technological Institute at Chicago (TTIC)Dirección de correo verificada de ttic.edu
Mihai BadoiuEdgestream Partners LPDirección de correo verificada de theory.csail.mit.edu

Seguir

Piotr Indyk

Professor of Electrical Engineering and Computer Science, MIT

Dirección de correo verificada de mit.edu - Página principal

Algorithms Computational Geometry Theoretical Computer Science


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
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	6232	1998
Similarity search in high dimensions via hashing A Gionis, P Indyk, R Motwani Vldb 99 (6), 518-529, 1999	4919	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	4015	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	3224	2008
Maintaining stream statistics over sliding windows M Datar, A Gionis, P Indyk, R Motwani SIAM journal on computing 31 (6), 1794-1813, 2002	1319	2002
Enhanced hypertext categorization using hyperlinks S Chakrabarti, B Dom, P Indyk Acm Sigmod Record 27 (2), 307-318, 1998	1215	1998
Nearest-neighbor methods for learning and vision: theory and practice editors G Shakhnarovich, T Darrell, P Indyk	1047*	2006
Stable distributions, pseudorandom generators, embeddings, and data stream computation P Indyk Journal of the ACM (JACM) 53 (3), 307-323, 2006	877	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	637	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	598	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	556	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	483	2008
Approximate nearest neighbor: Towards removing the curse of dimensionality S Har-Peled, P Indyk, R Motwani Theory of Computing Exchange, 2012	475	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	474	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	457	2015
Sparse recovery using sparse matrices A Gilbert, P Indyk Proceedings of the IEEE 98 (6), 937-947, 2010	433	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	392	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	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	373	1999

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores