32 citations · 76 across the 27 of their papers we have counts for
4 papers · 1 filter
Introduction to local certification
Laurent Feuilloley
A distributed graph algorithm is basically an algorithm where every node of a graph can look at its neighborhood at some distance in the graph and chose its output. As distributed…
Note on distributed certification of minimum spanning trees
Laurent Feuilloley
A distributed proof (also known as local certification, or proof-labeling scheme) is a mechanism to certify that the solution to a graph problem is correct. It takes the form of an…
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…