Sepideh Mahabadi (سپیده مه آبادی)
I am a final year PhD student in Theory of Computation (TOC) group at CSAIL, MIT. I am very fortunate to have Prof. Piotr Indyk as my advisor. My work at MIT has been mostly focused on Sub-linear Algorithms for Massive Data problems.
Next year, I will be a postdoc at Simons Collaboration on Algorithms and Geometry based at Data Science Institute of Columbia University . I am excited to work with Prof. Alexander Andoni next year and afterwards joining TTIC as a Research Assistant Professor.
Prior to MIT, I received my B.Sc. in Computer Engineering from Sharif University of Technology, Iran 2007-2011.
CV: Publications:
Contact Information:
  • Office: MIT 32-G630
  • E-mail: [lastname] @
  • Publications
    • S. Har-Peled, P. Indyk, S. Mahabadi, Approximate Sparse Linear Regression, Manuscript. (pdf)
    • P. Indyk, S. Mahabadi, R. Rubinfeld, J. Ullman, A. Vakilian, A. Yodpinyanee, Sub-linear Time Set-Cover , Manuscript.
    • 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:
    Sub-linear Algorithms for Massive Data Problems
    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