Ilya Razenshteyn
GENERAL INFORMATION
Since September 2012 I am a graduate student at MIT Computer Science and Artificial Intelligence 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.
Check out our new project: Algorithms Office Hours.
Watch some of my talks:
 “Optimal Hashingbased TimeSpace Tradeoffs for Approximate Near Neighbors” (CMU Theory Lunch)
 “Sketching and Embedding are Equivalent for Norms” (TCS+)
 “LocalitySensitive Hashing and Beyond” (Microsoft Research)
We have released FALCONN: a highly optimized C++ library (with a Python wrapper) for similarity search based on LSH.
 Email: ilyaraz@mit.edu
 CV (as of October 5, 2016)
 DBLP and Google Scholar
I do Theoretical Computer Science. My research interests include: similarity search, sketching, metric embeddings, highdimensional geometry, streaming algorithms, compressed sensing, combinatorial optimization.
My wife does Theory as well!
SELECTED PUBLICATIONS
 A. Andoni, T. Laarhoven, IR and E. Waingarten, Optimal Hashingbased Timeâ€“Space Tradeoffs for Approximate Near Neighbors, SODA, 2017 (arXiv).
 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).
Invited to the special issue of SIAM Journal on Computing  A. Andoni and IR, Optimal DataDependent Hashing for Approximate Near Neighbors, STOC, 2015 (arXiv).
 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
 January 2016: minicourse 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 minicourse Path and Flow Algorithms at Yandex Data Analysis School
© 2015—2016