I LYA R A ZE N S H TEYN [email protected] Research interests Geometric algorithms, high-dimensional geometry, metric embeddings, streaming algorithms, combinatorial optimization. Education 2012–present 2007–2012 Massachusetts Institute of Technology Ph. D. in Computer Science Advisor: Piotr Indyk S. M. thesis: Beyond Locality-Sensitive Hashing (available at http://hdl.handle.net/1721.1/89862) Lomonosov Moscow State University M. Sc. in Mathematics Advisors: Maxim Babenko and Alexander Shen Thesis: Covering Shortest Paths in Undirected Graphs Publications Selected work: see [1], [2] and [5] below. 1. Alexandr Andoni, Robert Krauthgamer and Ilya Razenshteyn, Sketching and Embedding are Equivalent for Norms, preprint, 2014, arXiv:1411.2577. 2. Alexandr Andoni and Ilya Razenshteyn, Optimal Data-Dependent Hashing for Approximate Near Neighbors, preprint, 2014, http://www.ilyaraz.org/optimal_lsh.pdf. 3. Zeyuan Allen-Zhu, Rati Gelashvili and Ilya Razenshteyn, Restricted Isometry Property for General p-Norms, preprint, 2014, arXiv:1407.2178. 4. Arturs Backurs, Piotr Indyk, Eric Price, Ilya Razenshteyn and David P. Woodruff, Nearly-optimal bounds for sparse recovery in generic norms, with applications to 𝐤-median sketching, preprint, 2014. 5. Daniel Delling, Daniel Fleischman, Andrew Goldberg, Ilya Razenshteyn and Renato F. Werneck, An Exact Combinatorial Algorithm for Minimum Graph Bisection, Mathematical Programming Series A, to appear, 2014, http://www.ilyaraz.org/bisection.pdf. 6. Silvio Lattanzi, Stefano Leonardi, Vahab Mirrokni and Ilya Razenshteyn, Robust Hierarchical 𝐤-Center Clustering, proceedings of 6th Conference on Innovations in Theoretical Computer Science (ITCS), to appear, 2015. 7. Alexandr Andoni, Piotr Indyk, Huy L. Nguyen and Ilya Razenshteyn, Beyond Locality-Sensitive Hashing, proceedings of 25th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2014, available at arXiv:1306.1547. 8. Piotr Indyk and Ilya Razenshteyn, On Model-Based RIP-1 Matrices, proceedings of 40th International Colloquium on Automata, Languages and Programming (ICALP), 2013, arXiv:1304.3604. 9. Andrew Goldberg, Ilya Razenshteyn and Ruslan Savchenko, Separating Hierarchical and General Hub Labelings, proceedings of 38th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2013, arXiv:1304.5973. 10. Daniel Delling, Andrew Goldberg, Ilya Razenshteyn and Renato F. Werneck, Graph Partitioning with Natural Cuts, proceedings of 25th IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2011, MSR-TR-2010-164. 11. Mikhail Andreev, Ilya Razenshteyn and Alexander Shen, Not Every Domain of a Plain Decompressor Contains the Domain of a Prefix-Free One, Thoretical Computer Science, 2011, arXiv:1001.442. 12. Maxim Babenko, Alexey Gusakov and Ilya Razenshteyn, Triangle-Free 2-Matchings Revisited, Discrete Mathematics, Algorithms and Applications, 2010, arXiv:1003.2697. 13. Maxim Babenko, Ignat Kolesnichenko and Ilya Razenshteyn, A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks, proceedings of 36th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2010, arXiv:1003.3085. Research internships 2014 2013 2011 2010 Microsoft Research Silicon Valley Mentor: Alexandr Andoni Equivalence between sketches and embeddings for general normed spaces [1] Optimal data-dependent hashing for the high-dimensional nearest neighbor search [2] Google New York Mentors: Silvio Lattanzi and Vahab Mirrokni Universal outliers for 𝑘-center clustering [6] Microsoft Research Silicon Valley Mentors: Andrew Goldberg and Renato Werneck Fast exact algorithm for the minimum bisection problem [5] Microsoft Research Silicon Valley Mentors: Andrew Goldberg and Renato Werneck Efficient heuristic for partitioning road networks [10] Invited Talks • Sketching and Embedding are Equivalent for Norms: MSR/MIT reading group (December 5, 2014) • Optimal Data-Dependent Hashing for Approximate Near Neighbors: Data Management group seminar, Boston University (October 17, 2014) • Beyond Locality-Sensitive Hashing: ICERM (February 21, 2014), MIT Algorithms & Complexity Seminar (November 20, 2013), Google New York (July, 2013) References Piotr Indyk Robert Krauthgamer Alexandr Andoni Andrew Goldberg professor, MIT professor, Weizmann Institute of Science (formerly) researcher, Microsoft Research Silicon Valley (formerly) principal researcher, Microsoft Research Silicon Valley
© Copyright 2024 ExpyDoc
