8 citations · 36 across the 21 of their papers we have counts for
17 papers · 1 filter
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…
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…
Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems
Swan Dubois, Mohamed-Hamza Kaaouachi, Franck Petit
We address the problem of computing a Minimal Dominating Set in highly dynamic distributed systems. We assume weak connectivity, i.e., the network may be disconnected at each time…
The Next 700 Impossibility Results in Time-Varying Graphs
Nicolas Braud-Santoni, Swan Dubois, Mohamed-Hamza Kaaouachi +1
We address highly dynamic distributed systems modeled by time-varying graphs (TVGs). We interest in proof of impossibility results that often use informal arguments about convergen…