16 citations · 28 across the 12 of their papers we have counts for
4 papers · 1 filter
Stabilizing Maximal Independent Set in Unidirectional Networks is Hard
Toshimitsu Masuzawa, Sébastien Tixeuil
A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the system recovers from this catastrophic situa…
Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots
Stéphane Devismes, Franck Petit, Sébastien Tixeuil
We consider a team of identical, oblivious, asynchronous mobile robots that are able to sense (\emph{i.e.}, view) their environment, yet are unable to communicate, and evolve o…
Bounds for self-stabilization in unidirectional networks
Samuel Bernard, Stéphane Devismes, Maria Gradinariu Potop-Butucaru +1
A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the systems recovers from this catastrophic situ…
On the Self-stabilization of Mobile Robots in Graphs
Lélia Blin, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil
Self-stabilization is a versatile technique to withstand any transient fault in a distributed system. Mobile robots (or agents) are one of the emerging trends in distributed comput…