Author of the publication

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)

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

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)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)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)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)Deterministic (1+ε)-approximate maximum matching with poly(1/ε) passes in the semi-streaming model and beyond., , and . STOC, page 248-260. ACM, (2022)Improved distributed degree splitting and edge coloring., , , , , and . Distributed Comput., 33 (3-4): 293-310 (2020)Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma., , , , and . ACM Trans. Algorithms, 16 (1): 8:1-8:51 (2020)Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation., and . SODA, page 1636-1653. SIAM, (2019)