1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2022
Derandomizing Directed Random Walks in Almost-Linear Time
Rasmus Kyng, Simon Meierhans, Maximilian Probst Gutenberg
In this article, we present the first deterministic directed Laplacian L systems solver that runs in time almost-linear in the number of non-zero entries of L. Previous reductions…
cs.DS2019
Decremental Strongly-Connected Components and Single-Source Reachability in Near-Linear Time
Aaron Bernstein, Maximilian Probst, Christian Wulff-Nilsen
Computing the Strongly-Connected Components (SCCs) in a graph is known to take only time using an algorithm by Tarjan from 1972[SICOMP 72] where , $n=…
cs.DS2018★ 1 cited
On the complexity of the (approximate) nearest colored node problem
Maximilian Probst
Given a graph where each vertex is assigned a color from the set . In the (approximate) nearest colored node problem, we want to query, given $v…