Piotr Indyk

Citirano

	Sve	Od 2020.
Citati	45373	12462
H-indeks	85	45
i10-indeks	200	143

3100

1550

775

2325

199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025118 171 255 449 651 742 939 1054 1179 1340 1487 1805 1745 1896 2233 2391 2405 2716 3035 2862 2850 2694 2499 2334 2343 2257 332

Javni pristup

Prikaži sve

41 članak

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Alexandr AndoniAssociate Professor, Columbia UniversityPotvrđena adresa e-pošte na mit.edu
Dina KatabiThuan and Nicole Pham Professor, MITPotvrđena adresa e-pošte na ai.mit.edu
Ludwig SchmidtStanford University and AnthropicPotvrđena adresa e-pošte na stanford.edu
Tal WagnerTel-Aviv University and AmazonPotvrđena adresa e-pošte na mit.edu
David WoodruffProfessor of Computer Science, Carnegie Mellon UniversityPotvrđena adresa e-pošte na cs.cmu.edu
Eric PriceAssociate Professor of Computer Science at the University of Texas at AustinPotvrđena adresa e-pošte na cs.utexas.edu
Aristides GionisKTH Royal Institute of Technology, and Aalto UniversityPotvrđena adresa e-pošte na kth.se
Mayur DatarFlipkartPotvrđena adresa e-pošte na cs.stanford.edu
S MuthukrishnanRutgers UnivPotvrđena adresa e-pošte na cs.rutgers.edu
Haitham HassaniehAssociate Professor, EPFLPotvrđena adresa e-pošte na epfl.ch
Arturs BackursMicrosoft ResearchPotvrđena adresa e-pošte na microsoft.com
Ilya RazenshteynCipherMode LabsPotvrđena adresa e-pošte na mit.edu
Trevor DarrellProfessor of Computer Science, U.C. BerkeleyPotvrđena adresa e-pošte na eecs.berkeley.edu
Greg ShakhnarovichProfessor, TTI-ChicagoPotvrđena adresa e-pošte na ttic.edu
Vahab MirrokniGoogle Fellow, VP, Google ResearchPotvrđena adresa e-pošte na google.com
Sudipto Guha`Potvrđena adresa e-pošte na zscaler.com
Chinmay HegdeNew York UniversityPotvrđena adresa e-pošte na nyu.edu
Sepideh MahabadiMicrosoft ResearchPotvrđena adresa e-pošte na ttic.edu
Ali VakilianToyota Technological Institute at Chicago (TTIC)Potvrđena adresa e-pošte na ttic.edu
Mihai BadoiuEdgestream Partners LPPotvrđena adresa e-pošte na theory.csail.mit.edu

Prati

Piotr Indyk

Professor of Electrical Engineering and Computer Science, MIT

Potvrđena adresa e-pošte na mit.edu - Početna stranica

Algorithms Computational Geometry Theoretical Computer Science


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
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	6284	1998
Similarity search in high dimensions via hashing A Gionis, P Indyk, R Motwani Vldb 99 (6), 518-529, 1999	4928	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	4041	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	3251	2008
Maintaining stream statistics over sliding windows M Datar, A Gionis, P Indyk, R Motwani SIAM journal on computing 31 (6), 1794-1813, 2002	1323	2002
Enhanced hypertext categorization using hyperlinks S Chakrabarti, B Dom, P Indyk Acm Sigmod Record 27 (2), 307-318, 1998	1208	1998
Nearest-neighbor methods for learning and vision: theory and practice editors G Shakhnarovich, T Darrell, P Indyk	1042*	2006
Stable distributions, pseudorandom generators, embeddings, and data stream computation P Indyk Journal of the ACM (JACM) 53 (3), 307-323, 2006	880	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	633	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	616	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	563	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	482	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	472	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	459	2015
Sparse recovery using sparse matrices A Gilbert, P Indyk Proceedings of the IEEE 98 (6), 937-947, 2010	439	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	389	2002
Algorithmic applications of low-distortion geometric embeddings P Indyk Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 10-33, 2001	385	2001
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

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori