Ilya Razenshteyn

Citado por

	Total	Desde 2019
Citas	4201	3266
Índice h	28	25
Índice i10	40	36

620

310

155

465

201220132014201520162017201820192020202120222023202415 26 45 94 145 267 295 379 496 617 619 557 587

Acceso público

Ver todo

13 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
Piotr IndykProfessor of Electrical Engineering and Computer Science, MITDirección de correo verificada de mit.edu
Erik WaingartenUniversity of PennsylvaniaDirección de correo verificada de cs.columbia.edu
Sebastien BubeckOpenAIDirección de correo verificada de openai.com
Andrew V. GoldbergSenior Principal Scientist, Amazon.com, Inc.Dirección de correo verificada de alum.mit.edu
Yihe DongPrinceton UniversityDirección de correo verificada de princeton.edu
Jerry LiUniversity of WashingtonDirección de correo verificada de cs.washington.edu
Thijs LaarhovenNXP SemiconductorsDirección de correo verificada de thijs.com
Daniel DellingGoogleDirección de correo verificada de google.com
Renato WerneckAmazonDirección de correo verificada de cs.princeton.edu
Tal WagnerTel-Aviv University and AmazonDirección de correo verificada de mit.edu
Hadi SalmanOpenAI, MITDirección de correo verificada de mit.edu
Greg YangxAIDirección de correo verificada de x.ai
Aleksandar NikolovUniversity of TorontoDirección de correo verificada de cs.toronto.edu
Huy L NguyễnNortheastern UniversityDirección de correo verificada de cs.princeton.edu
Eric PriceAssociate Professor of Computer Science at the University of Texas at AustinDirección de correo verificada de cs.utexas.edu
Yin Tat LeePaul G. Allen School of Computer Science & Engineering, University of WashingtonDirección de correo verificada de uw.edu
Huan ZhangAssistant Professor at University of Illinois Urbana-ChampaignDirección de correo verificada de illinois.edu
David WoodruffProfessor of Computer Science, Carnegie Mellon UniversityDirección de correo verificada de cs.cmu.edu
Konstantin MakarychevNorthwestern UniversityDirección de correo verificada de northwestern.edu

Seguir

Ilya Razenshteyn

CipherMode Labs

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

Algorithms


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
Provably robust deep learning via adversarially trained smoothed classifiers H Salman, J Li, I Razenshteyn, P Zhang, H Zhang, S Bubeck, G Yang Advances in neural information processing systems 32, 2019	605	2019
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	601	2015
Optimal data-dependent hashing for approximate near neighbors A Andoni, I Razenshteyn Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015	359	2015
Beyond locality-sensitive hashing A Andoni, P Indyk, HL Nguyễn, I Razenshteyn Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014	263	2014
Adversarial examples from computational constraints S Bubeck, YT Lee, E Price, I Razenshteyn International Conference on Machine Learning, 831-840, 2019	253	2019
Randomized smoothing of all shapes and sizes G Yang, T Duan, JE Hu, H Salman, I Razenshteyn, J Li International Conference on Machine Learning, 10693-10705, 2020	226	2020
Graph partitioning with natural cuts D Delling, AV Goldberg, I Razenshteyn, RF Werneck 2011 IEEE International Parallel & Distributed Processing Symposium, 1135-1146, 2011	175	2011
Approximate nearest neighbor search in high dimensions A Andoni, P Indyk, I Razenshteyn Proceedings of the International Congress of Mathematicians: Rio de Janeiro …, 2018	165	2018
Optimal hashing-based time-space trade-offs for approximate near neighbors A Andoni, T Laarhoven, I Razenshteyn, E Waingarten Proceedings of the twenty-eighth annual ACM-SIAM symposium on discrete …, 2017	164	2017
Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering K Makarychev, Y Makarychev, I Razenshteyn Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019	146	2019
Learning space partitions for nearest neighbor search Y Dong, P Indyk, I Razenshteyn, T Wagner arXiv preprint arXiv:1901.08544, 2019	106	2019
Weighted low rank approximations with provable guarantees I Razenshteyn, Z Song, DP Woodruff Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016	102	2016
Scalable nearest neighbor search for optimal transport A Backurs, Y Dong, P Indyk, I Razenshteyn, T Wagner International Conference on machine learning, 497-506, 2020	72	2020
Maliciously secure matrix multiplication with applications to private deep learning H Chen, M Kim, I Razenshteyn, D Rotaru, Y Song, S Wagh Advances in Cryptology–ASIACRYPT 2020: 26th International Conference on the …, 2020	72	2020
{SANNS}: Scaling up secure approximate {k-Nearest} neighbors search H Chen, I Chillotti, Y Dong, O Poburinnaya, I Razenshteyn, MS Riazi 29th USENIX Security Symposium (USENIX Security 20), 2111-2128, 2020	72	2020
Tight lower bounds for data-dependent locality-sensitive hashing A Andoni, I Razenshteyn arXiv preprint arXiv:1507.04299, 2015	58	2015
Sketching and embedding are equivalent for norms A Andoni, R Krauthgamer, I Razenshteyn Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015	54	2015
Lsh forest: Practical algorithms made theoretical A Andoni, I Razenshteyn, NS Nosatzki Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	51	2017
On the complexity of inner product similarity join TD Ahle, R Pagh, I Razenshteyn, F Silvestri Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016	48	2016
Exact combinatorial branch-and-bound for graph bisection D Delling, AV Goldberg, I Razenshteyn, RF Werneck 2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and …, 2012	48	2012

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