default search action
Search dblp for Publications
export results for "Sepideh Mahabadi"
@inproceedings{DBLP:conf/icalp/BhaskaraMPVW25,
author = {Aditya Bhaskara and
Sepideh Mahabadi and
Madhusudhan Reddy Pittu and
Ali Vakilian and
David P. Woodruff},
editor = {Keren Censor{-}Hillel and
Fabrizio Grandoni and
Jo{\"{e}}l Ouaknine and
Gabriele Puppis},
title = {Guessing Efficiently for Constrained Subspace Approximation},
booktitle = {52nd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2025, July 8-11, 2025, Aarhus, Denmark},
series = {LIPIcs},
volume = {334},
pages = {29:1--29:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2025},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2025.29},
doi = {10.4230/LIPICS.ICALP.2025.29},
timestamp = {Mon, 30 Jun 2025 16:27:19 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BhaskaraMPVW25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MahabadiRT25,
author = {Sepideh Mahabadi and
Mohammad Roghani and
Jakub Tarnawski},
editor = {Keren Censor{-}Hillel and
Fabrizio Grandoni and
Jo{\"{e}}l Ouaknine and
Gabriele Puppis},
title = {A 0.51-Approximation of Maximum Matching in Sublinear n\{1.5\} Time},
booktitle = {52nd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2025, July 8-11, 2025, Aarhus, Denmark},
series = {LIPIcs},
volume = {334},
pages = {116:1--116:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2025},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2025.116},
doi = {10.4230/LIPICS.ICALP.2025.116},
timestamp = {Mon, 30 Jun 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MahabadiRT25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/MahabadiRTV25,
author = {Sepideh Mahabadi and
Mohammad Roghani and
Jakub Tarnawski and
Ali Vakilian},
editor = {Raghu Meka},
title = {Sublinear Metric Steiner Tree via Improved Bounds for Set Cover},
booktitle = {16th Innovations in Theoretical Computer Science Conference, {ITCS}
2025, January 7-10, 2025, Columbia University, New York, NY, {USA}},
series = {LIPIcs},
volume = {325},
pages = {74:1--74:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2025},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2025.74},
doi = {10.4230/LIPICS.ITCS.2025.74},
timestamp = {Tue, 11 Feb 2025 16:49:36 +0100},
biburl = {https://dblp.org/rec/conf/innovations/MahabadiRTV25.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2502-13336,
author = {Piyush Anand and
Piotr Indyk and
Ravishankar Krishnaswamy and
Sepideh Mahabadi and
Vikas C. Raykar and
Kirankumar Shiragur and
Haike Xu},
title = {Graph-Based Algorithms for Diverse Similarity Search},
journal = {CoRR},
volume = {abs/2502.13336},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2502.13336},
doi = {10.48550/ARXIV.2502.13336},
eprinttype = {arXiv},
eprint = {2502.13336},
timestamp = {Wed, 19 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2502-13336.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2503-00712,
author = {Chandra Chekuri and
Rhea Jain and
Sepideh Mahabadi and
Ali Vakilian},
title = {Streaming Algorithms for Network Design},
journal = {CoRR},
volume = {abs/2503.00712},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2503.00712},
doi = {10.48550/ARXIV.2503.00712},
eprinttype = {arXiv},
eprint = {2503.00712},
timestamp = {Tue, 08 Apr 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2503-00712.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2504-20883,
author = {Aditya Bhaskara and
Sepideh Mahabadi and
Madhusudhan Reddy Pittu and
Ali Vakilian and
David P. Woodruff},
title = {Guessing Efficiently for Constrained Subspace Approximation},
journal = {CoRR},
volume = {abs/2504.20883},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2504.20883},
doi = {10.48550/ARXIV.2504.20883},
eprinttype = {arXiv},
eprint = {2504.20883},
timestamp = {Sun, 25 May 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2504-20883.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2506-01669,
author = {Sepideh Mahabadi and
Mohammad Roghani and
Jakub Tarnawski},
title = {A 0.51-Approximation of Maximum Matching in Sublinear n\({}^{\mbox{1.5}}\)
Time},
journal = {CoRR},
volume = {abs/2506.01669},
year = {2025},
url = {https://doi.org/10.48550/arXiv.2506.01669},
doi = {10.48550/ARXIV.2506.01669},
eprinttype = {arXiv},
eprint = {2506.01669},
timestamp = {Sun, 06 Jul 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2506-01669.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/0001KMV24,
author = {Ce Jin and
Michael Kapralov and
Sepideh Mahabadi and
Ali Vakilian},
editor = {Karl Bringmann and
Martin Grohe and
Gabriele Puppis and
Ola Svensson},
title = {Streaming Algorithms for Connectivity Augmentation},
booktitle = {51st International Colloquium on Automata, Languages, and Programming,
{ICALP} 2024, July 8-12, 2024, Tallinn, Estonia},
series = {LIPIcs},
volume = {297},
pages = {93:1--93:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2024.93},
doi = {10.4230/LIPICS.ICALP.2024.93},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/0001KMV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iclr/Backurs0MST24,
author = {Arturs Backurs and
Zinan Lin and
Sepideh Mahabadi and
Sandeep Silwal and
Jakub Tarnawski},
title = {Efficiently Computing Similarities to Private Datasets},
booktitle = {The Twelfth International Conference on Learning Representations,
{ICLR} 2024, Vienna, Austria, May 7-11, 2024},
publisher = {OpenReview.net},
year = {2024},
url = {https://openreview.net/forum?id=HMe5CJv9dQ},
timestamp = {Wed, 07 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iclr/Backurs0MST24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-10806,
author = {Ce Jin and
Michael Kapralov and
Sepideh Mahabadi and
Ali Vakilian},
title = {Streaming Algorithms for Connectivity Augmentation},
journal = {CoRR},
volume = {abs/2402.10806},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.10806},
doi = {10.48550/ARXIV.2402.10806},
eprinttype = {arXiv},
eprint = {2402.10806},
timestamp = {Wed, 24 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-10806.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-08917,
author = {Arturs Backurs and
Zinan Lin and
Sepideh Mahabadi and
Sandeep Silwal and
Jakub Tarnawski},
title = {Efficiently Computing Similarities to Private Datasets},
journal = {CoRR},
volume = {abs/2403.08917},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.08917},
doi = {10.48550/ARXIV.2403.08917},
eprinttype = {arXiv},
eprint = {2403.08917},
timestamp = {Fri, 05 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-08917.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2411-09059,
author = {Sepideh Mahabadi and
Mohammad Roghani and
Jakub Tarnawski and
Ali Vakilian},
title = {Sublinear Metric Steiner Tree via Improved Bounds for Set Cover},
journal = {CoRR},
volume = {abs/2411.09059},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2411.09059},
doi = {10.48550/ARXIV.2411.09059},
eprinttype = {arXiv},
eprint = {2411.09059},
timestamp = {Wed, 01 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2411-09059.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MahabadiN23,
author = {Sepideh Mahabadi and
Shyam Narayanan},
editor = {Nicole Megow and
Adam D. Smith},
title = {Improved Diversity Maximization Algorithms for Matching and Pseudoforest},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {25:1--25:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.25},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.25},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/MahabadiN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/HotegniMV23,
author = {S{\`{e}}djro Salomon Hotegni and
Sepideh Mahabadi and
Ali Vakilian},
editor = {Andreas Krause and
Emma Brunskill and
Kyunghyun Cho and
Barbara Engelhardt and
Sivan Sabato and
Jonathan Scarlett},
title = {Approximation Algorithms for Fair Range Clustering},
booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
2023, Honolulu, Hawaii, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {202},
pages = {13270--13284},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v202/hotegni23a.html},
timestamp = {Mon, 28 Aug 2023 17:23:08 +0200},
biburl = {https://dblp.org/rec/conf/icml/HotegniMV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/AndoniIMN23,
author = {Alexandr Andoni and
Piotr Indyk and
Sepideh Mahabadi and
Shyam Narayanan},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Differentially Private Approximate Near Neighbor Counting in High
Dimensions},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/87571720167f7e88827c40e468e3101f-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/AndoniIMN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/BhaskaraMV23,
author = {Aditya Bhaskara and
Sepideh Mahabadi and
Ali Vakilian},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Tight Bounds for Volumetric Spanners and Applications},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/02a92b52670752daf17b53f04f1ab405-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/BhaskaraMV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/GollapudiMS23,
author = {Siddharth Gollapudi and
Sepideh Mahabadi and
Varun Sivashankar},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Composable Coresets for Determinant Maximization: Greedy is Almost
Optimal},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/81c565e605161fcf25d08aa230431eba-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/GollapudiMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/MahabadiT23,
author = {Sepideh Mahabadi and
Stojan Trajanovski},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Core-sets for Fair and Diverse Data Summarization},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/f980ba94f513168f2b292f58aef929ec-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/MahabadiT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-06778,
author = {S{\`{e}}djro Salomon Hotegni and
Sepideh Mahabadi and
Ali Vakilian},
title = {Approximation Algorithms for Fair Range Clustering},
journal = {CoRR},
volume = {abs/2306.06778},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.06778},
doi = {10.48550/ARXIV.2306.06778},
eprinttype = {arXiv},
eprint = {2306.06778},
timestamp = {Wed, 16 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-06778.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-04329,
author = {Sepideh Mahabadi and
Shyam Narayanan},
title = {Improved Diversity Maximization Algorithms for Matching and Pseudoforest},
journal = {CoRR},
volume = {abs/2307.04329},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.04329},
doi = {10.48550/ARXIV.2307.04329},
eprinttype = {arXiv},
eprint = {2307.04329},
timestamp = {Mon, 24 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-04329.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-15286,
author = {Siddharth Gollapudi and
Sepideh Mahabadi and
Varun Sivashankar},
title = {Composable Coresets for Determinant Maximization: Greedy is Almost
Optimal},
journal = {CoRR},
volume = {abs/2309.15286},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.15286},
doi = {10.48550/ARXIV.2309.15286},
eprinttype = {arXiv},
eprint = {2309.15286},
timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-15286.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-00175,
author = {Aditya Bhaskara and
Sepideh Mahabadi and
Ali Vakilian},
title = {Tight Bounds for Volumetric Spanners and Applications},
journal = {CoRR},
volume = {abs/2310.00175},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.00175},
doi = {10.48550/ARXIV.2310.00175},
eprinttype = {arXiv},
eprint = {2310.00175},
timestamp = {Wed, 18 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-00175.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-08122,
author = {Sepideh Mahabadi and
Stojan Trajanovski},
title = {Core-sets for Fair and Diverse Data Summarization},
journal = {CoRR},
volume = {abs/2310.08122},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.08122},
doi = {10.48550/ARXIV.2310.08122},
eprinttype = {arXiv},
eprint = {2310.08122},
timestamp = {Tue, 24 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-08122.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/AumullerHMPS22,
author = {Martin Aum{\"{u}}ller and
Sariel Har{-}Peled and
Sepideh Mahabadi and
Rasmus Pagh and
Francesco Silvestri},
title = {Sampling near neighbors in search for fairness},
journal = {Commun. {ACM}},
volume = {65},
number = {8},
pages = {83--90},
year = {2022},
url = {https://doi.org/10.1145/3543667},
doi = {10.1145/3543667},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cacm/AumullerHMPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tods/AumullerHMPS22,
author = {Martin Aum{\"{u}}ller and
Sariel Har{-}Peled and
Sepideh Mahabadi and
Rasmus Pagh and
Francesco Silvestri},
title = {Sampling a Near Neighbor in High Dimensions - Who is the Fairest of
Them All?},
journal = {{ACM} Trans. Database Syst.},
volume = {47},
number = {1},
pages = {4:1--4:40},
year = {2022},
url = {https://doi.org/10.1145/3502867},
doi = {10.1145/3502867},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tods/AumullerHMPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MahabadiWZ22,
author = {Sepideh Mahabadi and
David P. Woodruff and
Samson Zhou},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Adaptive Sketches for Robust Regression with Importance Sampling},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {31:1--31:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.31},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.31},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/MahabadiWZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-07822,
author = {Sepideh Mahabadi and
David P. Woodruff and
Samson Zhou},
title = {Adaptive Sketches for Robust Regression with Importance Sampling},
journal = {CoRR},
volume = {abs/2207.07822},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.07822},
doi = {10.48550/ARXIV.2207.07822},
eprinttype = {arXiv},
eprint = {2207.07822},
timestamp = {Tue, 19 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-07822.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-00289,
author = {Sepideh Mahabadi and
Thuy{-}Duong Vuong},
title = {Composable Coresets for Constrained Determinant Maximization and Beyond},
journal = {CoRR},
volume = {abs/2211.00289},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.00289},
doi = {10.48550/ARXIV.2211.00289},
eprinttype = {arXiv},
eprint = {2211.00289},
timestamp = {Fri, 04 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-00289.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigmod/AumullerHMPS21,
author = {Martin Aum{\"{u}}ller and
Sariel Har{-}Peled and
Sepideh Mahabadi and
Rasmus Pagh and
Francesco Silvestri},
title = {Fair near neighbor search via sampling},
journal = {{SIGMOD} Rec.},
volume = {50},
number = {1},
pages = {42--49},
year = {2021},
url = {https://doi.org/10.1145/3471485.3471496},
doi = {10.1145/3471485.3471496},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigmod/AumullerHMPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tacl/KhashabiCSHPAAB21,
author = {Daniel Khashabi and
Arman Cohan and
Siamak Shakeri and
Pedram Hosseini and
Pouya Pezeshkpour and
Malihe Alikhani and
Moin Aminnaseri and
Marzieh Bitaab and
Faeze Brahman and
Sarik Ghazarian and
Mozhdeh Gheini and
Arman Kabiri and
Rabeeh Karimi Mahabadi and
Omid Memarrast and
Ahmadreza Mosallanezhad and
Erfan Noury and
Shahab Raji and
Mohammad Sadegh Rasooli and
Sepideh Sadeghi and
Erfan Sadeqi Azer and
Niloofar Safi Samghabadi and
Mahsa Shafaei and
Saber Sheybani and
Ali Tazarv and
Yadollah Yaghoobzadeh},
title = {ParsiNLU: {A} Suite of Language Understanding Challenges for Persian},
journal = {Trans. Assoc. Comput. Linguistics},
volume = {9},
pages = {1147--1162},
year = {2021},
url = {https://doi.org/10.1162/tacl\_a\_00419},
doi = {10.1162/TACL\_A\_00419},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tacl/KhashabiCSHPAAB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BackursMMM21,
author = {Arturs Backurs and
Sepideh Mahabadi and
Konstantin Makarychev and
Yury Makarychev},
editor = {Kevin Buchin and
{\'{E}}ric Colin de Verdi{\`{e}}re},
title = {Two-Sided Kirszbraun Theorem},
booktitle = {37th International Symposium on Computational Geometry, SoCG 2021,
June 7-11, 2021, Buffalo, NY, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {189},
pages = {13:1--13:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2021.13},
doi = {10.4230/LIPICS.SOCG.2021.13},
timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/BackursMMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-10905,
author = {Martin Aum{\"{u}}ller and
Sariel Har{-}Peled and
Sepideh Mahabadi and
Rasmus Pagh and
Francesco Silvestri},
title = {Sampling a Near Neighbor in High Dimensions - Who is the Fairest of
Them All?},
journal = {CoRR},
volume = {abs/2101.10905},
year = {2021},
url = {https://arxiv.org/abs/2101.10905},
eprinttype = {arXiv},
eprint = {2101.10905},
timestamp = {Sun, 31 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-10905.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AndoniB0MW20,
author = {Alexandr Andoni and
Collin Burns and
Yi Li and
Sepideh Mahabadi and
David P. Woodruff},
editor = {Jaroslaw Byrka and
Raghu Meka},
title = {Streaming Complexity of SVMs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
Conference},
series = {LIPIcs},
volume = {176},
pages = {50:1--50:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.50},
doi = {10.4230/LIPICS.APPROX/RANDOM.2020.50},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/AndoniB0MW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChuzhoyMT20,
author = {Julia Chuzhoy and
Sepideh Mahabadi and
Zihan Tan},
editor = {Sandy Irani},
title = {Towards Better Approximation of Graph Crossing Number},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {73--84},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00016},
doi = {10.1109/FOCS46700.2020.00016},
timestamp = {Tue, 08 Jul 2025 16:39:04 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChuzhoyMT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/MahabadiV20,
author = {Sepideh Mahabadi and
Ali Vakilian},
title = {Individual Fairness for k-Clustering},
booktitle = {Proceedings of the 37th International Conference on Machine Learning,
{ICML} 2020, 13-18 July 2020, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {119},
pages = {6586--6596},
publisher = {{PMLR}},
year = {2020},
url = {http://proceedings.mlr.press/v119/mahabadi20a.html},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/MahabadiV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/IndykMGR20,
author = {Piotr Indyk and
Sepideh Mahabadi and
Shayan Oveis Gharan and
Alireza Rezaei},
editor = {Shuchi Chawla},
title = {Composable Core-sets for Determinant Maximization Problems via Spectral
Spanners},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {1675--1694},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.103},
doi = {10.1137/1.9781611975994.103},
timestamp = {Tue, 06 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/IndykMGR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MahabadiRWZ20,
author = {Sepideh Mahabadi and
Ilya P. Razenshteyn and
David P. Woodruff and
Samson Zhou},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Non-adaptive adaptive sampling on turnstile streams},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1251--1264},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384331},
doi = {10.1145/3357713.3384331},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MahabadiRWZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-06742,
author = {Sepideh Mahabadi and
Ali Vakilian},
title = {(Individual) Fairness for k-Clustering},
journal = {CoRR},
volume = {abs/2002.06742},
year = {2020},
url = {https://arxiv.org/abs/2002.06742},
eprinttype = {arXiv},
eprint = {2002.06742},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-06742.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-10969,
author = {Sepideh Mahabadi and
Ilya P. Razenshteyn and
David P. Woodruff and
Samson Zhou},
title = {Non-Adaptive Adaptive Sampling on Turnstile Streams},
journal = {CoRR},
volume = {abs/2004.10969},
year = {2020},
url = {https://arxiv.org/abs/2004.10969},
eprinttype = {arXiv},
eprint = {2004.10969},
timestamp = {Tue, 28 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-10969.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-03633,
author = {Alexandr Andoni and
Collin Burns and
Yi Li and
Sepideh Mahabadi and
David P. Woodruff},
title = {Streaming Complexity of SVMs},
journal = {CoRR},
volume = {abs/2007.03633},
year = {2020},
url = {https://arxiv.org/abs/2007.03633},
eprinttype = {arXiv},
eprint = {2007.03633},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-03633.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-06545,
author = {Julia Chuzhoy and
Sepideh Mahabadi and
Zihan Tan},
title = {Towards Better Approximation of Graph Crossing Number},
journal = {CoRR},
volume = {abs/2011.06545},
year = {2020},
url = {https://arxiv.org/abs/2011.06545},
eprinttype = {arXiv},
eprint = {2011.06545},
timestamp = {Wed, 18 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-06545.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-06154,
author = {Daniel Khashabi and
Arman Cohan and
Siamak Shakeri and
Pedram Hosseini and
Pouya Pezeshkpour and
Malihe Alikhani and
Moin Aminnaseri and
Marzieh Bitaab and
Faeze Brahman and
Sarik Ghazarian and
Mozhdeh Gheini and
Arman Kabiri and
Rabeeh Karimi Mahabadi and
Omid Memarrast and
Ahmadreza Mosallanezhad and
Erfan Noury and
Shahab Raji and
Mohammad Sadegh Rasooli and
Sepideh Sadeghi and
Erfan Sadeqi Azer and
Niloofar Safi Samghabadi and
Mahsa Shafaei and
Saber Sheybani and
Ali Tazarv and
Yadollah Yaghoobzadeh},
title = {ParsiNLU: {A} Suite of Language Understanding Challenges for Persian},
journal = {CoRR},
volume = {abs/2012.06154},
year = {2020},
url = {https://arxiv.org/abs/2012.06154},
eprinttype = {arXiv},
eprint = {2012.06154},
timestamp = {Sat, 02 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-06154.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/MahabadiIGR19,
author = {Sepideh Mahabadi and
Piotr Indyk and
Shayan Oveis Gharan and
Alireza Rezaei},
editor = {Kamalika Chaudhuri and
Ruslan Salakhutdinov},
title = {Composable Core-sets for Determinant Maximization: {A} Simple Near-Optimal
Algorithm},
booktitle = {Proceedings of the 36th International Conference on Machine Learning,
{ICML} 2019, 9-15 June 2019, Long Beach, California, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {97},
pages = {4254--4263},
publisher = {{PMLR}},
year = {2019},
url = {http://proceedings.mlr.press/v97/mahabadi19a.html},
timestamp = {Tue, 06 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icml/MahabadiIGR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/Har-PeledM19,
author = {Sariel Har{-}Peled and
Sepideh Mahabadi},
editor = {Hanna M. Wallach and
Hugo Larochelle and
Alina Beygelzimer and
Florence d'Alch{\'{e}}{-}Buc and
Emily B. Fox and
Roman Garnett},
title = {Near Neighbor: Who is the Fairest of Them All?},
booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference
on Neural Information Processing Systems 2019, NeurIPS 2019, December
8-14, 2019, Vancouver, BC, Canada},
pages = {13176--13187},
year = {2019},
url = {https://proceedings.neurips.cc/paper/2019/hash/742141ceda6b8f6786609d31c8ef129f-Abstract.html},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nips/Har-PeledM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-03534,
author = {Piotr Indyk and
Sepideh Mahabadi and
Ronitt Rubinfeld and
Ali Vakilian and
Anak Yodpinyanee},
title = {Set Cover in Sub-linear Time},
journal = {CoRR},
volume = {abs/1902.03534},
year = {2019},
url = {http://arxiv.org/abs/1902.03534},
eprinttype = {arXiv},
eprint = {1902.03534},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-03534.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-02640,
author = {Sariel Har{-}Peled and
Sepideh Mahabadi},
title = {Near Neighbor: Who is the Fairest of Them All?},
journal = {CoRR},
volume = {abs/1906.02640},
year = {2019},
url = {http://arxiv.org/abs/1906.02640},
eprinttype = {arXiv},
eprint = {1906.02640},
timestamp = {Thu, 13 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-02640.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-03197,
author = {Piotr Indyk and
Sepideh Mahabadi and
Shayan Oveis Gharan and
Alireza Rezaei},
title = {Composable Core-sets for Determinant Maximization: {A} Simple Near-Optimal
Algorithm},
journal = {CoRR},
volume = {abs/1907.03197},
year = {2019},
url = {http://arxiv.org/abs/1907.03197},
eprinttype = {arXiv},
eprint = {1907.03197},
timestamp = {Tue, 06 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-03197.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Har-PeledIM18,
author = {Sariel Har{-}Peled and
Piotr Indyk and
Sepideh Mahabadi},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Approximate Sparse Linear Regression},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {77:1--77:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.77},
doi = {10.4230/LIPICS.ICALP.2018.77},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Har-PeledIM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/IndykMRVY18,
author = {Piotr Indyk and
Sepideh Mahabadi and
Ronitt Rubinfeld and
Ali Vakilian and
Anak Yodpinyanee},
editor = {Artur Czumaj},
title = {Set Cover in Sub-linear Time},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {2467--2486},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.158},
doi = {10.1137/1.9781611975031.158},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/IndykMRVY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MahabadiMMR18,
author = {Sepideh Mahabadi and
Konstantin Makarychev and
Yury Makarychev and
Ilya P. Razenshteyn},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {Nonlinear dimension reduction via outer Bi-Lipschitz extensions},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {1088--1101},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188828},
doi = {10.1145/3188745.3188828},
timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MahabadiMMR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-11648,
author = {Piotr Indyk and
Sepideh Mahabadi and
Shayan Oveis Gharan and
Alireza Rezaei},
title = {Composable Core-sets for Determinant Maximization Problems via Spectral
Spanners},
journal = {CoRR},
volume = {abs/1807.11648},
year = {2018},
url = {http://arxiv.org/abs/1807.11648},
eprinttype = {arXiv},
eprint = {1807.11648},
timestamp = {Tue, 06 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-11648.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-03591,
author = {Sepideh Mahabadi and
Konstantin Makarychev and
Yury Makarychev and
Ilya P. Razenshteyn},
title = {Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions},
journal = {CoRR},
volume = {abs/1811.03591},
year = {2018},
url = {http://arxiv.org/abs/1811.03591},
eprinttype = {arXiv},
eprint = {1811.03591},
timestamp = {Fri, 23 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-03591.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ndltd/Mahabadi17,
author = {Sepideh Mahabadi},
title = {Sublinear algorithms for massive data problems},
school = {Massachusetts Institute of Technology, Cambridge, {USA}},
year = {2017},
url = {https://hdl.handle.net/1721.1/113933},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ndltd/Mahabadi17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/IndykMRUVY17,
author = {Piotr Indyk and
Sepideh Mahabadi and
Ronitt Rubinfeld and
Jonathan R. Ullman and
Ali Vakilian and
Anak Yodpinyanee},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
David Williamson and
Santosh S. Vempala},
title = {Fractional Set Cover in the Streaming Model},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley,
CA, {USA}},
series = {LIPIcs},
volume = {81},
pages = {12:1--12:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.12},
doi = {10.4230/LIPICS.APPROX-RANDOM.2017.12},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/IndykMRUVY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Har-PeledM17,
author = {Sariel Har{-}Peled and
Sepideh Mahabadi},
editor = {Philip N. Klein},
title = {Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor
Search},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1--15},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.1},
doi = {10.1137/1.9781611974782.1},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/Har-PeledM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Har-PeledM17,
author = {Sariel Har{-}Peled and
Sepideh Mahabadi},
title = {{LSH} on the Hypercube Revisited},
journal = {CoRR},
volume = {abs/1704.02546},
year = {2017},
url = {http://arxiv.org/abs/1704.02546},
eprinttype = {arXiv},
eprint = {1704.02546},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Har-PeledM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/IndykKMY16,
author = {Piotr Indyk and
Robert D. Kleinberg and
Sepideh Mahabadi and
Yang Yuan},
editor = {S{\'{a}}ndor P. Fekete and
Anna Lubiw},
title = {Simultaneous Nearest Neighbor Search},
booktitle = {32nd International Symposium on Computational Geometry, SoCG 2016,
June 14-18, 2016, Boston, MA, {USA}},
series = {LIPIcs},
volume = {51},
pages = {44:1--44:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2016.44},
doi = {10.4230/LIPICS.SOCG.2016.44},
timestamp = {Wed, 16 Jun 2021 12:03:34 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/IndykKMY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/Har-PeledIMV16,
author = {Sariel Har{-}Peled and
Piotr Indyk and
Sepideh Mahabadi and
Ali Vakilian},
editor = {Tova Milo and
Wang{-}Chiew Tan},
title = {Towards Tight Bounds for the Streaming Set Cover Problem},
booktitle = {Proceedings of the 35th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2016, San Francisco, CA, USA, June 26
- July 01, 2016},
pages = {371--383},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2902251.2902287},
doi = {10.1145/2902251.2902287},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/Har-PeledIMV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Har-PeledIM16,
author = {Sariel Har{-}Peled and
Piotr Indyk and
Sepideh Mahabadi},
title = {Approximate Sparse Linear Regression},
journal = {CoRR},
volume = {abs/1609.08739},
year = {2016},
url = {http://arxiv.org/abs/1609.08739},
eprinttype = {arXiv},
eprint = {1609.08739},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Har-PeledIM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/IndykKMY16,
author = {Piotr Indyk and
Robert D. Kleinberg and
Sepideh Mahabadi and
Yang Yuan},
title = {Simultaneous Nearest Neighbor Search},
journal = {CoRR},
volume = {abs/1604.02188},
year = {2016},
url = {http://arxiv.org/abs/1604.02188},
eprinttype = {arXiv},
eprint = {1604.02188},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/IndykKMY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Mahabadi15,
author = {Sepideh Mahabadi},
editor = {Piotr Indyk},
title = {Approximate Nearest Line Search in High Dimensions},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {337--354},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.25},
doi = {10.1137/1.9781611973730.25},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/Mahabadi15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Har-PeledM15,
author = {Sariel Har{-}Peled and
Sepideh Mahabadi},
title = {Proximity in the Age of Distraction: Robust Approximate Nearest Neighbor
Search},
journal = {CoRR},
volume = {abs/1511.07357},
year = {2015},
url = {http://arxiv.org/abs/1511.07357},
eprinttype = {arXiv},
eprint = {1511.07357},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Har-PeledM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/IndykMV15,
author = {Piotr Indyk and
Sepideh Mahabadi and
Ali Vakilian},
title = {Towards Tight Bounds for the Streaming Set Cover Problem},
journal = {CoRR},
volume = {abs/1509.00118},
year = {2015},
url = {http://arxiv.org/abs/1509.00118},
eprinttype = {arXiv},
eprint = {1509.00118},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/IndykMV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/IndykMMM14,
author = {Piotr Indyk and
Sepideh Mahabadi and
Mohammad Mahdian and
Vahab S. Mirrokni},
editor = {Richard Hull and
Martin Grohe},
title = {Composable core-sets for diversity and coverage maximization},
booktitle = {Proceedings of the 33rd {ACM} {SIGMOD-SIGACT-SIGART} Symposium on
Principles of Database Systems, PODS'14, Snowbird, UT, USA, June 22-27,
2014},
pages = {100--108},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2594538.2594560},
doi = {10.1145/2594538.2594560},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/IndykMMM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/DemaineIMV14,
author = {Erik D. Demaine and
Piotr Indyk and
Sepideh Mahabadi and
Ali Vakilian},
editor = {Fabian Kuhn},
title = {On Streaming and Communication Complexity of the Set Cover Problem},
booktitle = {Distributed Computing - 28th International Symposium, {DISC} 2014,
Austin, TX, USA, October 12-15, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8784},
pages = {484--498},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-45174-8\_33},
doi = {10.1007/978-3-662-45174-8\_33},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/DemaineIMV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AbbarAIMV13,
author = {Sofiane Abbar and
Sihem Amer{-}Yahia and
Piotr Indyk and
Sepideh Mahabadi and
Kasturi R. Varadarajan},
editor = {Guilherme Dias da Fonseca and
Thomas Lewiner and
Luis Mariano Pe{\~{n}}aranda and
Timothy M. Chan and
Rolf Klein},
title = {Diverse near neighbor problem},
booktitle = {Symposium on Computational Geometry 2013, SoCG '13, Rio de Janeiro,
Brazil, June 17-20, 2013},
pages = {207--214},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2462356.2462401},
doi = {10.1145/2462356.2462401},
timestamp = {Mon, 14 Jun 2021 16:24:55 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AbbarAIMV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/AbbarAIM13,
author = {Sofiane Abbar and
Sihem Amer{-}Yahia and
Piotr Indyk and
Sepideh Mahabadi},
editor = {Daniel Schwabe and
Virg{\'{\i}}lio A. F. Almeida and
Hartmut Glaser and
Ricardo Baeza{-}Yates and
Sue B. Moon},
title = {Real-time recommendation of diverse related articles},
booktitle = {22nd International World Wide Web Conference, {WWW} '13, Rio de Janeiro,
Brazil, May 13-17, 2013},
pages = {1--12},
publisher = {International World Wide Web Conferences Steering Committee / {ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488388.2488390},
doi = {10.1145/2488388.2488390},
timestamp = {Thu, 30 Jan 2025 09:01:37 +0100},
biburl = {https://dblp.org/rec/conf/www/AbbarAIM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2025-07-21 15:47 CEST 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
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: