Ilya Razenshteyn

2.0k total citations
25 papers, 469 citations indexed

About

Ilya Razenshteyn is a scholar working on Computer Vision and Pattern Recognition, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Ilya Razenshteyn has authored 25 papers receiving a total of 469 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computer Vision and Pattern Recognition, 11 papers in Artificial Intelligence and 6 papers in Computer Networks and Communications. Recurrent topics in Ilya Razenshteyn's work include Advanced Image and Video Retrieval Techniques (12 papers), Robotics and Sensor-Based Localization (6 papers) and Machine Learning and Algorithms (5 papers). Ilya Razenshteyn is often cited by papers focused on Advanced Image and Video Retrieval Techniques (12 papers), Robotics and Sensor-Based Localization (6 papers) and Machine Learning and Algorithms (5 papers). Ilya Razenshteyn collaborates with scholars based in United States, Canada and Russia. Ilya Razenshteyn's co-authors include Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ludwig Schmidt, Daniel Delling, Renato F. Werneck, Andrew V. Goldberg, Yury Makarychev, Konstantin Makarychev and Hadi Salman and has published in prestigious journals such as Mathematical Programming, SIAM Journal on Computing and Discrete Mathematics Algorithms and Applications.

In The Last Decade

Ilya Razenshteyn

25 papers receiving 434 citations

Peers

Countries citing papers authored by Ilya Razenshteyn

Since Specialization

Citations

This map shows the geographic impact of Ilya Razenshteyn's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ilya Razenshteyn with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ilya Razenshteyn more than expected).

Fields of papers citing papers by Ilya Razenshteyn

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ilya Razenshteyn. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ilya Razenshteyn. The network helps show where Ilya Razenshteyn may publish in the future.

Co-authorship network of co-authors of Ilya Razenshteyn

This figure shows the co-authorship network connecting the top 25 collaborators of Ilya Razenshteyn. A scholar is included among the top collaborators of Ilya Razenshteyn based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ilya Razenshteyn. Ilya Razenshteyn is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering 2022 ·SIAM Journal on Computing ·Konstantin Makarychev, Yury Makarychev, Ilya Razenshteyn	1
2	Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers 2019 ·arXiv (Cornell University) ·Hadi Salman, (unknown), Ilya Razenshteyn, Pengchuan Zhang, Huan Zhang, Sébastien Bubeck, Greg Yang	29
3	Learning Space Partitions for Nearest Neighbor Search 2019 ·arXiv (Cornell University) ·Yihe Dong, Piotr Indyk, Ilya Razenshteyn, (unknown)	7
4	Learning Sublinear-Time Indexing for Nearest Neighbor Search. 2019 ·Yihe Dong, Piotr Indyk, Ilya Razenshteyn, (unknown)	2
5	Adversarial examples from computational constraints 2018 ·International Conference on Machine Learning ·Sébastien Bubeck, Eric Price, Ilya Razenshteyn	8
6	Approxiamate Nearest Neighbor Search in High Dimensions 2018 ·DSpace@MIT (Massachusetts Institute of Technology) ·Alexandr Andoni, Piotr Indyk, Ilya Razenshteyn	24
7	Hölder Homeomorphisms and Approximate Nearest Neighbors 2018 ·Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya Razenshteyn, (unknown)	8
8	Nonlinear dimension reduction via outer Bi-Lipschitz extensions 2018 ·Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya Razenshteyn	8
9	LSH forest: practical algorithms made theoretical 2017 ·Symposium on Discrete Algorithms ·Alexandr Andoni, Ilya Razenshteyn, (unknown)	5
10	Optimal hashing-based time-space trade-offs for approximate near neighbors 2017 ·arXiv (Cornell University) ·Alexandr Andoni, Thijs Laarhoven, Ilya Razenshteyn, (unknown)	17
11	LSH Forest: Practical Algorithms Made Theoretical 2017 ·Alexandr Andoni, Ilya Razenshteyn, (unknown)	9
12	Approximate near neighbors for general symmetric norms 2017 ·Alexandr Andoni, Huy L. Nguyên, Aleksandar Nikolov, Ilya Razenshteyn, (unknown)	9
13	Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching 2016 ·arXiv (Cornell University) ·Artūrs Bačkurs, Piotr Indyk, Ilya Razenshteyn, David P. Woodruff	1
14	Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing 2016 ·DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) ·Alexandr Andoni, Ilya Razenshteyn	3
15	Weighted low rank approximations with provable guarantees 2016 ·Ilya Razenshteyn, Zhao Song, David P. Woodruff	14
16	Practical and Optimal LSH for Angular Distance 2015 ·TU/e Research Portal ·Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya Razenshteyn, Ludwig Schmidt	113
17	Robust Hierarchical k-Center Clustering 2015 ·IRIS Research product catalog (Sapienza University of Rome) ·Silvio Lattanzi, Stefano Leonardi, Vahab Mirrokni, Ilya Razenshteyn	2
18	An exact combinatorial algorithm for minimum graph bisection 2014 ·Mathematical Programming ·Daniel Delling, (unknown), Andrew V. Goldberg, Ilya Razenshteyn, Renato F. Werneck	12
19	Graph Partitioning with Natural Cuts 2011 ·Daniel Delling, Andrew V. Goldberg, Ilya Razenshteyn, Renato F. Werneck	62
20	TRIANGLE-FREE 2-MATCHINGS REVISITED 2010 ·Discrete Mathematics Algorithms and Applications ·(unknown), (unknown), Ilya Razenshteyn	2

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact