Author of the publication

Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping.

, , , , and . DISC, volume 179 of LIPIcs, page 40:1-40:3. 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

Efficient Load-Balancing through Distributed Token Dropping., , , , and . CoRR, (2020)Conditionally Optimal Parallel Coloring of Forests., , , , and . DISC, volume 281 of LIPIcs, page 23:1-23:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation., , , , and . PODC, page 471-480. ACM, (2019)Optimal Deterministic Massively Parallel Connectivity on Forests., , , , and . CoRR, (2022)Efficient CONGEST Algorithms for the Lovasz Local Lemma., and . CoRR, (2021)Breaking the linear-memory barrier in MPC: Fast MIS on trees with strongly sublinear memory., , and . Theor. Comput. Sci., (2021)Navigating an Infinite Space with Unreliable Movements., and . SODA, page 1170-1179. SIAM, (2020)A (3 + ɛ)-Approximate Correlation Clustering Algorithm in Dynamic Streams., , , , and . SODA, page 2861-2880. SIAM, (2024)Exponential Speedup over Locality in MPC with Optimal Memory., , , , , , and . DISC, volume 246 of LIPIcs, page 9:1-9:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Massively Parallel Correlation Clustering in Bounded Arboricity Graphs., , , and . DISC, volume 209 of LIPIcs, page 15:1-15:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)