default search action
Sepideh Mahabadi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c29]Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian:
Streaming Algorithms for Connectivity Augmentation. ICALP 2024: 93:1-93:20 - [c28]Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski:
Efficiently Computing Similarities to Private Datasets. ICLR 2024 - [i24]Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian:
Streaming Algorithms for Connectivity Augmentation. CoRR abs/2402.10806 (2024) - [i23]Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski:
Efficiently Computing Similarities to Private Datasets. CoRR abs/2403.08917 (2024) - 2023
- [c27]Sepideh Mahabadi, Shyam Narayanan:
Improved Diversity Maximization Algorithms for Matching and Pseudoforest. APPROX/RANDOM 2023: 25:1-25:22 - [c26]Sèdjro Salomon Hotegni, Sepideh Mahabadi, Ali Vakilian:
Approximation Algorithms for Fair Range Clustering. ICML 2023: 13270-13284 - [c25]Alexandr Andoni, Piotr Indyk, Sepideh Mahabadi, Shyam Narayanan:
Differentially Private Approximate Near Neighbor Counting in High Dimensions. NeurIPS 2023 - [c24]Aditya Bhaskara, Sepideh Mahabadi, Ali Vakilian:
Tight Bounds for Volumetric Spanners and Applications. NeurIPS 2023 - [c23]Siddharth Gollapudi, Sepideh Mahabadi, Varun Sivashankar:
Composable Coresets for Determinant Maximization: Greedy is Almost Optimal. NeurIPS 2023 - [c22]Sepideh Mahabadi, Stojan Trajanovski:
Core-sets for Fair and Diverse Data Summarization. NeurIPS 2023 - [i22]Sèdjro Salomon Hotegni, Sepideh Mahabadi, Ali Vakilian:
Approximation Algorithms for Fair Range Clustering. CoRR abs/2306.06778 (2023) - [i21]Sepideh Mahabadi, Shyam Narayanan:
Improved Diversity Maximization Algorithms for Matching and Pseudoforest. CoRR abs/2307.04329 (2023) - [i20]Siddharth Gollapudi, Sepideh Mahabadi, Varun Sivashankar:
Composable Coresets for Determinant Maximization: Greedy is Almost Optimal. CoRR abs/2309.15286 (2023) - [i19]Aditya Bhaskara, Sepideh Mahabadi, Ali Vakilian:
Tight Bounds for Volumetric Spanners and Applications. CoRR abs/2310.00175 (2023) - [i18]Sepideh Mahabadi, Stojan Trajanovski:
Core-sets for Fair and Diverse Data Summarization. CoRR abs/2310.08122 (2023) - 2022
- [j3]Martin Aumüller, Sariel Har-Peled
, Sepideh Mahabadi, Rasmus Pagh
Sampling near neighbors in search for fairness. Commun. ACM 65(8): 83-90 (2022) - [j2]Martin Aumüller
Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All? ACM Trans. Database Syst. 47(1): 4:1-4:40 (2022) - [c21]Sepideh Mahabadi, David P. Woodruff, Samson Zhou
Adaptive Sketches for Robust Regression with Importance Sampling. APPROX/RANDOM 2022: 31:1-31:21 - [i17]Sepideh Mahabadi, David P. Woodruff, Samson Zhou:
Adaptive Sketches for Robust Regression with Importance Sampling. CoRR abs/2207.07822 (2022) - [i16]Sepideh Mahabadi, Thuy-Duong Vuong:
Composable Coresets for Constrained Determinant Maximization and Beyond. CoRR abs/2211.00289 (2022) - 2021
- [j1]Martin Aumüller, Sariel Har-Peled
Fair near neighbor search via sampling. SIGMOD Rec. 50(1): 42-49 (2021) - [c20]Arturs Backurs, Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev:
Two-Sided Kirszbraun Theorem. SoCG 2021: 13:1-13:14 - [i15]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 abs/2101.10905 (2021) - 2020
- [c19]Alexandr Andoni, Collin Burns, Yi Li
Streaming Complexity of SVMs. APPROX-RANDOM 2020: 50:1-50:22 - [c18]Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan:
Towards Better Approximation of Graph Crossing Number. FOCS 2020: 73-84 - [c17]Sepideh Mahabadi, Ali Vakilian
Individual Fairness for k-Clustering. ICML 2020: 6586-6596 - [c16]Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei:
Composable Core-sets for Determinant Maximization Problems via Spectral Spanners. SODA 2020: 1675-1694 - [c15]Sepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, Samson Zhou:
Non-adaptive adaptive sampling on turnstile streams. STOC 2020: 1251-1264 - [i14]Sepideh Mahabadi, Ali Vakilian:
(Individual) Fairness for k-Clustering. CoRR abs/2002.06742 (2020) - [i13]Sepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, Samson Zhou:
Non-Adaptive Adaptive Sampling on Turnstile Streams. CoRR abs/2004.10969 (2020) - [i12]Alexandr Andoni, Collin Burns, Yi Li, Sepideh Mahabadi, David P. Woodruff:
Streaming Complexity of SVMs. CoRR abs/2007.03633 (2020) - [i11]Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan:
Towards Better Approximation of Graph Crossing Number. CoRR abs/2011.06545 (2020)
2010 – 2019
- 2019
- [c14]Sepideh Mahabadi, Piotr Indyk, Shayan Oveis Gharan, Alireza Rezaei:
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm. ICML 2019: 4254-4263 - [c13]Sariel Har-Peled
Near Neighbor: Who is the Fairest of Them All? NeurIPS 2019: 13176-13187 - [i10]Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee:
Set Cover in Sub-linear Time. CoRR abs/1902.03534 (2019) - [i9]Sariel Har-Peled, Sepideh Mahabadi:
Near Neighbor: Who is the Fairest of Them All? CoRR abs/1906.02640 (2019) - [i8]Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei:
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm. CoRR abs/1907.03197 (2019) - 2018
- [c12]Sariel Har-Peled
Approximate Sparse Linear Regression. ICALP 2018: 77:1-77:14 - [c11]Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian
Set Cover in Sub-linear Time. SODA 2018: 2467-2486 - [c10]Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn:
Nonlinear dimension reduction via outer Bi-Lipschitz extensions. STOC 2018: 1088-1101 - [i7]Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei:
Composable Core-sets for Determinant Maximization Problems via Spectral Spanners. CoRR abs/1807.11648 (2018) - [i6]Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev, Ilya P. Razenshteyn:
Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions. CoRR abs/1811.03591 (2018) - 2017
- [b1]Sepideh Mahabadi:
Sublinear algorithms for massive data problems. Massachusetts Institute of Technology, Cambridge, USA, 2017 - [c9]Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan R. Ullman, Ali Vakilian
Fractional Set Cover in the Streaming Model. APPROX-RANDOM 2017: 12:1-12:20 - [c8]Sariel Har-Peled
Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search. SODA 2017: 1-15 - [i5]Sariel Har-Peled
LSH on the Hypercube Revisited. CoRR abs/1704.02546 (2017) - 2016
- [c7]Piotr Indyk, Robert D. Kleinberg, Sepideh Mahabadi, Yang Yuan:
Simultaneous Nearest Neighbor Search. SoCG 2016: 44:1-44:15 - [c6]Sariel Har-Peled
Towards Tight Bounds for the Streaming Set Cover Problem. PODS 2016: 371-383 - [i4]Piotr Indyk, Robert D. Kleinberg, Sepideh Mahabadi, Yang Yuan:
Simultaneous Nearest Neighbor Search. CoRR abs/1604.02188 (2016) - [i3]Sariel Har-Peled
Approximate Sparse Linear Regression. CoRR abs/1609.08739 (2016) - 2015
- [c5]Sepideh Mahabadi:
Approximate Nearest Line Search in High Dimensions. SODA 2015: 337-354 - [i2]Piotr Indyk, Sepideh Mahabadi, Ali Vakilian:
Towards Tight Bounds for the Streaming Set Cover Problem. CoRR abs/1509.00118 (2015) - [i1]Sariel Har-Peled
Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor Search. CoRR abs/1511.07357 (2015) - 2014
- [c4]Piotr Indyk, Sepideh Mahabadi, Mohammad Mahdian, Vahab S. Mirrokni:
Composable core-sets for diversity and coverage maximization. PODS 2014: 100-108 - [c3]Erik D. Demaine, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
On Streaming and Communication Complexity of the Set Cover Problem. DISC 2014: 484-498 - 2013
- [c2]Sofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi, Kasturi R. Varadarajan:
Diverse near neighbor problem. SoCG 2013: 207-214 - [c1]Sofiane Abbar, Sihem Amer-Yahia, Piotr Indyk, Sepideh Mahabadi:
Real-time recommendation of diverse related articles. WWW 2013: 1-12
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: