SM
Sepideh Mahabadi
cs.DScs.LGcs.CGstat.MLcs.DMcs.AIcs.CCcs.CRcs.DBcs.DC
On Valency
published · living versionsW_4fjg98t4·v1 · currentpublished
Semi-Streaming Reachability and Shortest Paths in Passes
with Gary Hoppenworth, George Z. Li, Jakub Tarnawski
1 version
Preprints & journals
37 papers in the corpus · 2015–2026Random Fourier Features in Near-Linear Time2610.14751v1 · Sepideh Mahabadi, Sandeep Silwal, Tal Wagner2026 · 0 citationsarXiv
Improved Sublinear Algorithms for Maximal Independent Set and Metric Steiner Forest2610.06053v1 · Sepideh Mahabadi, Jakub Tarnawski2026 · 0 citationsarXiv
Local Search for Fair Max-Min Diversification2609.36513v1 · Sepideh Mahabadi, Shyam Narayanan, Varun Sivashankar2026 · 0 citationsarXiv
Hardness of Online Directed Steiner Network2609.22605v1 · Gary Hoppenworth, Yaowei Long, Sepideh Mahabadi et al.2026 · 0 citationsarXiv
Online Steiner Forest with Recourse2605.09821v1 · Yaowei Long, Sepideh Mahabadi, Sherry Sarkar et al.2026 · 0 citationsarXiv
Improved Algorithms for Fair Matroid Submodular Maximization2601.09860v1 · Sepideh Mahabadi, Sherry Sarkar, Jakub Tarnawski2026 · 0 citationsarXiv
Sublinear Metric Steiner Forest via Maximal Independent Set2510.11627v1 · Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski et al.2025 · 0 citationsarXiv
The Expiration Streaming Model: Diameter, -Center, Counting, Sampling, and Friends2509.07587v2 · Lotte Blank, Sergio Cabello, MohammadTaghi Hajiaghayi et al.2025 · 0 citationsarXiv
A 0.51-Approximation of Maximum Matching in Sublinear Time2506.01669v1 · Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski2025 · 0 citationsarXiv
Guessing Efficiently for Constrained Subspace Approximation2504.20883v1 · Aditya Bhaskara, Sepideh Mahabadi, Madhusudhan Reddy Pittu et al.2025 · 0 citationsarXiv
Streaming Algorithms for Network Design2503.00712v2 · Chandra Chekuri, Rhea Jain, Sepideh Mahabadi et al.2025 · 0 citationsarXiv
Graph-Based Algorithms for Diverse Similarity Search2502.13336v1 · Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy et al.2025 · 0 citationsarXiv
Sublinear Metric Steiner Tree via Improved Bounds for Set Cover2411.09059v1 · Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski et al.2024 · 0 citationsarXiv
Efficiently Computing Similarities to Private Datasets2403.08917v1 · Arturs Backurs, Zinan Lin, Sepideh Mahabadi et al.2024 · 1 citationarXiv
Streaming Algorithms for Connectivity Augmentation2402.10806v1 · Ce Jin, Michael Kapralov, Sepideh Mahabadi et al.2024 · 0 citationsarXiv
Core-sets for Fair and Diverse Data Summarization2310.08122v1 · Sepideh Mahabadi, Stojan Trajanovski2023 · 2 citationsarXiv
Tight Bounds for Volumetric Spanners and Applications2310.00175v1 · Aditya Bhaskara, Sepideh Mahabadi, Ali Vakilian2023 · 1 citationarXiv
Composable Coresets for Determinant Maximization: Greedy is Almost Optimal2309.15286v1 · Siddharth Gollapudi, Sepideh Mahabadi, Varun Sivashankar2023 · 0 citationsarXiv
Improved Diversity Maximization Algorithms for Matching and Pseudoforest2307.04329v1 · Sepideh Mahabadi, Shyam Narayanan2023 · 0 citationsarXiv
Approximation Algorithms for Fair Range Clustering2306.06778v2 · Sedjro S. Hotegni, Sepideh Mahabadi, Ali Vakilian2023 · 6 citationsarXiv
Composable Coresets for Constrained Determinant Maximization and Beyond2211.00289v2 · Sepideh Mahabadi, Thuy-Duong Vuong2022 · 0 citationsarXiv
Adaptive Sketches for Robust Regression with Importance Sampling2207.07822v1 · Sepideh Mahabadi, David P. Woodruff, Samson Zhou2022 · 0 citationsarXiv
Sampling a Near Neighbor in High Dimensions -- Who is the Fairest of Them All?2101.10905v1 · Martin Aumuller, Sariel Har-Peled, Sepideh Mahabadi et al.2021 · 2 citationsarXiv
Towards Better Approximation of Graph Crossing Number2011.06545v2 · Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan2020 · 4 citationsarXiv
Streaming Complexity of SVMs2007.03633v1 · Alexandr Andoni, Collin Burns, Yi Li et al.2020 · 2 citationsarXiv
Non-Adaptive Adaptive Sampling on Turnstile Streams2004.10969v1 · Sepideh Mahabadi, Ilya Razenshteyn, David P. Woodruff et al.2020 · 9 citationsarXiv
Individual Fairness for -Clustering2002.06742v2 · Sepideh Mahabadi, Ali Vakilian2020 · 34 citationsarXiv
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm1907.03197v1 · Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan et al.2019 · 2 citationsarXiv
Near Neighbor: Who is the Fairest of Them All?1906.02640v2 · Sariel Har-Peled, Sepideh Mahabadi2019 · 7 citationsarXiv
Set Cover in Sub-linear Time1902.03534v1 · Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld et al.2019 · 9 citationsarXiv
Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions1811.03591v1 · Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev et al.2018 · 27 citationsarXiv
Composable Core-sets for Determinant Maximization Problems via Spectral Spanners1807.11648v2 · Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan et al.2018 · 9 citationsarXiv
LSH on the Hypercube Revisited1704.02546v1 · Sariel Har-Peled, Sepideh Mahabadi2017 · 0 citationsarXiv
Approximate Sparse Linear Regression1609.08739v2 · Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi2016 · 4 citationsarXiv
Simultaneous Nearest Neighbor Search1604.02188v1 · Piotr Indyk, Robert Kleinberg, Sepideh Mahabadi et al.2016 · 0 citationsarXiv
Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search1511.07357v1 · Sariel Har-Peled, Sepideh Mahabadi2015 · 5 citationsarXiv
Towards Tight Bounds for the Streaming Set Cover Problem1509.00118v2 · Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi et al.2015 · 31 citationsarXiv
Career total: 57 works. 37 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.