( en | de | ru )

 

Disambiguation of "Gutenberg, Maximilian Probst"

Author of the publication

copydeleteadd this publication to your clipboard
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.

Andrea Gutenberg

Angelika Gutenberg

Norbert Gutenberg

Angelika Gutenberg

Andrea Gutenberg

 

Other publications of authors with the same name

A Simple Framework for Finding Balanced Sparse Cuts via APSP., , , and . CoRR, (2022)Maximum Flow and Minimum-Cost Flow in Almost-Linear Time., , , , , and . FOCS, page 612-623. IEEE, (2022)Decremental APSP in Unweighted Digraphs Versus an Adaptive Adversary., , , and . ICALP, volume 198 of LIPIcs, page 64:1-64:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary., , , , , , and . CoRR, (2020)Near-Optimal Algorithms for Reachability, Strongly-Connected Components and Shortest Paths in Partially Dynamic Digraphs.. CoRR, (2020)Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow., , , , and . CoRR, (2023)Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time., , , , , , , and . SODA, page 2980-2998. SIAM, (2024)Deterministic Decremental SSSP and Approximate Min-Cost Flow in Almost-Linear Time., , and . CoRR, (2021)Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler., and . SODA, page 2522-2541. SIAM, (2020)Decremental SSSP in Weighted Digraphs: Faster and Against an Adaptive Adversary., and . SODA, page 2542-2561. SIAM, (2020)