Maximilian Probst Gutenberg

Maximilian Probst Gutenberg

Ph.d.-studerende


Udgivelsesår:
  1. 2019
  2. Udgivet

    Decremental strongly-connected components and single-source reachability in near-linear time

    Bernstein, A., Gutenberg, Maximilian Probst & Wulff-Nilsen, Christian, 2019, STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Charikar, M. & Cohen, E. (red.). Association for Computing Machinery, s. 365-376 12 s. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

  3. 2020
  4. Udgivet

    Decremental SSSP in weighted digraphs: Faster and against an adaptive adversary

    Gutenberg, Maximilian Probst & Wulff-Nilsen, Christian, 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (red.). Association for Computing Machinery, s. 2542-2561

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

  5. Udgivet

    Deterministic algorithms for decremental approximate shortest paths: Faster and Simpler

    Gutenberg, Maximilian Probst & Wulff-Nilsen, Christian, 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (red.). Association for Computing Machinery, s. 2522-2541

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

  6. Udgivet

    Fully-dynamic all-pairs shortest paths: Improved worst-case time and space bounds

    Gutenberg, Maximilian Probst & Wulff-Nilsen, Christian, 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (red.). Association for Computing Machinery, s. 2562-2574

    Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

ID: 164844502