( en | de | ru )

 

Disambiguation of "Mahabadi, Sepideh"

Author of the publication

copydeleteadd this publication to your clipboard
Non-adaptive adaptive sampling on turnstile streams.

, , , and . STOC, page 1251-1264. ACM, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sepideh Mahabadi

Sepideh Abhari

Bijan Mahabadi

Mehdi Mahabadi

Sepideh Salimi

 

Other publications of authors with the same name

Efficiently Computing Similarities to Private Datasets., , , , and . CoRR, (2024)Streaming Complexity of SVMs., , , , and . APPROX-RANDOM, volume 176 of LIPIcs, page 50:1-50:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Sampling a Near Neighbor in High Dimensions - Who is the Fairest of Them All?, , , , and . CoRR, (2021)Improved Diversity Maximization Algorithms for Matching and Pseudoforest., and . APPROX/RANDOM, volume 275 of LIPIcs, page 25:1-25:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Individual Fairness for k-Clustering., and . ICML, volume 119 of Proceedings of Machine Learning Research, page 6586-6596. PMLR, (2020)Fair near neighbor search via sampling., , , , and . SIGMOD Rec., 50 (1): 42-49 (2021)Real-time recommendation of diverse related articles., , , and . WWW, page 1-12. International World Wide Web Conferences Steering Committee / ACM, (2013)Two-Sided Kirszbraun Theorem., , , and . SoCG, volume 189 of LIPIcs, page 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Approximation Algorithms for Fair Range Clustering., , and . ICML, volume 202 of Proceedings of Machine Learning Research, page 13270-13284. PMLR, (2023)Fractional Set Cover in the Streaming Model., , , , , and . APPROX-RANDOM, volume 81 of LIPIcs, page 12:1-12:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)