Sepideh Mahabadi (سپیده مه آبادی)
I am a Research Assistant Professor at Toyota Technological Institute at Chicago (TTIC) .
I received my PhD in Computer Science, at the Theory of Computation (TOC) group at CSAIL, MIT. I was very fortunate to have Prof. Piotr Indyk as my advisor.
For a year, I was a Postdoctoral Research Scientist at Simons Collaboration on Algorithms and Geometry based at Columbia University, working with Prof. Alexander Andoni.
Prior to MIT, I received my B.Sc. in Computer Engineering from Sharif University of Technology, Iran 2007-2011.
CV (May 2018): Publications:
My research is mostly focused on Sub-linear Algorithms for Massive Data including (but not limited to) high dimensional computational geometry, streaming algorithms, sub-linear time algorithms, sketching, and graph algorithm.
I am on the program committee of ITCS 2019 .
Contact Information:
  • Office: TTIC 521
  • E-mail: [lastname] @
  • Publications
    • P. Indyk, S. Mahabadi, S. Oveis Gharan, A. Rezaei,
      Composable Core-sets for Determinant Maximization Problems via Spectral Spanners ,
      Manuscript. (pdf)
    • S. Har-Peled, P. Indyk, S. Mahabadi,
      Approximate Sparse Linear Regression,
      ICALP 2018. (pdf)
    • S. Mahabadi, K. Makarychev, Y. Makarychev, I. Razenshteyn,
      Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions,
      STOC 2018.
    • P. Indyk, S. Mahabadi, R. Rubinfeld, A. Vakilian, A. Yodpinyanee,
      Sub-linear Time Set-Cover ,
      SODA 2018. (pdf)
    • P. Indyk, S. Mahabadi, R. Rubinfeld, J. Ullman, A. Vakilian, A. Yodpinyanee,
      Fractional Set Cover in the Streaming Model ,
      Approx 2017.
    • S. Har-Peled, S. Mahabadi,
      Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search,
      SODA 2017. (pdf)
    • S. Har-Peled, P. Indyk, S. Mahabadi, A.Vakilian,
      Towards Tight Bounds for the Streaming Set Cover Problem,
      PODS 2016. (pdf)
    • P. Indyk, R. Kleinberg, S. Mahabadi, Y. Yuan,
      Simultaneous Nearest Neighbor Search,
      SoCG 2016. (pdf, slides)
    • S. Mahabadi,
      Approximate Nearest Line Search in High Dimensions,
      SODA 2015. (pdf, short slides, long slides)
    • E. Demaine, P. Indyk, S. Mahabadi, A.Vakilian,
      On Streaming and Communication Complexity of the Set Cover Problem,
      DISC 2014. (pdf)
    • P. Indyk, S. Mahabadi, M. Mahdian, V. Mirrokni,
      Composable Core-sets for Diversity and Coverage Maximization,
      PODS 2014. (pdf, slides)
    • S. Abbar, S. Amer-Yahia, P. Indyk, S. Mahabadi, K. Varadarajan,
      Diverse Near Neighbor Problem,
      SoCG 2013. (pdf , slides)
    • S. Abbar, S. Amer-Yahia, P. Indyk, S. Mahabadi,
      Real-time Recommendation of Diverse Related Articles,
      WWW 2013. (pdf)
    • H. Mirzaei, S. Ahmadian, S. Mahabadi, M. Sadeghi M., C. Eslahchi, H. Pezeshk, An Algorithm for Construction of all Perfect Phylogeny Matrices, MATCH, 2009.
    • M. Sadeghi, H. Pezeshk, C. Eslahchi, S. Ahmadian, S. Mahabadi, Construction of Random Perfect Phylogeny Matrix , Advances and Applications in Bioinformatics and Chemistry 2010.
    Master's Thesis:
    (MIT, June 2013)
    Approximate Nearest Neighbor And Its Many Variants (pdf)
    PhD Thesis:
    (MIT, Sept. 2017)
    Sub-linear Algorithms for Massive Data Problems (pdf)
    Internships & Visits
    • TTIC, Internship, Summer 2016, Chicago
      - Mentors: Julia Chuzhoy and Yury Makarychev
    • UIUC, Summer 2015, Urbana Champaign
      - Mentor: Sariel Har-Peled
    • Yahoo Labs!, Research Intern, August 2014, New York
      - Mentors: Howard Karloff and Edo Liberty
    • Google, Research Intern, Summer 2013, Mountain View
      - Mentor: Mohammad Mahdian
    • Advanced Digital Sciences Center, Intern, Summer 2010, Singapore
      - Mentors: Marianne Winslette and Jiangbo Lu