38 citations · 178 across the 46 of their papers we have counts for
4 papers · 1 filter
On the Complexity of Local Distributed Graph Problems
Mohsen Ghaffari, Fabian Kuhn, Yannic Maus
This paper is centered on the complexity of graph problems in the well-studied LOCAL model of distributed computing, introduced by Linial [FOCS '87]. It is widely known that for ma…
Multi-Message Broadcast in Dynamic Radio Networks
Mohamad Ahmadi, Fabian Kuhn
We continue the recent line of research studying information dissemination problems in adversarial dynamic radio networks. We give two generic algorithms which allow to transform g…
Polynomial Lower Bound for Distributed Graph Coloring in a Weak LOCAL Model
Dan Hefetz, Fabian Kuhn, Yannic Maus +1
We show an lower bound on the runtime of any deterministic distributed -graph coloring algorithm in a weak vari…
The Cost of Global Broadcast in Dynamic Radio Networks
Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn +1
We study the single-message broadcast problem in dynamic radio networks. We show that the time complexity of the problem depends on the amount of stability and connectivity of the…