8 citations · 42 across the 19 of their papers we have counts for
26 papers
When Should You Wait Before Updating? Toward a Robustness Refinement
Swan Dubois, Laurent Feuilloley, Franck Petit +1
Consider a dynamic network and a given distributed problem. At any point in time, there might exist several solutions that are equally good with respect to the problem specificatio…
Robustness: a New Form of Heredity Motivated by Dynamic Networks
Arnaud Casteigts, Swan Dubois, Franck Petit +1
We investigate a special case of hereditary property in graphs, referred to as {\em robustness}. A property (or structure) is called robust in a graph if it is inherited by all…
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…
Gracefully Degrading Gathering in Dynamic Rings
Marjorie Bournat, Swan Dubois, Franck Petit
Gracefully degrading algorithms [Biely \etal, TCS 2018] are designed to circumvent impossibility results in dynamic systems by adapting themselves to the dynamics. Indeed, such an…
Robustness in Highly Dynamic Networks
Arnaud Casteigts, Swan Dubois, Franck Petit +1
We investigate a special case of hereditary property that we refer to as {\em robustness}. A property is {\em robust} in a given graph if it is inherited by all connected spanning…
Computability of Perpetual Exploration in Highly Dynamic Rings
Marjorie Bournat, Swan Dubois, Franck Petit
We consider systems made of autonomous mobile robots evolving in highly dynamic discrete environment i.e., graphs where edges may appear and disappear unpredictably without any rec…