Ilya P. Razenshteyn

79 papers A* 25A 4B 2Misc 1Journal 42Unranked 4

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	Learning Space Partitions for Nearest Neighbor Search. IEEE Data Eng. Bull. Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
2022	A*	`conf`	Inductive Bias of Multi-Channel Linear Convolutional Networks with Bounded Weight Norm. COLT Meena Jagadeesan, Ilya P. Razenshteyn, Suriya Gunasekar
2021	A*	`conf`	Approximate Nearest Neighbors Beyond Space Partitions. SODA Alexandr Andoni, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten
2021	J	`jnl`	Inductive Bias of Multi-Channel Linear Convolutional Networks with Bounded Weight Norm. CoRR Meena Jagadeesan, Ilya P. Razenshteyn, Suriya Gunasekar
2020	J	`jnl`	A Study of Performance of Optimal Transport. CoRR Yihe Dong, Yu Gao, Richard Peng, Ilya P. Razenshteyn, Saurabh Sawlani
2020	A*	`conf`	Learning Space Partitions for Nearest Neighbor Search. ICLR Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
2020	—	`conf`	Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning. ASIACRYPT (3) Hao Chen, Miran Kim, Ilya P. Razenshteyn, Dragos Rotaru, Yongsoo Song, Sameer Wagh
2020	J	`jnl`	Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning. IACR Cryptol. ePrint Arch. Hao Chen, Miran Kim, Ilya P. Razenshteyn, Dragos Rotaru, Yongsoo Song, Sameer Wagh
2020	J	`jnl`	Non-Adaptive Adaptive Sampling on Turnstile Streams. CoRR Sepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, Samson Zhou
2020	A*	`conf`	Non-adaptive adaptive sampling on turnstile streams. STOC Sepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, Samson Zhou
2020	A*	`conf`	Randomized Smoothing of All Shapes and Sizes. ICML Greg Yang, Tony Duan, J. Edward Hu, Hadi Salman, Ilya P. Razenshteyn, Jerry Li
2020	J	`jnl`	Randomized Smoothing of All Shapes and Sizes. CoRR Greg Yang, Tony Duan, J. Edward Hu, Hadi Salman, Ilya P. Razenshteyn, Jerry Li
2020	A*	`conf`	SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search. USENIX Security Symposium Hao Chen, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya, Ilya P. Razenshteyn, M. Sadegh Riazi
2020	A*	`conf`	Scalable Nearest Neighbor Search for Optimal Transport. ICML Arturs Backurs, Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
2020	A	`conf`	Scaling up Kernel Ridge Regression via Locality Sensitive Hashing. AISTATS Amir Zandieh, Navid Nouri, Ameya Velingker, Michael Kapralov, Ilya P. Razenshteyn
2020	J	`jnl`	Scaling up Kernel Ridge Regression via Locality Sensitive Hashing. CoRR Michael Kapralov, Navid Nouri, Ilya P. Razenshteyn, Ameya Velingker, Amir Zandieh
2019	A*	`conf`	Adversarial examples from computational constraints. ICML Sébastien Bubeck, Yin Tat Lee, Eric Price, Ilya P. Razenshteyn
2019	J	`jnl`	Learning Sublinear-Time Indexing for Nearest Neighbor Search. CoRR Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
2019	A*	`conf`	On Mean Estimation for General Norms with Statistical Queries. COLT Jerry Li, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten
2019	J	`jnl`	On Mean Estimation for General Norms with Statistical Queries. CoRR Jerry Li, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten
2019	J	`jnl`	Performance of Johnson-Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering. SIAM J. Comput. Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn
2019	A*	`conf`	Performance of Johnson-Lindenstrauss transform for STOC Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn
2019	A*	`conf`	Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers. NeurIPS Hadi Salman, Jerry Li, Ilya P. Razenshteyn, Pengchuan Zhang, Huan Zhang, Sébastien Bubeck, Greg Yang
2019	J	`jnl`	Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers. CoRR Hadi Salman, Greg Yang, Jerry Li, Pengchuan Zhang, Huan Zhang, Ilya P. Razenshteyn, Sébastien Bubeck
2019	J	`jnl`	SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search. CoRR Hao Chen, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya, Ilya P. Razenshteyn, M. Sadegh Riazi
2019	J	`jnl`	SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search. IACR Cryptol. ePrint Arch. Hao Chen, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya, Ilya P. Razenshteyn, M. Sadegh Riazi
2019	J	`jnl`	Scalable Nearest Neighbor Search for Optimal Transport. CoRR Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
2018	J	`jnl`	Adversarial Examples from Cryptographic Pseudo-Random Generators. CoRR Sébastien Bubeck, Yin Tat Lee, Eric Price, Ilya P. Razenshteyn
2018	J	`jnl`	Adversarial examples from computational constraints. CoRR Sébastien Bubeck, Eric Price, Ilya P. Razenshteyn
2018	J	`jnl`	Approximate Nearest Neighbor Search in High Dimensions. CoRR Alexandr Andoni, Piotr Indyk, Ilya P. Razenshteyn
2018	A*	`conf`	Data-dependent hashing via nonlinear spectral gaps. STOC Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten
2018	A*	`conf`	Hölder Homeomorphisms and Approximate Nearest Neighbors. FOCS Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten
2018	J	`jnl`	Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions. CoRR Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn
2018	A*	`conf`	Nonlinear dimension reduction via outer Bi-Lipschitz extensions. STOC Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn
2018	J	`jnl`	Performance of Johnson-Lindenstrauss Transform for k-Means and k-Medians Clustering. CoRR Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn
2018	J	`jnl`	Sketching and Embedding are Equivalent for Norms. SIAM J. Comput. Alexandr Andoni, Robert Krauthgamer, Ilya P. Razenshteyn
2017	A*	`conf`	Approximate near neighbors for general symmetric norms. STOC Alexandr Andoni, Huy L. Nguyen, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten
2017	—	`—`	High-dimensional similarity search and sketching: algorithms and hardness. Ilya P. Razenshteyn
2017	A*	`conf`	LSH Forest: Practical Algorithms Made Theoretical. SODA Alexandr Andoni, Ilya P. Razenshteyn, Negev Shekel Nosatzki
2017	A*	`conf`	Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. SODA Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten
2017	—	`conf`	Practical Data-Dependent Metric Compression with Provable Guarantees. NIPS Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
2017	J	`jnl`	Practical Data-Dependent Metric Compression with Provable Guarantees. CoRR Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner
2016	J	`jnl`	Approximate Near Neighbors for General Symmetric Norms. CoRR Alexandr Andoni, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten
2016	J	`jnl`	Lower Bounds on Time-Space Trade-Offs for Approximate Near Neighbors. CoRR Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten
2016	A*	`conf`	Nearly-optimal bounds for sparse recovery in generic norms, with applications to SODA Arturs Backurs, Piotr Indyk, Ilya P. Razenshteyn, David P. Woodruff
2016	A*	`conf`	On the Complexity of Inner Product Similarity Join. PODS Thomas Dybdahl Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri
2016	J	`jnl`	Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. CoRR Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten
2016	J	`jnl`	Restricted Isometry Property for General p-Norms. IEEE Trans. Inf. Theory Zeyuan Allen Zhu, Rati Gelashvili, Ilya P. Razenshteyn
2016	A*	`conf`	Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing. SoCG Alexandr Andoni, Ilya P. Razenshteyn
2016	A*	`conf`	Weighted low rank approximations with provable guarantees. STOC Ilya P. Razenshteyn, Zhao Song, David P. Woodruff
2015	J	`jnl`	An exact combinatorial algorithm for minimum graph bisection. Math. Program. Daniel Delling, Daniel Fleischman, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato F. Werneck
2015	J	`jnl`	Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching. CoRR Arturs Backurs, Piotr Indyk, Eric Price, Ilya P. Razenshteyn, David P. Woodruff
2015	J	`jnl`	On the Complexity of Inner Product Similarity Join. CoRR Thomas D. Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri
2015	A*	`conf`	Optimal Data-Dependent Hashing for Approximate Near Neighbors. STOC Alexandr Andoni, Ilya P. Razenshteyn
2015	J	`jnl`	Optimal Data-Dependent Hashing for Approximate Near Neighbors. CoRR Alexandr Andoni, Ilya P. Razenshteyn
2015	—	`conf`	Practical and Optimal LSH for Angular Distance. NIPS Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, Ludwig Schmidt
2015	J	`jnl`	Practical and Optimal LSH for Angular Distance. CoRR Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, Ludwig Schmidt
2015	A*	`conf`	Restricted Isometry Property for General p-Norms. SoCG Zeyuan Allen Zhu, Rati Gelashvili, Ilya P. Razenshteyn
2015	A	`conf`	Robust Hierarchical k-Center Clustering. ITCS Silvio Lattanzi, Stefano Leonardi, Vahab S. Mirrokni, Ilya P. Razenshteyn
2015	A*	`conf`	Sketching and Embedding are Equivalent for Norms. STOC Alexandr Andoni, Robert Krauthgamer, Ilya P. Razenshteyn
2015	J	`jnl`	Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing. CoRR Alexandr Andoni, Ilya P. Razenshteyn
2014	A*	`conf`	Beyond Locality-Sensitive Hashing. SODA Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, Ilya P. Razenshteyn
2014	J	`jnl`	Sketching and Embedding are Equivalent for Norms. CoRR Alexandr Andoni, Robert Krauthgamer, Ilya P. Razenshteyn
2014	J	`jnl`	The Restricted Isometry Property for the General p-Norms. CoRR Zeyuan Allen Zhu, Rati Gelashvili, Ilya P. Razenshteyn
2013	J	`jnl`	Beyond Locality-Sensitive Hashing. CoRR Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, Ilya P. Razenshteyn
2013	J	`jnl`	On Model-Based RIP-1 Matrices CoRR Piotr Indyk, Ilya P. Razenshteyn
2013	—	`conf`	On Model-Based RIP-1 Matrices. ICALP (1) Piotr Indyk, Ilya P. Razenshteyn
2013	J	`jnl`	Separating Hierarchical and General Hub Labelings CoRR Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko
2013	B	`conf`	Separating Hierarchical and General Hub Labelings. MFCS Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko
2012	A	`conf`	Exact Combinatorial Branch-and-Bound for Graph Bisection. ALENEX Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck
2012	J	`jnl`	On Epsilon-Nets, Distance Oracles, and Metric Embeddings CoRR Ilya P. Razenshteyn
2011	J	`jnl`	Common information revisited CoRR Ilya P. Razenshteyn
2011	A	`conf`	Graph Partitioning with Natural Cuts. IPDPS Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck
2011	J	`jnl`	Not every domain of a plain decompressor contains the domain of a prefix-free one. Theor. Comput. Sci. Mikhail Andreev, Ilya P. Razenshteyn, Alexander Shen
2010	J	`jnl`	A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks CoRR Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn
2010	B	`conf`	A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks. SOFSEM Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn
2010	J	`jnl`	Not Every Domain of a Plain Decompressor Contains the Domain of a Prefix-Free One CoRR Mikhail Andreev, Ilya P. Razenshteyn, Alexander Shen
2010	Misc	`conf`	Triangle-Free 2-Matchings Revisited. COCOON Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn
2010	J	`jnl`	Triangle-Free 2-Matchings Revisited. Discret. Math. Algorithms Appl. Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn