1 citations · 1 across the 5 of their papers we have counts for
4 papers · 1 filter
Local Distributed Computation under Crash Failures
Diana Ghinea, Fabian Kuhn, Chen-Da Liu-Zhang +1
We study deterministic algorithms for locally checkable graph problems in the synchronous LOCAL model with crash failures, where a crashing node may send messages to only some neig…
Greedy-Like Defective Coloring: Distributed Algorithms and Applications
Marc Fuchs, Fabian Kuhn
A -defective -coloring of a graph is a coloring of the nodes with colors such that every node has at most neighbors of the same color. Distributed algor…
The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size
Alkida Balliu, Sebastian Brandt, Fabian Kuhn +3
One of the central models in distributed computing is Linial's LOCAL model [SIAM J. Comp. 1992]. Over time, researchers have studied distributed graph problems in the LOCAL model u…
Distributed -Coloring in Graphs of Bounded Neighborhood Independence
Marc Fuchs, Fabian Kuhn
The distributed coloring problem is arguably one of the key problems studied in the area of distributed graph algorithms. The most standard variant of the problem asks for a proper…