Ilya P. Razenshteyn
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
28
Venues
14
Active years
2010–2022
Best venue rank
A*
Where they publish
Papers
28 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2022 | COLT | Inductive Bias of Multi-Channel Linear Convolutional Networks with Bounded Weight Norm. | Meena Jagadeesan, Ilya P. Razenshteyn, Suriya Gunasekar |
| 2021 | SODA | Approximate Nearest Neighbors Beyond Space Partitions. | Alexandr Andoni, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten |
| 2020 | AISTATS | Scaling up Kernel Ridge Regression via Locality Sensitive Hashing. | Amir Zandieh, Navid Nouri, Ameya Velingker, Michael Kapralov, Ilya P. Razenshteyn |
| 2020 | ASIACRYPT | Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning. | Hao Chen, Miran Kim, Ilya P. Razenshteyn, Dragos Rotaru, Yongsoo Song, Sameer Wagh |
| 2020 | ICLR | Learning Space Partitions for Nearest Neighbor Search. | Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner |
| 2020 | ICML | Scalable Nearest Neighbor Search for Optimal Transport. | Arturs Backurs, Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner |
| 2020 | ICML | Randomized Smoothing of All Shapes and Sizes. | Greg Yang, Tony Duan, J. Edward Hu, Hadi Salman, Ilya P. Razenshteyn, Jerry Li |
| 2020 | STOC | Non-adaptive adaptive sampling on turnstile streams. | Sepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, Samson Zhou |
| 2019 | COLT | On Mean Estimation for General Norms with Statistical Queries. | Jerry Li, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten |
| 2019 | ICML | Adversarial examples from computational constraints. | Sbastien Bubeck, Yin Tat Lee, Eric Price, Ilya P. Razenshteyn |
| 2019 | STOC | Performance of Johnson-Lindenstrauss transform for | Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn |
| 2018 | FOCS | Hlder Homeomorphisms and Approximate Nearest Neighbors. | Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten |
| 2018 | STOC | Data-dependent hashing via nonlinear spectral gaps. | Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten |
| 2018 | STOC | Nonlinear dimension reduction via outer Bi-Lipschitz extensions. | Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn |
| 2017 | SODA | Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. | Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten |
| 2017 | SODA | LSH Forest: Practical Algorithms Made Theoretical. | Alexandr Andoni, Ilya P. Razenshteyn, Negev Shekel Nosatzki |
| 2017 | STOC | Approximate near neighbors for general symmetric norms. | Alexandr Andoni, Huy L. Nguyen, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten |
| 2016 | PODS | On the Complexity of Inner Product Similarity Join. | Thomas Dybdahl Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri |
| 2016 | SODA | Nearly-optimal bounds for sparse recovery in generic norms, with applications to | Arturs Backurs, Piotr Indyk, Ilya P. Razenshteyn, David P. Woodruff |
| 2016 | STOC | Weighted low rank approximations with provable guarantees. | Ilya P. Razenshteyn, Zhao Song, David P. Woodruff |
| 2015 | STOC | Sketching and Embedding are Equivalent for Norms. | Alexandr Andoni, Robert Krauthgamer, Ilya P. Razenshteyn |
| 2015 | STOC | Optimal Data-Dependent Hashing for Approximate Near Neighbors. | Alexandr Andoni, Ilya P. Razenshteyn |
| 2014 | SODA | Beyond Locality-Sensitive Hashing. | Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, Ilya P. Razenshteyn |
| 2013 | ICALP | On Model-Based RIP-1 Matrices. | Piotr Indyk, Ilya P. Razenshteyn |
| 2013 | MFCS | Separating Hierarchical and General Hub Labelings. | Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko |
| 2012 | ALENEX | Exact Combinatorial Branch-and-Bound for Graph Bisection. | Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck |
| 2010 | COCOON | Triangle-Free 2-Matchings Revisited. | Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn |
| 2010 | SOFSEM | A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks. | Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn |