default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 60 matches
- 2024
- Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian:
Streaming Algorithms for Connectivity Augmentation. ICALP 2024: 93:1-93:20 - 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 abs/2402.10806 (2024) - Arturs Backurs, Zinan Lin, Sepideh Mahabadi, Sandeep Silwal, Jakub Tarnawski:
Efficiently Computing Similarities to Private Datasets. CoRR abs/2403.08917 (2024) - Sepideh Mahabadi, Mohammad Roghani, Jakub Tarnawski, Ali Vakilian:
Sublinear Metric Steiner Tree via Improved Bounds for Set Cover. CoRR abs/2411.09059 (2024) - 2023
- Sepideh Mahabadi, Shyam Narayanan:
Improved Diversity Maximization Algorithms for Matching and Pseudoforest. APPROX/RANDOM 2023: 25:1-25:22 - Sèdjro Salomon Hotegni, Sepideh Mahabadi, Ali Vakilian:
Approximation Algorithms for Fair Range Clustering. ICML 2023: 13270-13284 - Alexandr Andoni, Piotr Indyk, Sepideh Mahabadi, Shyam Narayanan:
Differentially Private Approximate Near Neighbor Counting in High Dimensions. 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 - Sepideh Mahabadi, Stojan Trajanovski:
Core-sets for Fair and Diverse Data Summarization. NeurIPS 2023 - Sèdjro Salomon Hotegni, Sepideh Mahabadi, Ali Vakilian:
Approximation Algorithms for Fair Range Clustering. CoRR abs/2306.06778 (2023) - Sepideh Mahabadi, Shyam Narayanan:
Improved Diversity Maximization Algorithms for Matching and Pseudoforest. CoRR abs/2307.04329 (2023) - Siddharth Gollapudi, Sepideh Mahabadi, Varun Sivashankar:
Composable Coresets for Determinant Maximization: Greedy is Almost Optimal. CoRR abs/2309.15286 (2023) - Aditya Bhaskara, Sepideh Mahabadi, Ali Vakilian:
Tight Bounds for Volumetric Spanners and Applications. CoRR abs/2310.00175 (2023) - Sepideh Mahabadi, Stojan Trajanovski:
Core-sets for Fair and Diverse Data Summarization. CoRR abs/2310.08122 (2023) - 2022
- Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri:
Sampling near neighbors in search for fairness. Commun. ACM 65(8): 83-90 (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): 4:1-4:40 (2022) - Sepideh Mahabadi, David P. Woodruff, Samson Zhou:
Adaptive Sketches for Robust Regression with Importance Sampling. APPROX/RANDOM 2022: 31:1-31:21 - Sepideh Mahabadi, David P. Woodruff, Samson Zhou:
Adaptive Sketches for Robust Regression with Importance Sampling. CoRR abs/2207.07822 (2022) - Sepideh Mahabadi, Thuy-Duong Vuong:
Composable Coresets for Constrained Determinant Maximization and Beyond. CoRR abs/2211.00289 (2022) - 2021
- Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri:
Fair near neighbor search via sampling. SIGMOD Rec. 50(1): 42-49 (2021) - Daniel Khashabi, Arman Cohan, Siamak Shakeri, Pedram Hosseini, Pouya Pezeshkpour, Malihe Alikhani, Moin Aminnaseri, Marzieh Bitaab, Faeze Brahman, Sarik Ghazarian, Mozhdeh Gheini, Arman Kabiri, Rabeeh Karimi Mahabadi, Omid Memarrast, Ahmadreza Mosallanezhad, Erfan Noury, Shahab Raji, Mohammad Sadegh Rasooli, Sepideh Sadeghi, Erfan Sadeqi Azer, Niloofar Safi Samghabadi, Mahsa Shafaei, Saber Sheybani, Ali Tazarv, Yadollah Yaghoobzadeh:
ParsiNLU: A Suite of Language Understanding Challenges for Persian. Trans. Assoc. Comput. Linguistics 9: 1147-1162 (2021) - Arturs Backurs, Sepideh Mahabadi, Konstantin Makarychev, Yury Makarychev:
Two-Sided Kirszbraun Theorem. SoCG 2021: 13:1-13:14 - 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
- Alexandr Andoni, Collin Burns, Yi Li, Sepideh Mahabadi, David P. Woodruff:
Streaming Complexity of SVMs. APPROX-RANDOM 2020: 50:1-50:22 - Julia Chuzhoy, Sepideh Mahabadi, Zihan Tan:
Towards Better Approximation of Graph Crossing Number. FOCS 2020: 73-84 - Sepideh Mahabadi, Ali Vakilian:
Individual Fairness for k-Clustering. ICML 2020: 6586-6596 - Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei:
Composable Core-sets for Determinant Maximization Problems via Spectral Spanners. SODA 2020: 1675-1694 - Sepideh Mahabadi, Ilya P. Razenshteyn, David P. Woodruff, Samson Zhou:
Non-adaptive adaptive sampling on turnstile streams. STOC 2020: 1251-1264
skipping 30 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2025-01-13 20:54 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint