default search action
Swan Dubois
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c25]Swan Dubois, Laurent Feuilloley, Franck Petit, Mikaël Rabie:
When Should You Wait Before Updating? - Toward a Robustness Refinement. SAND 2023: 7:1-7:15 - [i32]Swan Dubois, Laurent Feuilloley, Franck Petit, Mikaël Rabie:
When Should You Wait Before Updating? Toward a Robustness Refinement. CoRR abs/2304.05831 (2023) - 2020
- [j14]Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson:
Robustness: A new form of heredity motivated by dynamic networks. Theor. Comput. Sci. 806: 429-445 (2020) - [c24]Lélia Blin
, Swan Dubois, Laurent Feuilloley
Silent MST Approximation for Tiny Memory. SSS 2020: 118-132
2010 – 2019
- 2019
- [b2]Karine Altisen, Stéphane Devismes
Introduction to Distributed Self-Stabilizing Algorithms. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2019, ISBN 978-3-031-00885-6 - [j13]Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné
Asynchronous approach in the plane: a deterministic polynomial algorithm. Distributed Comput. 32(4): 317-337 (2019) - [j12]Swan Dubois, Rachid Guerraoui
The weakest failure detector for eventual consistency. Distributed Comput. 32(6): 479-492 (2019) - [j11]Marjorie Bournat, Ajoy K. Datta, Swan Dubois:
Self-stabilizing robots in highly dynamic environments. Theor. Comput. Sci. 772: 88-110 (2019) - [i31]Arnaud Casteigts, Swan Dubois, Franck Petit, John Michael Robson:
Robustness: a New Form of Heredity Motivated by Dynamic Networks. CoRR abs/1905.04106 (2019) - [i30]Lélia Blin, Swan Dubois, Laurent Feuilloley:
Silent MST approximation for tiny memory. CoRR abs/1905.08565 (2019) - 2018
- [j10]Lélia Blin
A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon. J. Parallel Distributed Comput. 117: 50-62 (2018) - [c23]Marjorie Bournat, Swan Dubois, Franck Petit:
Gracefully Degrading Gathering in Dynamic Rings. SSS 2018: 349-364 - [i29]Marjorie Bournat, Swan Dubois
Gracefully Degrading Gathering in Dynamic Rings. CoRR abs/1805.05137 (2018) - 2017
- [c22]Marjorie Bournat, Swan Dubois
Computability of Perpetual Exploration in Highly Dynamic Rings. ICDCS 2017: 794-804 - [c21]Sébastien Bouchard
Asynchronous Approach in the Plane: A Deterministic Polynomial Algorithm. DISC 2017: 8:1-8:16 - [i28]Arnaud Casteigts, Swan Dubois
Robustness in Highly Dynamic Networks. CoRR abs/1703.03190 (2017) - 2016
- [j9]Nicolas Braud-Santoni, Swan Dubois, Mohamed-Hamza Kaaouachi, Franck Petit
The Next 700 Impossibility Results in Time-Varying Graphs. Int. J. Netw. Comput. 6(1): 27-41 (2016) - [c20]Marjorie Bournat, Ajoy K. Datta, Swan Dubois
Self-stabilizing Robots in Highly Dynamic Environments. SSS 2016: 54-69 - [i27]Marjorie Bournat, Ajoy K. Datta, Swan Dubois
Self-Stabilizing Robots in Highly Dynamic Environments. CoRR abs/1609.06161 (2016) - [i26]Sébastien Bouchard, Marjorie Bournat, Yoann Dieudonné, Swan Dubois
Asynchronous approach in the plane: A deterministic polynomial algorithm. CoRR abs/1612.02168 (2016) - [i25]Marjorie Bournat, Swan Dubois
Computability of Perpetual Exploration in Highly Dynamic Rings. CoRR abs/1612.05767 (2016) - 2015
- [j8]Swan Dubois
Maximum Metric Spanning Tree Made Byzantine Tolerant. Algorithmica 73(1): 166-201 (2015) - [j7]Noga Alon, Hagit Attiya
Practically stabilizing SWMR atomic memory in message-passing systems. J. Comput. Syst. Sci. 81(4): 692-701 (2015) - [c19]Nicolas Braud-Santoni
A Generic Framework for Impossibility Results in Time-Varying Graphs. IPDPS Workshops 2015: 483-489 - [c18]Lélia Blin, Fadwa Boubekeur, Swan Dubois
A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent Daemon. IPDPS 2015: 1065-1074 - [c17]Swan Dubois
The Weakest Failure Detector for Eventual Consistency. PODC 2015: 375-384 - [c16]Swan Dubois
Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems. SSS 2015: 51-66 - [i24]Swan Dubois
Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems. CoRR abs/1502.00378 (2015) - [i23]Swan Dubois
The Weakest Failure Detector for Eventual Consistency. CoRR abs/1505.03469 (2015) - 2014
- [i22]Nicolas Braud-Santoni, Swan Dubois
The Next 700 Impossibility Results in Time-Varying Graphs. CoRR abs/1412.6007 (2014) - 2013
- [j6]Alain Cournier, Swan Dubois
The snap-stabilizing message forwarding algorithm on tree topologies. Theor. Comput. Sci. 496: 89-112 (2013) - [c15]Swan Dubois
Introducing speculation in self-stabilization: an application to mutual exclusion. PODC 2013: 290-298 - [i21]Swan Dubois
Introducing Speculation in Self-Stabilization - An Application to Mutual Exclusion. CoRR abs/1302.2217 (2013) - [i20]Swan Dubois
Spéculation et auto-stabilisation. CoRR abs/1304.6994 (2013) - 2012
- [j5]Swan Dubois
Self-stabilizing byzantine asynchronous unison. J. Parallel Distributed Comput. 72(7): 917-923 (2012) - [j4]Swan Dubois
Bounding the Impact of Unbounded Attacks in Stabilization. IEEE Trans. Parallel Distributed Syst. 23(3): 460-466 (2012) - [c14]Swan Dubois
The Byzantine Brides Problem. FUN 2012: 107-118 - [c13]Alain Cournier, Swan Dubois
Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies. ICDCN 2012: 46-60 - [c12]Shlomi Dolev, Swan Dubois
Crash Resilient and Pseudo-Stabilizing Atomic Registers. OPODIS 2012: 135-150 - [i19]Swan Dubois
The Byzantine Brides Problem. CoRR abs/1203.3575 (2012) - [i18]Swan Dubois
Mariages et Trahisons. CoRR abs/1204.4565 (2012) - 2011
- [b1]Swan Dubois:
Tolerating Transient, Permanent, and Intermittent Failures. (Tolérer les fautes transitoires, permanentes et intermittentes). Pierre and Marie Curie University, Paris, France, 2011 - [j3]Shlomi Dolev
Stabilizing data-link over non-FIFO channels with optimal fault-resilience. Inf. Process. Lett. 111(18): 912-920 (2011) - [j2]Swan Dubois
Dynamic FTSS in asynchronous systems: The case of unison. Theor. Comput. Sci. 412(29): 3418-3439 (2011) - [j1]Alain Cournier, Swan Dubois
How to improve snap-stabilizing point-to-point communication space complexity? Theor. Comput. Sci. 412(33): 4285-4296 (2011) - [c11]Noga Alon, Hagit Attiya
Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems. SSS 2011: 19-31 - [c10]Swan Dubois
Maximum Metric Spanning Tree Made Byzantine Tolerant. DISC 2011: 150-164 - [i17]Swan Dubois
Self-Stabilization, Byzantine Containment, and Maximizable Metrics: Necessary Conditions. CoRR abs/1103.3515 (2011) - [i16]Shlomi Dolev, Swan Dubois
Communication Optimalement Stabilisante sur Canaux non Fiables et non FIFO. CoRR abs/1104.3947 (2011) - [i15]Swan Dubois, Toshimitsu Masuzawa, Sébastien Tixeuil:
Auto-Stabilisation et Confinement de Fautes Malicieuses : Optimalité du Protocole min+1. CoRR abs/1104.4022 (2011) - [i14]Swan Dubois, Toshimitsu Masuzawa, Sébastien Tixeuil:
Maximum Metric Spanning Tree made Byzantine Tolerant. CoRR abs/1104.5368 (2011) - [i13]Alain Cournier, Swan Dubois
Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies. CoRR abs/1107.6014 (2011) - [i12]Swan Dubois
A Taxonomy of Daemons in Self-stabilization. CoRR abs/1110.0334 (2011) - 2010
- [c9]Swan Dubois
Self-stabilizing Byzantine Asynchronous Unison, . OPODIS 2010: 83-86 - [c8]Swan Dubois
On Byzantine Containment Properties of the min + 1 Protocol. SSS 2010: 96-110 - [c7]Alain Cournier, Swan Dubois
Snap-Stabilizing Linear Message Forwarding. SSS 2010: 546-559 - [c6]Swan Dubois
The Impact of Topology on Byzantine Containment in Stabilization. DISC 2010: 495-509 - [c5]Noga Alon, Hagit Attiya
Brief Announcement: Sharing Memory in a Self-stabilizing Manner. DISC 2010: 525-527 - [i11]Swan Dubois
Construction auto-stabilisante d'arbre couvrant en dépit d'actions malicieuses. CoRR abs/1004.5256 (2010) - [i10]Swan Dubois
The Impact of Topology on Byzantine Containment in Stabilization. CoRR abs/1005.1195 (2010) - [i9]Swan Dubois
Self-stabilization with Byzantine tolerance for global tasks. CoRR abs/1005.3367 (2010) - [i8]Swan Dubois
On Byzantine Containment Properties of the $min+1$ Protocol. CoRR abs/1005.5223 (2010) - [i7]Anissa Lamani, Alain Cournier, Swan Dubois
Snap-Stabilizing Linear Message Forwarding. CoRR abs/1006.3432 (2010) - [i6]Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois
Practically Stabilizing Atomic Memory. CoRR abs/1007.1802 (2010) - [i5]Shlomi Dolev, Swan Dubois
Stabilizing data-link over non-FIFO channels with optimal fault-resilience. CoRR abs/1011.3632 (2010)
2000 – 2009
- 2009
- [c4]Alain Cournier, Swan Dubois
A snap-stabilizing point-to-point communication protocol in message-switched networks. IPDPS 2009: 1-11 - [c3]Alain Cournier, Swan Dubois
How to Improve Snap-Stabilizing Point-to-Point Communication Space Complexity? SSS 2009: 195-208 - [c2]Swan Dubois
Brief Announcement: Dynamic FTSS in Asynchronous Systems: The Case of Unison. DISC 2009: 291-293 - [i4]Swan Dubois
Dynamic FTSS in Asynchronous Systems: the Case of Unison. CoRR abs/0904.4615 (2009) - [i3]Alain Cournier, Swan Dubois
Une CNS pour l'acheminement de messages instantanément stabilisant. CoRR abs/0905.1786 (2009) - [i2]Alain Cournier, Swan Dubois
Two snap-stabilizing point-to-point communication protocols in message-switched networks. CoRR abs/0905.2540 (2009) - [i1]Swan Dubois
Self-Stabilizing Byzantine Asynchronous Unison. CoRR abs/0912.0134 (2009) - 2008
- [c1]Swan Dubois, Vassilis Giakoumakis, Cheikh Brahim Ould El Mounir:
On co-distance hereditary graphs. CTW 2008: 94-97
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: