Swan Dubois

Orcid: 0000-0003-2320-6178

According to our database1, Swan Dubois authored at least 48 papers between 2008 and 2025.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
CALock: Multi-Granularity Locking in Dynamic Hierarchies.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2025

2023
When Should You Wait Before Updating? - Toward a Robustness Refinement.
Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

2020
Robustness: A new form of heredity motivated by dynamic networks.
Theor. Comput. Sci., 2020

Silent MST Approximation for Tiny Memory.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

2019
Introduction to Distributed Self-Stabilizing Algorithms
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, ISBN: 978-3-031-02013-1, 2019

2018
Gracefully Degrading Gathering in Dynamic Rings.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

2017
Robustness in Highly Dynamic Networks.
CoRR, 2017

Asynchronous Approach in the Plane: A Deterministic Polynomial Algorithm.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Computability of Perpetual Exploration in Highly Dynamic Rings.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017

2016
The Next 700 Impossibility Results in Time-Varying Graphs.
Int. J. Netw. Comput., 2016

Self-stabilizing Robots in Highly Dynamic Environments.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

2015
Practically stabilizing SWMR atomic memory in message-passing systems.
J. Comput. Syst. Sci., 2015

Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2015

The Weakest Failure Detector for Eventual Consistency.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

A Generic Framework for Impossibility Results in Time-Varying Graphs.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015

A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

2013
Spéculation et auto-stabilisation
CoRR, 2013

Introducing speculation in self-stabilization: an application to mutual exclusion.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012
Bounding the Impact of Unbounded Attacks in Stabilization.
IEEE Trans. Parallel Distributed Syst., 2012

Self-stabilizing byzantine asynchronous unison.
J. Parallel Distributed Comput., 2012

Mariages et Trahisons
CoRR, 2012

Crash Resilient and Pseudo-Stabilizing Atomic Registers.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies.
Proceedings of the Distributed Computing and Networking - 13th International Conference, 2012

The Byzantine Brides Problem.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011
Tolerating Transient, Permanent, and Intermittent Failures. (Tolérer les fautes transitoires, permanentes et intermittentes).
PhD thesis, 2011

Dynamic FTSS in asynchronous systems: The case of unison.
Theor. Comput. Sci., 2011

Stabilizing data-link over non-FIFO channels with optimal fault-resilience.
Inf. Process. Lett., 2011

A Taxonomy of Daemons in Self-stabilization
CoRR, 2011

Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalité du Protocole min+1
CoRR, 2011

Communication Optimalement Stabilisante sur Canaux non Fiables et non FIFO
CoRR, 2011

Self-Stabilization, Byzantine Containment, and Maximizable Metrics: Necessary Conditions
CoRR, 2011

Maximum Metric Spanning Tree Made Byzantine Tolerant.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

2010
Practically Stabilizing Atomic Memory
CoRR, 2010

On Byzantine Containment Properties of the $min+1$ Protocol
CoRR, 2010

Self-stabilization with Byzantine tolerance for global tasks
CoRR, 2010

Construction auto-stabilisante d'arbre couvrant en dépit d'actions malicieuses
CoRR, 2010

The Impact of Topology on Byzantine Containment in Stabilization.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Brief Announcement: Sharing Memory in a Self-stabilizing Manner.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

On Byzantine Containment Properties of the <i>min</i> + 1 Protocol.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Snap-Stabilizing Linear Message Forwarding.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Self-stabilizing Byzantine Asynchronous Unison<sup>, </sup>.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

2009
Two snap-stabilizing point-to-point communication protocols in message-switched networks
CoRR, 2009

Une CNS pour l'acheminement de messages instantanément stabilisant
CoRR, 2009

Brief Announcement: Dynamic FTSS in Asynchronous Systems: The Case of Unison.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity?
Proceedings of the Stabilization, 2009

A snap-stabilizing point-to-point communication protocol in message-switched networks.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008
On co-distance hereditary graphs.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008


  Loading...