1 citations · 1 across the 4 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DC2019
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…
cs.DC2019
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…