Ilya Razenshteyn

GENERAL INFORMATION

Since September 2012 I am a graduate student at MIT Computer Science and AI Laboratory. I am privileged to be advised by Piotr Indyk. I graduated in June 2012 from Moscow State University, where my advisors were great Maxim Babenko and Sasha Shen.

Starting September 2017, I will be a Simons Junior Fellow at Columbia University. In 2018 I am joining Microsoft Research Redmond as a researcher.

• Email: ilyaraz@mit.edu
• My CV (as of May 21, 2017)
• My Google Scholar profile
• My research statement (as of December 2016)

I do Theoretical Computer Science. My research interests are revolving around efficient algorithms for massive datasets with geometric structure.

My wife does Theory as well!

VIDEOS OF MY TALKS

• “Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors” (CMU Theory Lunch)
• “Sketching and Embedding are Equivalent for Norms” (TCS+)
• “Locality-Sensitive Hashing and Beyond” (Microsoft Research)

CODE

FALCONN: a highly optimized C++ library (with Python bindings) for similarity search based on LSH.

SELECTED PUBLICATIONS

• A. Andoni, T. Laarhoven, IR and E. Waingarten, Optimal Hashing-based Time–Space Trade-offs for Approximate Near Neighbors, SODA, 2017 (arXiv).
  Invited to the special issue of ACM Transactions on Algorithms
• A. Andoni, P. Indyk, T. Laarhoven, IR and L. Schmidt, Practical and Optimal LSH for Angular Distance, NIPS, 2015 (arXiv).
• A. Andoni, R. Krauthgamer and IR, Sketching and Embedding are Equivalent for Norms, STOC, 2015 (arXiv).
  Accepted to the special issue of SIAM Journal on Computing
  Invited to Highlights of Algorithms (HALG 2016)
• A. Andoni and IR, Optimal Data-Dependent Hashing for Approximate Near Neighbors, STOC, 2015 (arXiv).
  Invited to Highlights of Algorithms (HALG 2016)
• D. Delling, D. Fleischman, A. Goldberg, IR and R. Werneck, An Exact Combinatorial Algorithm for Minimum Graph Bisection, Mathematical Programming, Vol. 153, Issue 2, pp. 417–458, 2015 (local copy).

See the full list of papers (with slides, posters, videos etc).

TEACHING

• May 2017: mini-course Algorithms for high-dimensional data at the school Recent Advances in Algorithms, Saint Petersburg.
• January 2016: mini-course From “compact presentations” to algorithms for big data at PDMI CS Club (me and students who took the class)
• Fall 2015: TA for Introduction to Algorithms (6.006) at MIT (taught by Piotr Indyk and Ron Rivest)
• Spring 2014: TA for the Piotr Indyk's course Geometric Computing (6.850) at MIT
• Spring 2011: TA for the Andrew Goldberg's mini-course Path and Flow Algorithms at Yandex Data Analysis School

---

© 2015–2017