E-LIB Suche - Ergebnisse für: Probst, Maximilian

1

The Power of Anchor Text in the Neural Retrieval Era:

, In: Lecture Notes in Computer Science; Advances in Information Retrieval,

Fröbe, Maik ; Günther, Sebastian ; Probst, Maximilian.. - p. 567-583 , 2022

Link: https://doi.org/10.1007/..

2

Derandomizing Directed Random Walks in Almost-Linear Time:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),

Kyng, Rasmus ; Meierhans, Simon ; Probst, Maximilian - p. 407-418 , 2022

Link: https://doi.org/10.1109/..

3

Decremental strongly-connected components and single-source..:

, In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing,

Bernstein, Aaron ; Probst, Maximilian ; Wulff-Nilsen, Christian - p. 365-376 , 2019

Link: https://dl.acm.org/doi/1..

4

Die Verblendung der Kunst

Passagen Forum

Virilio, Paul ; Probst, Maximilian ; Engelmann, Peter - Dt. Erstausg. . , 2008

Copies: :TB Technik K I Vir; Zentrale:E04 a kun 041.8 vir/783

5

Almost-Linear Time Algorithms for Incremental Graphs: Cycle..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,

Chen, Li ; Kyng, Rasmus ; Liu, Yang P... - p. 1165-1173 , 2024

Link: https://dl.acm.org/doi/1..

6

A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Spa..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,

Kyng, Rasmus ; Meierhans, Simon ; Probst Gutenberg, Maximilian - p. 1174-1183 , 2024

Link: https://dl.acm.org/doi/1..

7

Deterministic Incremental APSP with Polylogarithmic Update ..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,

Forster, Sebastian ; Nazari, Yasamin ; Probst Gutenberg, Maximilian - p. 1173-1186 , 2023

Link: https://dl.acm.org/doi/1..

8

New algorithms and hardness for incremental single-source s..:

, In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing,

Probst Gutenberg, Maximilian ; Vassilevska Williams, Virginia ; Wein, Nicole - p. 153-166 , 2020

Link: https://dl.acm.org/doi/1..

9

A Deterministic Almost-Linear Time Algorithm for Minimum-Co..:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),

Brand, Jan Van Den ; Chen, Li ; Kyng, Rasmus... - p. 503-514 , 2023

Link: https://doi.org/10.1109/..

10

Almost-Linear-Time Algorithms for Maximum Flow and Minimum-..:

Chen, Li ; Kyng, Rasmus ; Liu, Yang P....
Communications of the ACM. 66 (2023) 12 - p. 85-92 , 2023

Link: https://doi.org/10.1145/..

11

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),

Chen, Li ; Kyng, Rasmus ; Liu, Yang P.... - p. 612-623 , 2022

Link: https://doi.org/10.1109/..

12

Deterministic Decremental SSSP and Approximate Min-Cost Flo..:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),

Bernstein, Aaron ; Gutenberg, Maximilian Probst ; Saranurak, Thatchaphol - p. 1000-1008 , 2022

Link: https://doi.org/10.1109/..

13

New techniques and fine-grained hardness for dynamic near-a..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,

Bergamaschi, Thiago ; Henzinger, Monika ; Gutenberg, Maximilian Probst.. - p. 1836-1855 , 2021

Link: https://dl.acm.org/doi/1..

14

New Techniques and Fine-Grained Hardness for Dynamic Near-A..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),

Bergamaschi, Thiago ; Henzinger, Monika ; Gutenberg, Maximilian Probst.. - p. 1836-1855 , 2021

Link: https://doi.org/10.1137/..

15

Decremental Strongly Connected Components and Single-Source..:

Bernstein, Aaron ; Gutenberg, Maximilian Probst ; Wulff-Nilsen, Christian
SIAM Journal on Computing. 52 (2021) 2 - p. STOC19-128-STOC19-155 , 2021

Link: https://doi.org/10.1137/..