1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
Lelia Blin, Sylvain Gay, Isabella Ziccardi
We study the self-stabilizing leader election problem in anonymous -nodes networks. Achieving self-stabilization with low space memory complexity is particularly challenging, an…
Ressource Efficient Stabilization for Local Tasks despite Unknown Capacity Links
Lélia Blin, Anaïs Durand, Sébastien Tixeuil
Self-stabilizing protocols enable distributed systems to recover correct behavior starting from any arbitrary configuration. In particular, when processors communicate by message p…
Silent MST approximation for tiny memory
Lélia Blin, Swan Dubois, Laurent Feuilloley
In this paper we show that approximation can help reduce the space used for self-stabilization. In the classic \emph{state model}, where the nodes of a network communicate by readi…
Compact Self-Stabilizing Leader Election for Arbitrary Networks
Lélia Blin, Sébastien Tixeuil
We present a self-stabilizing leader election algorithm for arbitrary networks, with space-complexity bits per node in -node networks with maxim…