This paper presents an improved and time-optimal self-stabilizing algorithm for a major task
in distributed computing-a rooted spanning tree construction. Our solution is decentralized …

Résumé The journey recounted in this document spanned a period of about 10 years, from
the end of the PhD (2007) to current (early 2018). The rst ve years correspond to two …

We consider the problem of completely covering an unknown discrete environment with a
swarm of asynchronous, frequently-crashing autonomous mobile robots. We represent the …

This document is the first part of the author's habilitation thesis (HDR), defended on June 4,
2018 at the University of Bordeaux. Given the nature of this document, the contributions that …

We address the problem of building and maintaining a forest of spanning trees in highly
dynamic networks, in which topological events can occur at any time and any rate, and no …

Highly dynamic networks are characterized by frequent changes in the availability of
communication links. Many of these networks are in general partitioned into several …

The purpose of this article (based on an earlier draft available as technical report: Gruner S,
Mobile agent systems and cellular automata. LaBRI Research Reports, 2006) is to make a …

Highly dynamic networks are characterized by frequent changes in the availability of
communication links. These networks are often partitioned into several components, which …

Assistance tools for actors of cooperative systems, which are often centralized are
increasingly designed to adhere to the system organization using a distributed architecture …

Leader election problem is among the important problems in distributed computing. The
continued evolution of distributed systems keeps the distributed computing an open area of …