11 citations · 14 across the 2 of their papers we have counts for
4 papers
Computing a Maximal Independent Set Using Beeps
Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn
We consider the problem of finding a maximal independent set (MIS) in the discrete beeping model. At each time, a node in the network can either beep (i.e., emit a signal) or be si…
Gradient Clock Synchronization using Reference Broadcasts
Fabian Kuhn, Rotem Oshman
In this paper we suggest a method by which reference broadcast synchronization (RBS), and other methods of estimating clock values, can be incorporated in standard clock synchroniz…
Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time
Fabian Kuhn
The described multicoloring problem has direct applications in the context of wireless ad hoc and sensor networks. In order to coordinate the access to the shared wireless medium,…
Distributed (Delta + 1)-coloring in linear (in Delta) time
Leonid Barenboim, Michael Elkin
The distributed (Delta + 1)-coloring problem is one of most fundamental and well-studied problems of Distributed Algorithms. Starting with the work of Cole and Vishkin in 86, there…