Author of the publication

Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality.

, , and . STOC, page 1325-1338. ACM, (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

Randomized Pursuit-Evasion in Graphs., , , , and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 901-912. Springer, (2002)Tight Bounds for Online Graph Partitioning., , , and . CoRR, (2020)Tight Bounds for Online Graph Partitioning., , , and . SODA, page 2799-2818. SIAM, (2021)Electrical Flows for Polylogarithmic Competitive Oblivious Routing., , , , and . ITCS, volume 287 of LIPIcs, page 55:1-55:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality., , and . STOC, page 1325-1338. ACM, (2022)The Expander Hierarchy and its Applications to Dynamic Graph Algorithms., , , and . SODA, page 2212-2228. SIAM, (2021)An $O(k)$-Competitive Algorithm for Generalized Caching, , , and . SODA, page 1681--1689. SIAM, (2012)Online Balanced Repartitioning of Dynamic Communication Patterns in Polynomial Time., , and . APOCS, page 40-54. SIAM, (2021)Compact Oblivious Routing., and . ESA, volume 144 of LIPIcs, page 75:1-75:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Polylogarithmic Guarantees for Generalized Reordering Buffer Management., , and . FOCS, page 38-59. IEEE Computer Society, (2019)