default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSepideh Mahabadi
- > Home > Persons > Sepideh Mahabadi
Publications
- 2023
[c25]Alexandr Andoni, Piotr Indyk, Sepideh Mahabadi, Shyam Narayanan:
Differentially Private Approximate Near Neighbor Counting in High Dimensions. NeurIPS 2023- 2020
- [c16]Piotr Indyk, Sepideh Mahabadi, Shayan Oveis Gharan, Alireza Rezaei:
Composable Core-sets for Determinant Maximization Problems via Spectral Spanners. SODA 2020: 1675-1694 - 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 - [i10]Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee:
Set Cover in Sub-linear Time. CoRR abs/1902.03534 (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
, Piotr Indyk, Sepideh Mahabadi:
Approximate Sparse Linear Regression. ICALP 2018: 77:1-77:14 - [c11]Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Ali Vakilian, Anak Yodpinyanee:
Set Cover in Sub-linear Time. SODA 2018: 2467-2486 - [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) - 2017
- [c9]Piotr Indyk, Sepideh Mahabadi, Ronitt Rubinfeld, Jonathan R. Ullman, Ali Vakilian, Anak Yodpinyanee:
Fractional Set Cover in the Streaming Model. APPROX-RANDOM 2017: 12:1-12:20 - 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, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian:
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, Piotr Indyk, Sepideh Mahabadi:
Approximate Sparse Linear Regression. CoRR abs/1609.08739 (2016) - 2015
- [i2]Piotr Indyk, Sepideh Mahabadi, Ali Vakilian:
Towards Tight Bounds for the Streaming Set Cover Problem. CoRR abs/1509.00118 (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
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-08-08 20:11 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:
