A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks. - Maxim A. Babenko; Ignat I. Kolesnichenko; Ilya P. Razenshteyn (SOFSEM, 2010)

Triangle-Free 2-Matchings Revisited. - Maxim A. Babenko; Alexey Gusakov; Ilya P. Razenshteyn (Discret. Math. Algorithms Appl., 2010)

Graph Partitioning with Natural Cuts. - Daniel Delling; Andrew V. Goldberg; Ilya P. Razenshteyn; Renato Fonseca F. Werneck (IPDPS, 2011)

Common information revisited - Ilya P. Razenshteyn (CoRR, 2011)

Not every domain of a plain decompressor contains the domain of a prefix-free one. - Mikhail Andreev; Ilya P. Razenshteyn; Alexander Shen 001 (Theor. Comput. Sci., 2011)

Exact Combinatorial Branch-and-Bound for Graph Bisection. - Daniel Delling; Andrew V. Goldberg; Ilya P. Razenshteyn; Renato Fonseca F. Werneck (ALENEX, 2012)

On Epsilon-Nets, Distance Oracles, and Metric Embeddings - Ilya P. Razenshteyn (CoRR, 2012)

On Model-Based RIP-1 Matrices. - Piotr Indyk; Ilya P. Razenshteyn (ICALP (1), 2013)

Separating Hierarchical and General Hub Labelings. - Andrew V. Goldberg; Ilya P. Razenshteyn; Ruslan Savchenko (MFCS, 2013)

Beyond Locality-Sensitive Hashing. - Alexandr Andoni; Piotr Indyk; Huy L. Nguyen; Ilya P. Razenshteyn (SODA, 2014)

Robust Hierarchical k-Center Clustering. - Silvio Lattanzi; Stefano Leonardi 001; Vahab S. Mirrokni; Ilya P. Razenshteyn (ITCS, 2015)

Practical and Optimal LSH for Angular Distance. - Alexandr Andoni; Piotr Indyk; Thijs Laarhoven; Ilya P. Razenshteyn; Ludwig Schmidt (NIPS, 2015)

Optimal Data-Dependent Hashing for Approximate Near Neighbors. - Alexandr Andoni; Ilya P. Razenshteyn (STOC, 2015)

Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching. - Arturs Backurs; Piotr Indyk; Eric Price 001; Ilya P. Razenshteyn; David P. Woodruff (CoRR, 2015)

An exact combinatorial algorithm for minimum graph bisection. - Daniel Delling; Daniel Fleischman; Andrew V. Goldberg; Ilya P. Razenshteyn; Renato F. Werneck (Math. Program., 2015)

Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing. - Alexandr Andoni; Ilya P. Razenshteyn (SoCG, 2016)

On the Complexity of Inner Product Similarity Join. - Thomas Dybdahl Ahle; Rasmus Pagh; Ilya P. Razenshteyn; Francesco Silvestri 001 (PODS, 2016)

Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching. - Arturs Backurs; Piotr Indyk; Ilya P. Razenshteyn; David P. Woodruff (SODA, 2016)

Weighted low rank approximations with provable guarantees. - Ilya P. Razenshteyn; Zhao Song 002; David P. Woodruff (STOC, 2016)

Lower Bounds on Time-Space Trade-Offs for Approximate Near Neighbors. - Alexandr Andoni; Thijs Laarhoven; Ilya P. Razenshteyn; Erik Waingarten (CoRR, 2016)

Approximate Near Neighbors for General Symmetric Norms. - Alexandr Andoni; Aleksandar Nikolov; Ilya P. Razenshteyn; Erik Waingarten (CoRR, 2016)

Restricted Isometry Property for General p-Norms. - Zeyuan Allen Zhu; Rati Gelashvili; Ilya P. Razenshteyn (IEEE Trans. Inf. Theory, 2016)

Practical Data-Dependent Metric Compression with Provable Guarantees. - Piotr Indyk; Ilya P. Razenshteyn; Tal Wagner (NIPS, 2017)

Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. - Alexandr Andoni; Thijs Laarhoven; Ilya P. Razenshteyn; Erik Waingarten (SODA, 2017)

LSH Forest: Practical Algorithms Made Theoretical. - Alexandr Andoni; Ilya P. Razenshteyn; Negev Shekel Nosatzki (SODA, 2017)

Approximate near neighbors for general symmetric norms. - Alexandr Andoni; Huy L. Nguyen; Aleksandar Nikolov; Ilya P. Razenshteyn; Erik Waingarten (STOC, 2017)

High-dimensional similarity search and sketching: algorithms and hardness. - Ilya P. Razenshteyn (2017)

