Sepideh Mahabadi (سپیده مه آبادی)
I am currently a PhD student in Theory of Computation Group (TOC) , Computer Science and Artificial Intelligence Lab (CSAIL), at MIT. I am very fortunate to have Prof. Piotr Indyk as my advisor. I work mostly on high dimensional computational geometry, and streaming algorithms.
Prior to MIT, I received my B.Sc. in Computer Engineering from Sharif University of Technology, Iran.
Research Interests: High Dimensional Computational Geometry, Streaming Algorithms, Online Algorithms, Graph Algorithms.
CV:
Publications:
  • S. Har-Peled, S. Mahabadi, Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search, Manuscript. (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.
  • S. Mahabadi, Approximate Nearest Line Search in High Dimensions, SODA 2015. (pdf)
  • 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, Efficient Computation of Diverse News, 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)
Contact Information:
  • Office: MIT 32-G630
  • E-mail: [lastname] @ mit.edu