Sepideh Mahabadi

71 papers A* 28A 5Journal 35Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Improved Algorithms for Fair Matroid Submodular Maximization. CoRR Sepideh Mahabadi, Sherry Sarkar, Jakub Tarnawski
2026	A*	`conf`	Sublinear Metric Steiner Forest via Maximal Independent Set. SODA Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
2025	J	`jnl`	A 0.51-Approximation of Maximum Matching in Sublinear n CoRR Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski
2025	A*	`conf`	A 0.51-Approximation of Maximum Matching in Sublinear n^{1.5} Time. ICALP Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski
2025	A*	`conf`	Graph-Based Algorithms for Diverse Similarity Search. ICML Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy, Sepideh Mahabadi, Vikas C. Raykar, Kirankumar Shiragur, Haike Xu
2025	J	`jnl`	Graph-Based Algorithms for Diverse Similarity Search. CoRR Piyush Anand, Piotr Indyk, Ravishankar Krishnaswamy, Sepideh Mahabadi, Vikas C. Raykar, Kirankumar Shiragur, Haike Xu
2025	A*	`conf`	Guessing Efficiently for Constrained Subspace Approximation. ICALP Aditya Bhaskara, Sepideh Mahabadi, Madhusudhan Reddy Pittu, Ali Vakilian, David P. Woodruff
2025	J	`jnl`	Guessing Efficiently for Constrained Subspace Approximation. CoRR Aditya Bhaskara, Sepideh Mahabadi, Madhusudhan Reddy Pittu, Ali Vakilian, David P. Woodruff
2025	A	`conf`	Streaming Algorithms for Network Design. APPROX/RANDOM Chandra Chekuri, Rhea Jain, Sepideh Mahabadi, Ali Vakilian
2025	J	`jnl`	Streaming Algorithms for Network Design. CoRR Chandra Chekuri, Rhea Jain, Sepideh Mahabadi, Ali Vakilian
2025	J	`jnl`	Sublinear Metric Steiner Forest via Maximal Independent Set. CoRR Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
2025	A	`conf`	Sublinear Metric Steiner Tree via Improved Bounds for Set Cover. ITCS Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
2025	J	`jnl`	The General Expiration Streaming Model: Diameter, CoRR Lotte Blank, Sergio Cabello, MohammadTaghi Hajiaghayi, Robert Krauthgamer, Sepideh Mahabadi, André Nusser, Jeff M. Phillips, Jonas Sauer
2024	A*	`conf`	Efficiently Computing Similarities to Private Datasets. ICLR Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski
2024	J	`jnl`	Efficiently Computing Similarities to Private Datasets. CoRR Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski
2024	A*	`conf`	Streaming Algorithms for Connectivity Augmentation. ICALP Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian
2024	J	`jnl`	Streaming Algorithms for Connectivity Augmentation. CoRR Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian
2024	J	`jnl`	Sublinear Metric Steiner Tree via Improved Bounds for Set Cover. CoRR Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian
2023	A*	`conf`	Approximation Algorithms for Fair Range Clustering. ICML Sèdjro Salomon Hotegni, Sepideh Mahabadi, Ali Vakilian
2023	J	`jnl`	Approximation Algorithms for Fair Range Clustering. CoRR Sèdjro Salomon Hotegni, Sepideh Mahabadi, Ali Vakilian
2023	A*	`conf`	Composable Coresets for Determinant Maximization: Greedy is Almost Optimal. NeurIPS Siddharth Gollapudi, Sepideh Mahabadi, Varun Sivashankar
2023	J	`jnl`	Composable Coresets for Determinant Maximization: Greedy is Almost Optimal. CoRR Siddharth Gollapudi, Sepideh Mahabadi, Varun Sivashankar
2023	A*	`conf`	Core-sets for Fair and Diverse Data Summarization. NeurIPS Sepideh Mahabadi, Stojan Trajanovski
2023	J	`jnl`	Core-sets for Fair and Diverse Data Summarization. CoRR Sepideh Mahabadi, Stojan Trajanovski
2023	A*	`conf`	Differentially Private Approximate Near Neighbor Counting in High Dimensions. NeurIPS Alexandr Andoni, Piotr Indyk, Sepideh Mahabadi, Shyam Narayanan
2023	A	`conf`	Improved Diversity Maximization Algorithms for Matching and Pseudoforest. APPROX/RANDOM Sepideh Mahabadi, Shyam Narayanan
2023	J	`jnl`	Improved Diversity Maximization Algorithms for Matching and Pseudoforest. CoRR Sepideh Mahabadi, Shyam Narayanan
2023	A*	`conf`	Tight Bounds for Volumetric Spanners and Applications. NeurIPS Aditya Bhaskara, Sepideh Mahabadi, Ali Vakilian
2023	J	`jnl`	Tight Bounds for Volumetric Spanners and Applications. CoRR Aditya Bhaskara, Sepideh Mahabadi, Ali Vakilian
2022	A	`conf`	Adaptive Sketches for Robust Regression with Importance Sampling. APPROX/RANDOM Sepideh Mahabadi, David P. Woodruff, Samson Zhou
2022	J	`jnl`	Adaptive Sketches for Robust Regression with Importance Sampling. CoRR Sepideh Mahabadi, David P. Woodruff, Samson Zhou
2022	J	`jnl`	Composable Coresets for Constrained Determinant Maximization and Beyond. CoRR Sepideh Mahabadi, Thuy-Duong Vuong
2022	J	`jnl`	Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? ACM Trans. Database Syst. Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
2022	J	`jnl`	Sampling near neighbors in search for fairness. Commun. ACM Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
2021	J	`jnl`	Fair near neighbor search via sampling. SIGMOD Rec. Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
2021	J	`jnl`	Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? CoRR Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri
2021	A*	`conf`	Two-Sided Kirszbraun Theorem. SoCG Arturs Backurs, Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev
2020	J	`jnl`	(Individual) Fairness for k-Clustering. CoRR Sepideh Mahabadi, Ali Vakilian
2020	A*	`conf`	Composable Core-sets for Determinant Maximization Problems via Spectral Spanners. SODA Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei
2020	A*	`conf`	Individual Fairness for k-Clustering. ICML Sepideh Mahabadi, Ali Vakilian
2020	J	`jnl`	Non-Adaptive Adaptive Sampling on Turnstile Streams. CoRR Sepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, Samson Zhou
2020	A*	`conf`	Non-adaptive adaptive sampling on turnstile streams. STOC Sepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, Samson Zhou
2020	—	`conf`	Streaming Complexity of SVMs. APPROX-RANDOM Alexandr Andoni, Collin Burns, Yi Li, Sepideh Mahabadi, David P. Woodruff
2020	J	`jnl`	Streaming Complexity of SVMs. CoRR Alexandr Andoni, Collin Burns, Yi Li, Sepideh Mahabadi, David P. Woodruff
2020	A*	`conf`	Towards Better Approximation of Graph Crossing Number. FOCS Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan
2020	J	`jnl`	Towards Better Approximation of Graph Crossing Number. CoRR Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan
2019	A*	`conf`	Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm. ICML Sepideh Mahabadi, Piotr Indyk, Shayan Oveis Gharan, Alireza Rezaei
2019	J	`jnl`	Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm. CoRR Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei
2019	A*	`conf`	Near Neighbor: Who is the Fairest of Them All? NeurIPS Sariel Har-Peled, Sepideh Mahabadi
2019	J	`jnl`	Near Neighbor: Who is the Fairest of Them All? CoRR Sariel Har-Peled, Sepideh Mahabadi
2019	J	`jnl`	Set Cover in Sub-linear Time. CoRR Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee
2018	A*	`conf`	Approximate Sparse Linear Regression. ICALP Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi
2018	J	`jnl`	Composable Core-sets for Determinant Maximization Problems via Spectral Spanners. CoRR Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei
2018	J	`jnl`	Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions. CoRR Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn
2018	A*	`conf`	Nonlinear dimension reduction via outer Bi-Lipschitz extensions. STOC Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn
2018	A*	`conf`	Set Cover in Sub-linear Time. SODA Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee
2017	—	`conf`	Fractional Set Cover in the Streaming Model. APPROX-RANDOM Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan R. Ullman, Ali Vakilian, Anak Yodpinyanee
2017	J	`jnl`	LSH on the Hypercube Revisited. CoRR Sariel Har-Peled, Sepideh Mahabadi
2017	A*	`conf`	Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search. SODA Sariel Har-Peled, Sepideh Mahabadi
2017	—	`—`	Sublinear algorithms for massive data problems. Sepideh Mahabadi
2016	J	`jnl`	Approximate Sparse Linear Regression. CoRR Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi
2016	A*	`conf`	Simultaneous Nearest Neighbor Search. SoCG Piotr Indyk, Robert D. Kleinberg, Sepideh Mahabadi, Yang Yuan
2016	J	`jnl`	Simultaneous Nearest Neighbor Search. CoRR Piotr Indyk, Robert D. Kleinberg, Sepideh Mahabadi, Yang Yuan
2016	A*	`conf`	Towards Tight Bounds for the Streaming Set Cover Problem. PODS Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
2015	A*	`conf`	Approximate Nearest Line Search in High Dimensions. SODA Sepideh Mahabadi
2015	J	`jnl`	Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search. CoRR Sariel Har-Peled, Sepideh Mahabadi
2015	J	`jnl`	Towards Tight Bounds for the Streaming Set Cover Problem. CoRR Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
2014	A*	`conf`	Composable core-sets for diversity and coverage maximization. PODS Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, Vahab S. Mirrokni
2014	A	`conf`	On Streaming and Communication Complexity of the Set Cover Problem. DISC Erik D. Demaine, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
2013	A*	`conf`	Diverse near neighbor problem. SoCG Sofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi, Kasturi R. Varadarajan
2013	A*	`conf`	Real-time recommendation of diverse related articles. WWW Sofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi