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 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, hosted by Alexandr Andoni.
Prior to MIT, I received my B.Sc. in Computer Engineering from Sharif University of Technology, Iran 2007-2011.
CV (May 2020): Publications:
Research:
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 Algorithms.
Academic Service:
  • Program Committee: STOC 2021 , SODA 2021 , Random 2020 and ITCS 2019 ; and Reviewer: ICML 2018 and NIPS 2017.
  • We are organizing WOLA 2020 virtually on July 20th-21st. Recently, we organized Recent Trends in TCS workshop on January 31st, 2020 at TTIC.
  • Contact:
  • Office: TTIC 521
  • E-mail: [lastname] @ ttic.edu
  • Publications
    Publications:
    Undergraduate
    Publications:
    • 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)
    Talks
    • TCS+ Talk, April 2020
      Non-Adaptive Adaptive Sampling on Turnstile Streams
    • CMU, November 2019
      Composable Core-sets for Determinant Maximization Problems via Spectral Spanners
    • MSR Redmond, October 2019
      Diversity Maximization over Large Data Sets
    • Metric Embeddings & Dimensionality Reduction workshop, May 2019
      Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extension
    • "Optimization Methods in Computer Vision and Image Processing" workshop, ICERM, May 2019
      Diversity Maximization over Large Data Sets
    • Midwest Theory Day, Purdue University, April 2019
      Diversity Maximization over Large Data Sets
    • UIUC, February 2019
      Composable Core-sets for Determinant Maximization Problems via Spectral Spanners
    • Junior Theorists Workshop, Northwestern Univeristy, November 2018
      Composable Core-sets for Determinant Maximization Problems via Spectral Spanners
    • University of Chicago, October 2018
      Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extension
    • Google New York, July 2018
      Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extension
    • Workshop on Local Algorithms (WOLA), MIT, June 2018
      Set Cover in Sub-linear Time
    • Rutgers Univeristy/DIMCAS, May 2018
      Set Cover in Sub-linear Time
    • Midwest Theory Day, TTIC, April 2018
      Set Cover in Sub-linear Time
    • Simons Collaboration on Algorithms & Geometry, February 2018
      Fractional Set Cover in the Streaming Model
    • New York Area Theory Day, NYU, December 2017
      Set Cover in Sub-linear Time
    • University of Washington, April 2017
      Approximate Nearest Neighbor and Its Many Faces
    • IBM Watson, December 2016
      Approximate Nearest Neighbor and Its Many Variants
    • University of Toronto, November 2015
      Towards Tight Bounds for the Streaming Set Cover Problem
    • Brown University, November 2014
      Approximate Nearest Line Search in High Dimensions
    Internships & Visits
    Programming Contests
    • IOI 2007, Gold Medal
      - Only female contestant to win a gold medal at IOI 2007.
    • ACM-ICPC World Finals 2011, Ranked 13th.
      - Representing Sharif University.
    • ACM-ICPC World Finals 2013, Ranked 14th.
      - Representing MIT.
    (سپیده مه آبادی)