Author of the publication

Improved Bounds for Distributed Load Balancing.

, , and . DISC, volume 179 of LIPIcs, page 1:1-1:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

 

Other publications of authors with the same name

Distributed and Streaming Linear Programming in Low Dimensions., , and . PODS, page 236-253. ACM, (2019)Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons., , , and . COLT, volume 65 of Proceedings of Machine Learning Research, page 39-75. PMLR, (2017)Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms., , , and . CoRR, (2022)Tight Bounds for Vertex Connectivity in Dynamic Streams., and . CoRR, (2022)Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets., , and . HCOMP, page 12-21. AAAI Press, (2015)Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems., , , and . FOCS, page 354-364. IEEE, (2020)Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate Matchings., and . FOCS, page 909-932. IEEE, (2023)Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach., and . ESA, volume 204 of LIPIcs, page 8:1-8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Improved Bounds for Distributed Load Balancing., , and . DISC, volume 179 of LIPIcs, page 1:1-1:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Stochastic Submodular Cover with Limited Adaptivity., , and . SODA, page 323-342. SIAM, (2019)