34 citations · 170 across the 44 of their papers we have counts for
6 papers · 1 filter
Physical expander in Virtual Tree Overlay
Taisuke Izumi, Maria Potop-Butucaru, Mathieu Valero
In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust trees over…
Optimal deterministic ring exploration with oblivious asynchronous robots
Anissa Lamani, Maria Potop-Butucaru, Sébastien Tixeuil
We consider the problem of exploring an anonymous unoriented ring of size by identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the…
A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property
Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis +1
The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Self-stabilization is versat…
Dynamic FTSS in Asynchronous Systems: the Case of Unison
Swan Dubois, Maria Potop-Butucaru, Sébastien Tixeuil
Distributed fault-tolerance can mask the effect of a limited number of permanent faults, while self-stabilization provides forward recovery after an arbitrary number of transient f…
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…