7 citations · 10 across the 9 of their papers we have counts for
11 papers
Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition
Arnaud Casteigts, Yves Métivier, John Michael Robson
This paper revisits two classical distributed problems in anonymous networks, namely spanning tree construction and topology recognition, from the point of view of graph covering t…
Robustness: a New Form of Heredity Motivated by Dynamic Networks
Arnaud Casteigts, Swan Dubois, Franck Petit +1
We investigate a special case of hereditary property in graphs, referred to as {\em robustness}. A property (or structure) is called robust in a graph if it is inherited by all…
Robustness in Highly Dynamic Networks
Arnaud Casteigts, Swan Dubois, Franck Petit +1
We investigate a special case of hereditary property that we refer to as {\em robustness}. A property is {\em robust} in a given graph if it is inherited by all connected spanning…
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…