49 citations · 94 across the 10 of their papers we have counts for
3 papers · 1 filter
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…
Election algorithms with random delays in trees
Jean-François Marckert, Nasser Saheb-Djahromi, Akka Zemmari
The election is a classical problem in distributed algorithmic. It aims to design and to analyze a distributed algorithm choosing a node in a graph, here, in a tree. In this paper,…
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…