8 citations · 42 across the 19 of their papers we have counts for
21 papers · 1 filter
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…
Self-Stabilizing Robots in Highly Dynamic Environments
Marjorie Bournat, Ajoy K. Datta, Swan Dubois
This paper deals with the classical problem of exploring a ring by a cohort of synchronous robots. We focus on the perpetual version of this problem in which it is required that ea…
The Weakest Failure Detector for Eventual Consistency
Swan Dubois, Rachid Guerraoui, Petr Kuznetsov +2
In its classical form, a consistent replicated service requires all replicas to witness the same evolution of the service state. Assuming a message-passing environment with a major…