Hölder Homeomorphisms and Approximate Nearest Neighbors. - Alexandr Andoni; Assaf Naor; Aleksandar Nikolov; Ilya P. Razenshteyn; Erik Waingarten (FOCS, 2018)

Data-dependent hashing via nonlinear spectral gaps. - Alexandr Andoni; Assaf Naor; Aleksandar Nikolov; Ilya P. Razenshteyn; Erik Waingarten (STOC, 2018)

Nonlinear dimension reduction via outer Bi-Lipschitz extensions. - Sepideh Mahabadi; Konstantin Makarychev; Yury Makarychev; Ilya P. Razenshteyn (STOC, 2018)

Adversarial examples from computational constraints. - Sébastien Bubeck; Eric Price 001; Ilya P. Razenshteyn (CoRR, 2018)

Approximate Nearest Neighbor Search in High Dimensions. - Alexandr Andoni; Piotr Indyk; Ilya P. Razenshteyn (CoRR, 2018)

Adversarial Examples from Cryptographic Pseudo-Random Generators. - Sébastien Bubeck; Yin Tat Lee; Eric Price 001; Ilya P. Razenshteyn (CoRR, 2018)

Sketching and Embedding are Equivalent for Norms. - Alexandr Andoni; Robert Krauthgamer; Ilya P. Razenshteyn (SIAM J. Comput., 2018)

On Mean Estimation for General Norms with Statistical Queries. - Jerry Li 001; Aleksandar Nikolov; Ilya P. Razenshteyn; Erik Waingarten (COLT, 2019)

Adversarial examples from computational constraints. - Sébastien Bubeck; Yin Tat Lee; Eric Price 001; Ilya P. Razenshteyn (ICML, 2019)

Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers. - Hadi Salman; Jerry Li 001; Ilya P. Razenshteyn; Pengchuan Zhang; Huan Zhang; Sébastien Bubeck; Greg Yang (NeurIPS, 2019)

Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering. - Konstantin Makarychev; Yury Makarychev; Ilya P. Razenshteyn (STOC, 2019)

Learning Sublinear-Time Indexing for Nearest Neighbor Search. - Yihe Dong; Piotr Indyk; Ilya P. Razenshteyn; Tal Wagner (CoRR, 2019)

Scalable Nearest Neighbor Search for Optimal Transport. - Yihe Dong; Piotr Indyk; Ilya P. Razenshteyn; Tal Wagner (CoRR, 2019)

SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search. - Hao Chen 030; Ilaria Chillotti; Yihe Dong; Oxana Poburinnaya; Ilya P. Razenshteyn; M. Sadegh Riazi (IACR Cryptol. ePrint Arch., 2019)

Performance of Johnson-Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering. - Konstantin Makarychev; Yury Makarychev; Ilya P. Razenshteyn (SIAM J. Comput., 2019)

Scaling up Kernel Ridge Regression via Locality Sensitive Hashing. - Amir Zandieh; Navid Nouri; Ameya Velingker; Michael Kapralov; Ilya P. Razenshteyn (AISTATS, 2020)

Scalable Nearest Neighbor Search for Optimal Transport. - Arturs Backurs; Yihe Dong; Piotr Indyk; Ilya P. Razenshteyn; Tal Wagner (ICML, 2020)

Randomized Smoothing of All Shapes and Sizes. - Greg Yang; Tony Duan; J. Edward Hu; Hadi Salman; Ilya P. Razenshteyn; Jerry Li 001 (ICML, 2020)

Non-adaptive adaptive sampling on turnstile streams. - Sepideh Mahabadi; Ilya P. Razenshteyn; David P. Woodruff; Samson Zhou (STOC, 2020)

A Study of Performance of Optimal Transport. - Yihe Dong; Yu Gao 001; Richard Peng; Ilya P. Razenshteyn; Saurabh Sawlani (CoRR, 2020)

Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning. - Hao Chen 030; Miran Kim; Ilya P. Razenshteyn; Dragos Rotaru; Yongsoo Song; Sameer Wagh (IACR Cryptol. ePrint Arch., 2020)

Approximate Nearest Neighbors Beyond Space Partitions. - Alexandr Andoni; Aleksandar Nikolov; Ilya P. Razenshteyn; Erik Waingarten (SODA, 2021)

Inductive Bias of Multi-Channel Linear Convolutional Networks with Bounded Weight Norm. - Meena Jagadeesan; Ilya P. Razenshteyn; Suriya Gunasekar (COLT, 2022)

Learning Space Partitions for Nearest Neighbor Search. - Yihe Dong; Piotr Indyk; Ilya P. Razenshteyn; Tal Wagner (IEEE Data Eng. Bull., 2023)