5 citations · 5 across the 1 of their papers we have counts for
3 papers
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…
cs.DS2018
Local Distributed Algorithms in Highly Dynamic Networks
Philipp Bamberger, Fabian Kuhn, Yannic Maus
The present paper studies local distributed graph problems in highly dynamic networks. Communication and changes of the graph happen in synchronous rounds and our algorithms always…