Follow
Ilya Razenshteyn
Ilya Razenshteyn
Microsoft Research
Verified email at mit.edu - Homepage
Title
Cited by
Cited by
Year
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
4182015
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
3102019
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
2842015
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
2182014
Adversarial examples from computational constraints
S Bubeck, YT Lee, E Price, I Razenshteyn
International Conference on Machine Learning, 831-840, 2019
1862019
Graph partitioning with natural cuts
D Delling, AV Goldberg, I Razenshteyn, RF Werneck
2011 IEEE International Parallel & Distributed Processing Symposium, 1135-1146, 2011
1552011
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
1282017
Approximate nearest neighbor search in high dimensions
A Andoni, P Indyk, I Razenshteyn
Proceedings of the International Congress of Mathematicians: Rio de Janeiro …, 2018
972018
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
902020
Performance of Johnson--Lindenstrauss Transform for -Means and -Medians Clustering
K Makarychev, Y Makarychev, I Razenshteyn
SIAM Journal on Computing, STOC19-269-STOC19-297, 2022
802022
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
692016
Tight lower bounds for data-dependent locality-sensitive hashing
A Andoni, I Razenshteyn
arXiv preprint arXiv:1507.04299, 2015
562015
Learning space partitions for nearest neighbor search
Y Dong, P Indyk, I Razenshteyn, T Wagner
arXiv preprint arXiv:1901.08544, 2019
502019
Sketching and embedding are equivalent for norms
A Andoni, R Krauthgamer, I Razenshteyn
SIAM Journal on Computing 47 (3), 890-916, 2018
472018
Lsh forest: Practical algorithms made theoretical
A Andoni, I Razenshteyn, NS Nosatzki
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
452017
{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
442020
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
422012
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
412016
Adversarial examples from cryptographic pseudo-random generators
S Bubeck, YT Lee, E Price, I Razenshteyn
arXiv preprint arXiv:1811.06418, 2018
352018
Restricted isometry property for general p-norms
Z Allen-Zhu, R Gelashvili, I Razenshteyn
IEEE Transactions on Information Theory 62 (10), 5839-5854, 2016
352016
The system can't perform the operation now. Try again later.
Articles 1–20