Sepideh Mahabadi

ORCID

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 49

Top Venues

Massachusetts Institute of Technology, Cambridge, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, USA

PHD

Publications

Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski
Efficiently Computing Similarities to Private Datasets. ICLR (2024)
Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian
Streaming Algorithms for Connectivity Augmentation. CoRR (2024)
Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian
Streaming Algorithms for Connectivity Augmentation. ICALP (2024)
Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski
Efficiently Computing Similarities to Private Datasets. CoRR (2024)
Aditya Bhaskara, Sepideh Mahabadi, Ali Vakilian
Tight Bounds for Volumetric Spanners and Applications. CoRR (2023)
Sepideh Mahabadi, Shyam Narayanan
Improved Diversity Maximization Algorithms for Matching and Pseudoforest. APPROX/RANDOM (2023)
Alexandr Andoni, Piotr Indyk, Sepideh Mahabadi, Shyam Narayanan
Differentially Private Approximate Near Neighbor Counting in High Dimensions. NeurIPS (2023)
Sepideh Mahabadi, Stojan Trajanovski
Core-sets for Fair and Diverse Data Summarization. NeurIPS (2023)
Aditya Bhaskara, Sepideh Mahabadi, Ali Vakilian
Tight Bounds for Volumetric Spanners and Applications. NeurIPS (2023)
Siddharth Gollapudi, Sepideh Mahabadi, Varun Sivashankar
Composable Coresets for Determinant Maximization: Greedy is Almost Optimal. NeurIPS (2023)
Sèdjro Salomon Hotegni, Sepideh Mahabadi, Ali Vakilian
Approximation Algorithms for Fair Range Clustering. ICML (2023)
Sepideh Mahabadi, Stojan Trajanovski
Core-sets for Fair and Diverse Data Summarization. CoRR (2023)
Sepideh Mahabadi, Shyam Narayanan
Improved Diversity Maximization Algorithms for Matching and Pseudoforest. CoRR (2023)
Sèdjro S. Hotegni, Sepideh Mahabadi, Ali Vakilian
Approximation Algorithms for Fair Range Clustering. CoRR (2023)
Siddharth Gollapudi, Sepideh Mahabadi, Varun Sivashankar
Composable Coresets for Determinant Maximization: Greedy is Almost Optimal. CoRR (2023)
Sepideh Mahabadi, Thuy-Duong Vuong
Composable Coresets for Constrained Determinant Maximization and Beyond. CoRR (2022)
Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? ACM Trans. Database Syst. 47 (1) (2022)
Sepideh Mahabadi, David P. Woodruff, Samson Zhou
Adaptive Sketches for Robust Regression with Importance Sampling. CoRR (2022)
Sepideh Mahabadi, David P. Woodruff, Samson Zhou
Adaptive Sketches for Robust Regression with Importance Sampling. APPROX/RANDOM (2022)
Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
Sampling near neighbors in search for fairness. Commun. ACM 65 (8) (2022)
Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? CoRR (2021)
Arturs Backurs, Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev
Two-Sided Kirszbraun Theorem. SoCG (2021)
Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
Fair near neighbor search via sampling. SIGMOD Rec. 50 (1) (2021)
Alexandr Andoni, Collin Burns, Yi Li, Sepideh Mahabadi, David P. Woodruff
Streaming Complexity of SVMs. CoRR (2020)
Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan
Towards Better Approximation of Graph Crossing Number. CoRR (2020)
Alexandr Andoni, Collin Burns, Yi Li, Sepideh Mahabadi, David P. Woodruff
Streaming Complexity of SVMs. APPROX-RANDOM (2020)
Sepideh Mahabadi, Ali Vakilian
(Individual) Fairness for k-Clustering. CoRR (2020)
Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei
Composable Core-sets for Determinant Maximization Problems via Spectral Spanners. SODA (2020)
Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan
Towards Better Approximation of Graph Crossing Number. FOCS (2020)
Sepideh Mahabadi, Ali Vakilian
Individual Fairness for k-Clustering. ICML (2020)
Sepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, Samson Zhou
Non-adaptive adaptive sampling on turnstile streams. STOC (2020)
Sepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, Samson Zhou
Non-Adaptive Adaptive Sampling on Turnstile Streams. CoRR (2020)
Sariel Har-Peled, Sepideh Mahabadi
Near Neighbor: Who is the Fairest of Them All? NeurIPS (2019)
Sariel Har-Peled, Sepideh Mahabadi
Near Neighbor: Who is the Fairest of Them All? CoRR (2019)
Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee
Set Cover in Sub-linear Time. CoRR (2019)
Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm. CoRR (2019)
Sepideh Mahabadi, Piotr Indyk, Shayan Oveis Gharan, Alireza Rezaei
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm. ICML (2019)
Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn
Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions. CoRR (2018)
Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn
Nonlinear dimension reduction via outer Bi-Lipschitz extensions. STOC (2018)
Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei
Composable Core-sets for Determinant Maximization Problems via Spectral Spanners. CoRR (2018)
Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi
Approximate Sparse Linear Regression. ICALP (2018)
Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee
Set Cover in Sub-linear Time. SODA (2018)
Sariel Har-Peled, Sepideh Mahabadi
Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search. SODA (2017)
Sariel Har-Peled, Sepideh Mahabadi
LSH on the Hypercube Revisited. CoRR (2017)
Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan R. Ullman, Ali Vakilian, Anak Yodpinyanee
Fractional Set Cover in the Streaming Model. APPROX-RANDOM (2017)
Piotr Indyk, Robert D. Kleinberg, Sepideh Mahabadi, Yang Yuan
Simultaneous Nearest Neighbor Search. SoCG (2016)
Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
Towards Tight Bounds for the Streaming Set Cover Problem. PODS (2016)
Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi
Approximate Sparse Linear Regression. CoRR (2016)
Piotr Indyk, Robert D. Kleinberg, Sepideh Mahabadi, Yang Yuan
Simultaneous Nearest Neighbor Search. CoRR (2016)
Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
Towards Tight Bounds for the Streaming Set Cover Problem. CoRR (2015)
Sepideh Mahabadi
Approximate Nearest Line Search in High Dimensions. SODA (2015)
Sariel Har-Peled, Sepideh Mahabadi
Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search. CoRR (2015)
Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, Vahab S. Mirrokni
Composable core-sets for diversity and coverage maximization. PODS (2014)
Erik D. Demaine, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
On Streaming and Communication Complexity of the Set Cover Problem. DISC (2014)
Sofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi
Real-time recommendation of diverse related articles. WWW (2013)
Sofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi, Kasturi R. Varadarajan
Diverse near neighbor problem. SoCG (2013)

Sepideh Mahabadi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sepideh Mahabadi