5 citations · 7 across the 7 of their papers we have counts for
11 papers · 1 filter
Distributed Symmetry Breaking on Hyperbolic Random Graphs
Yannic Maus, Janosch Ruff, Sonia Simons +1
Real-world networks like the internet share patterns like a power law degree distribution and a high clustering coefficient. Many of these properties are captured by the generative…
Towards Optimal Distributed Delta Coloring
Manuel Jakob, Yannic Maus
The -vertex coloring problem has become one of the prototypical problems for understanding the complexity of local distributed graph problems on constant-degree graphs. The majo…
Optimal Deterministic Massively Parallel Connectivity on Forests
Alkida Balliu, Rustam Latypov, Yannic Maus +2
We show fast deterministic algorithms for fundamental problems on forests in the challenging low-space regime of the well-known Massive Parallel Computation (MPC) model. A recent b…
Efficient CONGEST Algorithms for the Lovasz Local Lemma
Yannic Maus, Jara Uitto
We present a poly time randomized CONGEST algorithm for a natural class of Lovasz Local Lemma (LLL) instances on constant degree graphs. This implies, among other thi…
Near-Optimal Scheduling in the Congested Clique
Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin
This paper provides three nearly-optimal algorithms for scheduling jobs in the model. First, we present a deterministic scheduling algorithm that runs in $O(\…
Coloring Fast Without Learning Your Neighbors' Colors
Magnus M. Halldorsson, Fabian Kuhn, Yannic Maus +1
We give an improved randomized CONGEST algorithm for distance- coloring that uses colors and runs in rounds, improving the recent -rou…