1. S. Mahabadi, K. Makarychev, Y. Makarychev and IR, TBA, 2016.


  1. A. Andoni, A. Nikolov, IR and E. Waingarten, Approximate Near Neighbors for General Symmetric Norms, STOC, 2017 (arXiv, long slides).
  2. A. Andoni, IR and N. Shekel Nosatzki, LSH Forest: Practical Algorithms Made Theoretical, SODA, 2017 (local copy, short slides).
  3. A. Andoni, T. Laarhoven, IR and E. Waingarten, Optimal Hashing-based Time–Space Trade-offs for Approximate Near Neighbors, SODA, 2017 (arXiv, long slides).
    Invited to the special issue of ACM Transactions on Algorithms
  4. T.D. Ahle, R. Pagh, IR and F. Silvestri, On the Complexity of Inner Product Similarity Join, PODS, 2016 (arXiv).
  5. A. Andoni and IR, Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing, SoCG, 2016 (arXiv, short slides).
    Invited to Highlights of Algorithms (HALG 2017)
  6. IR, Z. Song and D. Woodruff, Weighted Low Rank Approximations with Provable Guarantees, STOC, 2016 (local copy).
  7. A. Backurs, P. Indyk, IR and D. Woodruff, Nearly-optimal bounds for sparse recovery in generic norms, with applications to $k$-median sketching, SODA, 2016 (arXiv).
  8. A. Andoni, P. Indyk, T. Laarhoven, IR and L. Schmidt, Practical and Optimal LSH for Angular Distance, NIPS, 2015 (arXiv, long slides, poster).
  9. A. Andoni and IR, Optimal Data-Dependent Hashing for Approximate Near Neighbors, STOC, 2015 (arXiv, five-minute talk, video, long slides, short slides).
    Invited to Highlights of Algorithms (HALG 2016)
  10. S. Lattanzi, S. Leonardi, V. Mirrokni and IR, Robust Hierarchical $k$-Center Clustering, ITCS, 2015 (slides).
  11. A. Andoni, P. Indyk, H. Nguyen and IR, Beyond Locality-Sensitive Hashing, SODA, 2014 (arXiv, blog post, long slides, short slides, video, poster).
  12. A. Goldberg, IR and R. Savchenko, Separating Hierarchical and General Hub Labelings, MFCS, 2013 (arXiv).
  13. P. Indyk and IR, On Model-Based RIP-1 Matrices, ICALP, 2013 (arXiv, slides).
  14. D. Delling, A. Goldberg, IR and R. Werneck, Graph Partitioning with Natural Cuts, IPDPS, 2011 (technical report, slides).
  15. M. Babenko, I. Kolesnichenko and IR, A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks, SOFSEM, 2010 (arXiv).


  1. A. Andoni, R. Krauthgamer and IR, Sketching and Embedding are Equivalent for Norms, SIAM Journal on Computing, special issue for STOC 2015, accepted with a minor revision; preliminary version appeared in STOC, 2015 (arXiv, blog post, long slides, short slides, poster).
    Invited to Highlights of Algorithms (HALG 2016)
  2. Z. Allen-Zhu, R. Gelashvili and IR, Restricted Isometry Property for General p-Norms, IEEE Transactions on Information Theory, Vol. 62, Issue 10, pp. 5839–5854, 2016; preliminary version appeared in SoCG 2015 (arXiv, slides).
  3. 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; preliminary versions appeared in ALENEX 2012 and ESA 2012 (local copy).
  4. M. Andreev, IR and A. Shen, Not Every Domain of a Plain Decompressor Contains the Domain of a Prefix-Free One, Theoretical Computer Science, Vol. 412, pp. 482–486, 2011; preliminary version appeared in CiE 2010 (arXiv, slides).
  5. M. Babenko, A. Gusakov and IR, Triangle-Free 2-Matchings Revisited, Discrete Mathematics, Algorithms and Applications, special issue for COCOON 2010, Vol. 2, Issue 4, pp. 643–654, 2010; preliminary version appeared in COCOON 2010 (arXiv).


  1. SM Thesis (MIT): Beyond Locality-Sensitive Hashing, 2014 (DSpace@MIT).
  2. M.S. Thesis (Moscow State University): Covering Shortest Paths in Undirected Graphs, 2012 (local copy).
  3. Term paper: On Epsilon-Nets, Distance Oracles, and Metric Embeddings, 2012 (arXiv).
  4. Term paper: Common information revisited, 2011 (arXiv).

© 2015–2017