7 citations · 15 across the 5 of their papers we have counts for
3 papers · 1 filter
Design Patterns in Beeping Algorithms: Examples, Emulation, and Analysis
Arnaud Casteigts, Yves Métivier, John Michael Robson +1
We consider networks of processes which interact with beeps. In the basic model defined by Cornejo and Kuhn (2010), processes can choose in each round either to beep or to listen.…
Counting in One-Hop Beeping Networks
A. Casteigts, Y. Métivier, J. M. Robson +1
We consider networks of processes which interact with beeps. In the basic model defined by Cornejo and Kuhn, which we refer to as the variant, processes can choose in each rou…
Deterministic Leader Election Takes Bit Rounds
Arnaud Casteigts, Yves Métivier, John Michael Robson +1
Leader election is, together with consensus, one of the most central problems in distributed computing. This paper presents a distributed algorithm, called \STT, for electing deter…