Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlya P. Razenshteyn
Person information
- affiliation: Microsoft Research, Redmond, WA, USA
- affiliation: Massachusetts Institute of Technology, CSAIL, Cambridge, MA, USA
- affiliation: Lomonosov Moscow State University, Mathematics Department, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c36]Meena Jagadeesan, Ilya P. Razenshteyn, Suriya Gunasekar:
Inductive Bias of Multi-Channel Linear Convolutional Networks with Bounded Weight Norm. COLT 2022: 2276-2325- 2021
- [c35]Alexandr Andoni, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
Approximate Nearest Neighbors Beyond Space Partitions. SODA 2021: 1171-1190 - [i35]Meena Jagadeesan, Ilya P. Razenshteyn, Suriya Gunasekar:
Inductive Bias of Multi-Channel Linear Convolutional Networks with Bounded Weight Norm. CoRR abs/2102.12238 (2021) - 2020
- [c34]Amir Zandieh, Navid Nouri, Ameya Velingker, Michael Kapralov, Ilya P. Razenshteyn:
Scaling up Kernel Ridge Regression via Locality Sensitive Hashing. AISTATS 2020: 4088-4097 - [c33]Hao Chen, Miran Kim
, Ilya P. Razenshteyn, Dragos Rotaru, Yongsoo Song, Sameer Wagh:
Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning. ASIACRYPT (3) 2020: 31-59 - [c32]Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Learning Space Partitions for Nearest Neighbor Search. ICLR 2020 - [c31]Arturs Backurs, Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Scalable Nearest Neighbor Search for Optimal Transport. ICML 2020: 497-506 - [c30]Greg Yang, Tony Duan, J. Edward Hu, Hadi Salman, Ilya P. Razenshteyn, Jerry Li:
Randomized Smoothing of All Shapes and Sizes. ICML 2020: 10693-10705 - [c29]Sepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, Samson Zhou:
Non-adaptive adaptive sampling on turnstile streams. STOC 2020: 1251-1264 - [c28]Hao Chen, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya, Ilya P. Razenshteyn, M. Sadegh Riazi:
SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search. USENIX Security Symposium 2020: 2111-2128 - [i34]Greg Yang, Tony Duan, J. Edward Hu, Hadi Salman, Ilya P. Razenshteyn, Jerry Li:
Randomized Smoothing of All Shapes and Sizes. CoRR abs/2002.08118 (2020) - [i33]Michael Kapralov, Navid Nouri, Ilya P. Razenshteyn, Ameya Velingker, Amir Zandieh:
Scaling up Kernel Ridge Regression via Locality Sensitive Hashing. CoRR abs/2003.09756 (2020) - [i32]Sepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, Samson Zhou:
Non-Adaptive Adaptive Sampling on Turnstile Streams. CoRR abs/2004.10969 (2020) - [i31]Yihe Dong, Yu Gao, Richard Peng, Ilya P. Razenshteyn, Saurabh Sawlani:
A Study of Performance of Optimal Transport. CoRR abs/2005.01182 (2020) - [i30]Hao Chen, Miran Kim, Ilya P. Razenshteyn, Dragos Rotaru, Yongsoo Song, Sameer Wagh:
Maliciously Secure Matrix Multiplication with Applications to Private Deep Learning. IACR Cryptol. ePrint Arch. 2020: 451 (2020)
2010 – 2019
- 2019
- [c27]Jerry Li, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
On Mean Estimation for General Norms with Statistical Queries. COLT 2019: 2158-2172 - [c26]Sébastien Bubeck, Yin Tat Lee, Eric Price, Ilya P. Razenshteyn:
Adversarial examples from computational constraints. ICML 2019: 831-840 - [c25]Hadi Salman, Jerry Li, Ilya P. Razenshteyn, Pengchuan Zhang, Huan Zhang, Sébastien Bubeck, Greg Yang:
Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers. NeurIPS 2019: 11289-11300 - [c24]Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn:
Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering. STOC 2019: 1027-1038 - [i29]Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Learning Sublinear-Time Indexing for Nearest Neighbor Search. CoRR abs/1901.08544 (2019) - [i28]Jerry Li, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
On Mean Estimation for General Norms with Statistical Queries. CoRR abs/1902.02459 (2019) - [i27]Hao Chen, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya, Ilya P. Razenshteyn, M. Sadegh Riazi:
SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search. CoRR abs/1904.02033 (2019) - [i26]Hadi Salman, Greg Yang, Jerry Li, Pengchuan Zhang, Huan Zhang, Ilya P. Razenshteyn, Sébastien Bubeck:
Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers. CoRR abs/1906.04584 (2019) - [i25]Yihe Dong, Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Scalable Nearest Neighbor Search for Optimal Transport. CoRR abs/1910.04126 (2019) - [i24]Hao Chen, Ilaria Chillotti, Yihe Dong, Oxana Poburinnaya, Ilya P. Razenshteyn, M. Sadegh Riazi:
SANNS: Scaling Up Secure Approximate k-Nearest Neighbors Search. IACR Cryptol. ePrint Arch. 2019: 359 (2019) - 2018
- [j5]Alexandr Andoni, Robert Krauthgamer, Ilya P. Razenshteyn:
Sketching and Embedding are Equivalent for Norms. SIAM J. Comput. 47(3): 890-916 (2018) - [c23]Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
Hölder Homeomorphisms and Approximate Nearest Neighbors. FOCS 2018: 159-169 - [c22]Alexandr Andoni, Assaf Naor, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
Data-dependent hashing via nonlinear spectral gaps. STOC 2018: 787-800 - [c21]Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn:
Nonlinear dimension reduction via outer Bi-Lipschitz extensions. STOC 2018: 1088-1101 - [i23]Sébastien Bubeck, Eric Price, Ilya P. Razenshteyn:
Adversarial examples from computational constraints. CoRR abs/1805.10204 (2018) - [i22]Alexandr Andoni, Piotr Indyk, Ilya P. Razenshteyn:
Approximate Nearest Neighbor Search in High Dimensions. CoRR abs/1806.09823 (2018) - [i21]Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn:
Performance of Johnson-Lindenstrauss Transform for k-Means and k-Medians Clustering. CoRR abs/1811.03195 (2018) - [i20]Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn:
Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions. CoRR abs/1811.03591 (2018) - [i19]Sébastien Bubeck, Yin Tat Lee, Eric Price, Ilya P. Razenshteyn:
Adversarial Examples from Cryptographic Pseudo-Random Generators. CoRR abs/1811.06418 (2018) - 2017
- [b1]Ilya P. Razenshteyn:
High-dimensional similarity search and sketching: algorithms and hardness. Massachusetts Institute of Technology, Cambridge, USA, 2017 - [c20]Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Practical Data-Dependent Metric Compression with Provable Guarantees. NIPS 2017: 2617-2626 - [c19]Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten:
Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. SODA 2017: 47-66 - [c18]Alexandr Andoni, Ilya P. Razenshteyn, Negev Shekel Nosatzki:
LSH Forest: Practical Algorithms Made Theoretical. SODA 2017: 67-78 - [c17]Alexandr Andoni, Huy L. Nguyen, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
Approximate near neighbors for general symmetric norms. STOC 2017: 902-913 - [i18]Piotr Indyk, Ilya P. Razenshteyn, Tal Wagner:
Practical Data-Dependent Metric Compression with Provable Guarantees. CoRR abs/1711.01520 (2017) - 2016
- [j4]Zeyuan Allen Zhu, Rati Gelashvili, Ilya P. Razenshteyn:
Restricted Isometry Property for General p-Norms. IEEE Trans. Inf. Theory 62(10): 5839-5854 (2016) - [c16]Alexandr Andoni, Ilya P. Razenshteyn:
Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing. SoCG 2016: 9:1-9:11 - [c15]Thomas Dybdahl Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri:
On the Complexity of Inner Product Similarity Join. PODS 2016: 151-164 - [c14]Arturs Backurs, Piotr Indyk, Ilya P. Razenshteyn, David P. Woodruff:
Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching. SODA 2016: 318-337 - [c13]Ilya P. Razenshteyn, Zhao Song, David P. Woodruff:
Weighted low rank approximations with provable guarantees. STOC 2016: 250-263 - [i17]Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten:
Lower Bounds on Time-Space Trade-Offs for Approximate Near Neighbors. CoRR abs/1605.02701 (2016) - [i16]Alexandr Andoni, Thijs Laarhoven, Ilya P. Razenshteyn, Erik Waingarten:
Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors. CoRR abs/1608.03580 (2016) - [i15]Alexandr Andoni, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten:
Approximate Near Neighbors for General Symmetric Norms. CoRR abs/1611.06222 (2016) - 2015
- [j3]Daniel Delling, Daniel Fleischman, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato F. Werneck:
An exact combinatorial algorithm for minimum graph bisection. Math. Program. 153(2): 417-458 (2015) - [c12]Zeyuan Allen Zhu, Rati Gelashvili, Ilya P. Razenshteyn:
Restricted Isometry Property for General p-Norms. SoCG 2015: 451-460 - [c11]Silvio Lattanzi, Stefano Leonardi, Vahab S. Mirrokni, Ilya P. Razenshteyn:
Robust Hierarchical k-Center Clustering. ITCS 2015: 211-218 - [c10]Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, Ludwig Schmidt:
Practical and Optimal LSH for Angular Distance. NIPS 2015: 1225-1233 - [c9]Alexandr Andoni, Robert Krauthgamer, Ilya P. Razenshteyn:
Sketching and Embedding are Equivalent for Norms. STOC 2015: 479-488 - [c8]Alexandr Andoni, Ilya P. Razenshteyn:
Optimal Data-Dependent Hashing for Approximate Near Neighbors. STOC 2015: 793-801 - [i14]Alexandr Andoni, Ilya P. Razenshteyn:
Optimal Data-Dependent Hashing for Approximate Near Neighbors. CoRR abs/1501.01062 (2015) - [i13]Arturs Backurs, Piotr Indyk, Eric Price, Ilya P. Razenshteyn, David P. Woodruff:
Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching. CoRR abs/1504.01076 (2015) - [i12]Alexandr Andoni, Ilya P. Razenshteyn:
Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing. CoRR abs/1507.04299 (2015) - [i11]Alexandr Andoni, Piotr Indyk, Thijs Laarhoven, Ilya P. Razenshteyn, Ludwig Schmidt:
Practical and Optimal LSH for Angular Distance. CoRR abs/1509.02897 (2015) - [i10]Thomas D. Ahle, Rasmus Pagh, Ilya P. Razenshteyn, Francesco Silvestri:
On the Complexity of Inner Product Similarity Join. CoRR abs/1510.02824 (2015) - 2014
- [c7]Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, Ilya P. Razenshteyn:
Beyond Locality-Sensitive Hashing. SODA 2014: 1018-1028 - [i9]Zeyuan Allen Zhu, Rati Gelashvili, Ilya P. Razenshteyn:
The Restricted Isometry Property for the General p-Norms. CoRR abs/1407.2178 (2014) - [i8]Alexandr Andoni, Robert Krauthgamer, Ilya P. Razenshteyn:
Sketching and Embedding are Equivalent for Norms. CoRR abs/1411.2577 (2014) - 2013
- [c6]Piotr Indyk, Ilya P. Razenshteyn:
On Model-Based RIP-1 Matrices. ICALP (1) 2013: 564-575 - [c5]Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko:
Separating Hierarchical and General Hub Labelings. MFCS 2013: 469-479 - [i7]Piotr Indyk, Ilya P. Razenshteyn:
On Model-Based RIP-1 Matrices. CoRR abs/1304.3604 (2013) - [i6]Andrew V. Goldberg, Ilya P. Razenshteyn, Ruslan Savchenko:
Separating Hierarchical and General Hub Labelings. CoRR abs/1304.5973 (2013) - [i5]Alexandr Andoni, Piotr Indyk, Huy L. Nguyen, Ilya P. Razenshteyn:
Beyond Locality-Sensitive Hashing. CoRR abs/1306.1547 (2013) - 2012
- [c4]Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck:
Exact Combinatorial Branch-and-Bound for Graph Bisection. ALENEX 2012: 30-44 - [i4]Ilya P. Razenshteyn:
On Epsilon-Nets, Distance Oracles, and Metric Embeddings. CoRR abs/1206.4164 (2012) - 2011
- [j2]Mikhail Andreev, Ilya P. Razenshteyn, Alexander Shen:
Not every domain of a plain decompressor contains the domain of a prefix-free one. Theor. Comput. Sci. 412(4-5): 482-486 (2011) - [c3]Daniel Delling, Andrew V. Goldberg, Ilya P. Razenshteyn, Renato Fonseca F. Werneck:
Graph Partitioning with Natural Cuts. IPDPS 2011: 1135-1146 - [i3]Ilya P. Razenshteyn:
Common information revisited. CoRR abs/1104.3207 (2011) - 2010
- [j1]Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn:
Triangle-Free 2-Matchings Revisited. Discret. Math. Algorithms Appl. 2(4): 643-654 (2010) - [c2]Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn:
Triangle-Free 2-Matchings Revisited. COCOON 2010: 120-129 - [c1]Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn:
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks. SOFSEM 2010: 165-175 - [i2]Mikhail Andreev, Ilya P. Razenshteyn, Alexander Shen:
Not Every Domain of a Plain Decompressor Contains the Domain of a Prefix-Free One. CoRR abs/1001.4462 (2010) - [i1]Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. Razenshteyn:
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks. CoRR abs/1003.3085 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-02 01:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
