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.
Watch two videos of me speaking about our results: “Sketching and Embedding are Equivalent for Norms” (TCS+) and “Locality-Sensitive Hashing and Beyond” (Microsoft Research).
We have released FALCONN: a highly optimized C++ library (with a Python wrapper) for similarity search based on LSH.
I do Theoretical Computer Science. My research interests include: similarity search, sketching, metric embeddings, high-dimensional geometry, streaming algorithms, compressed sensing, combinatorial optimization.
My wife does Theory as well!
- A. Andoni, T. Laarhoven, IR and E. Waingarten, Optimal Hashing-based Time–Space Trade-offs for Approximate Near Neighbors, manuscript, 2016 (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 Data-Dependent 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).
- 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