5 citations · 5 across the 1 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2019
Efficient Deterministic Distributed Coloring with Small Bandwidth
Philipp Bamberger, Fabian Kuhn, Yannic Maus
We show that the -list coloring problem can be solved deterministically in rounds in the \CONGEST model, where is the diameter of t…
cs.DC2019★ 5 cited
On the Complexity of Distributed Splitting Problems
Philipp Bamberger, Mohsen Ghaffari, Fabian Kuhn +2
One of the fundamental open problems in the area of distributed graph algorithms is the question of whether randomization is needed for efficient symmetry breaking. While there are…