Author of the publication

Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch.

, , and . STOC, page 1173-1186. ACM, (2023)

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

Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications., , and . SODA, page 1226-1245. SIAM, (2021)Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models., , , and . SIAM J. Comput., 50 (3): 815-856 (2021)Minor Sparsifiers and the Distributed Laplacian Paradigm., , , , , and . FOCS, page 989-999. IEEE, (2021)Minor Sparsifiers and the Distributed Laplacian Paradigm., , , , , and . CoRR, (2020)Faster Cut Sparsification of Weighted Graphs., and . ICALP, volume 229 of LIPIcs, page 61:1-61:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths., , , and . ICALP, volume 297 of LIPIcs, page 58:1-58:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms., , , , and . SODA, page 2046-2065. SIAM, (2020)Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique., and . PODC, page 75-78. ACM, (2023)Deterministic Incremental APSP with Polylogarithmic Update Time and Stretch., , and . STOC, page 1173-1186. ACM, (2023)A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching., , and . SODA, page 1899-1918. SIAM, (2019)