7 citations · 15 across the 5 of their papers we have counts for
6 papers
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…
On Distributed Computing with Beeps
Y. Métivier, J. M. Robson, A. Zemmari
We consider networks of processes which interact with beeps. Various beeping models are used. The basic one, defined by Cornejo and Kuhn [CK10], assumes that a process can choose e…
A Distributed Enumeration Algorithm and Applications to All Pairs Shortest Paths, Diameter
Y. Métivier, J. M. Robson, A. Zemmari
We consider the standard message passing model; we assume the system is fully synchronous: all processes start at the same time and time proceeds in synchronised rounds. In each ro…
Termination Detection of Local Computations
Emmanuel Godard, Yves Métivier, Gerard Tel
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble…