2 papers
cs.DC2016
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…
cs.DC2015
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…