5 citations · 24 across the 12 of their papers we have counts for
14 papers
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…
What Can Be Computed Locally Revisited: First-Order Logic on Sparse Graphs in Distributed Computing
Lélia Blin, Fedor V. Fomin, Pierre Fraigniaud +5
The question of 'what can be computed locally?' lies at the heart of distributed computing in networks. As established in Naor and Stockmeyer's seminal paper (STOC 1993), this ques…
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…
Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms
Lélia Blin, Laurent Feuilloley, Gabriel Le Bouder
Given a boolean predicate on labeled networks (e.g., proper coloring, leader election, etc.), a self-stabilizing algorithm for is a distributed algorithm that can start fro…
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…
Polynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction
Lélia Blin, Pierre Fraigniaud
Motivated by applications to sensor networks, as well as to many other areas, this paper studies the construction of minimum-degree spanning trees. We consider the classical node-r…
Compact Deterministic Self-Stabilizing Leader Election: The Exponential Advantage of Being Talkative
Lélia Blin, Sébastien Tixeuil
This paper focuses on compact deterministic self-stabilizing solutions for the leader election problem. When the protocol is required to be \emph{silent} (i.e., when communication…
Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme
Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru +1
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is bits and it converges in r…
Fast Self-Stabilizing Minimum Spanning Tree Construction
Lélia Blin, Shlomi Dolev, Maria Potop-Butucaru +1
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is bits and it converges in r…
Universal Loop-Free Super-Stabilization
Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis +1
We propose an univesal scheme to design loop-free and super-stabilizing protocols for constructing spanning trees optimizing any tree metrics (not only those that are isomorphic to…
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…
A Superstabilizing -Approximation Algorithm for Dynamic Steiner Trees
Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis
In this paper we design and prove correct a fully dynamic distributed algorithm for maintaining an approximate Steiner tree that connects via a minimum-weight spanning tree a subse…
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…