Author of the publication

Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings.

, , and . ESA, volume 244 of LIPIcs, page 63:1-63:14. 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

Hop-Constrained Oblivious Routing., , and . CoRR, (2020)Fast and Simple Algorithms for Computing both LCSk and LCSk+., , , , and . Stringology, page 50-62. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2018)Undirected (1+ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms., , , , and . STOC, page 478-487. ACM, (2022)Fast and simple algorithms for computing both $LCS_k$ and $LCS_k+$., , , , and . CoRR, (2017)Sparse Semi-Oblivious Routing: Few Random Paths Suffice., , and . PODC, page 222-232. ACM, (2023)Universally-optimal distributed algorithms for known topologies., , and . STOC, page 1166-1179. ACM, (2021)Universally-Optimal Distributed Exact Min-Cut., and . PODC, page 281-291. ACM, (2022)Tree embeddings for hop-constrained network design., , and . STOC, page 356-369. ACM, (2021)A Simple Boosting Framework for Transshipment.. ESA, volume 274 of LIPIcs, page 104:1-104:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts., , , , and . DISC, volume 246 of LIPIcs, page 6:1-6:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)