Colette Johnen

David Ilcinkas

Algorithmica, 2022

Silent Anonymous Snap-Stabilizing Termination Detection.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Reliable Distributed Systems, 2022

Efficient Wait-Free Queue Algorithms with Multiple Enqueuers and Multiple Dequeuers.

[BibT_eX]

[DOI]

Adnane Khattabi

Alessia Milani

Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

2021

FIFO and Atomic broadcast algorithms with bounded message size for dynamic systems.

[BibT_eX]

[DOI]

Luciana Arantes

Pierre Sens

Proceedings of the 40th International Symposium on Reliable Distributed Systems, 2021

On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020

Polynomial Silent Self-Stabilizing p-Star Decomposition†.

[BibT_eX]

[DOI]

Mohammed Haddad

Sven Köhler

Comput. J., 2020

Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019

Disconnected components detection and rooted shortest-path tree maintenance in networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2019

Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree.

[BibT_eX]

[DOI]

CoRR, 2019

Maintaining a Distributed Spanning Forest in Highly Dynamic Networks.

[BibT_eX]

[DOI]

Comput. J., 2019

Brief Announcement: Analysis of a Memory-Efficient Self-stabilizing BFS Spanning Tree Construction.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Self-Stabilizing Distributed Cooperative Reset.

[BibT_eX]

[DOI]

Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019

Silent self-stabilizing scheme for spanning-tree-like constructions.

[BibT_eX]

[DOI]

David Ilcinkas

Proceedings of the 20th International Conference on Distributed Computing and Networking, 2019

2018

On the complexity of basic abstractions to implement consensus.

[BibT_eX]

[DOI]

Claire Capdevielle

Alessia Milani

Theor. Comput. Sci., 2018

2017

Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps.

[BibT_eX]

[DOI]

David Ilcinkas

Discret. Math. Theor. Comput. Sci., 2017

On the uncontended complexity of anonymous agreement.

[BibT_eX]

[DOI]

Distributed Comput., 2017

2016

Silent self-stabilizing BFS tree algorithms revisited.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2016

Polynomial Silent Self-Stabilizing p-Star Decomposition (Short Paper).

[BibT_eX]

[DOI]

Mohammed Haddad

Sven Köhler

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

2015

Silent Self-stabilizing BFS Tree Algorithms Revised.

[BibT_eX]

[DOI]

CoRR, 2015

On the Uncontended Complexity of Anonymous Consensus.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Memory Efficient Self-stabilizing Distance-k Independent Dominating Set Construction.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - Third International Conference, 2015

2014

Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2014

Fast, silent self-stabilizing distance-k independent dominating set construction.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Un algorithme de test pour la connexité temporelle des graphes dynamiques de faible densité.

[BibT_eX]

[DOI]

CoRR, 2014

Testing Temporal Connectivity in Sparse Dynamic Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Solo-Fast Universal Constructions for Deterministic Abortable Objects.

[BibT_eX]

[DOI]

Claire Capdevielle

Alessia Milani

Proceedings of the Distributed Computing - 28th International Symposium, 2014

Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2013

Memory Efficient Self-Stabilizing k-Independent Dominating Set Construction.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

2012

From Self- to Self-stabilizing with Service Guarantee 1-hop Weight-Based Clustering.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

2011

Self-Stabilizing Computation and Preservation of Knowledge of Neighbor Clusters.

[BibT_eX]

[DOI]

Proceedings of the 5th IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2011

Self-stabilization versus Robust Self-stabilization for Clustering in Ad-Hoc Network.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

2010

Quantitative model for evaluate routing protocols in a vehicular ad hoc networks on highway.

[BibT_eX]

[DOI]

Florent Kaisser

Véronique Vèque

Proceedings of the Second IEEE Vehicular Networking Conference, 2010

Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2010 - Parallel Processing, 16th International Euro-Par Conference, Ischia, Italy, August 31, 2010

2009

Robust self-stabilizing weight-based clustering algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Brief Announcement: Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2009

Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

2008

Safe peer-to-peer self-downloading.

[BibT_eX]

[DOI]

Kajari Ghosh Dastidar

Ted Herman

ACM Trans. Auton. Adapt. Syst., 2008

Fault-tolerant implementations of atomic registers by safe registers in networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Self-Stabilizing Construction of Bounded Size Clusters.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Parallel and Distributed Processing with Applications, 2008

Analyze of Probabilistic Algorithms under Indeterministic Scheduler.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Parallel and Distributed Processing with Applications, 2008

2007

Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings.

[BibT_eX]

[DOI]

Distributed Comput., 2007

Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 21st International Symposium, 2007

2006

Brief Announcement: Computing Automatically the Stabilization Time Against the Worst and the Best Schedules.

[BibT_eX]

[DOI]

Stéphane Messika

Proceedings of the Distributed Computing, 20th International Symposium, 2006

All <i>k</i> -Bounded Policies Are Equivalent for Self-stabilization.

[BibT_eX]

[DOI]

Stéphane Messika

Proceedings of the Stabilization, 2006

Robust Self-stabilizing Clustering Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Relationships between communication models in networks using atomic registers.

[BibT_eX]

[DOI]

Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2006

2005

Strategies for peer-to-peer downloading.

[BibT_eX]

[DOI]

Ted Herman

Inf. Process. Lett., 2005

2004

Autostabilisation et protocoles réseau.

[BibT_eX]

[DOI]

Franck Petit

Sébastien Tixeuil

Tech. Sci. Informatiques, 2004

Bounded Service Time and Memory Space Optimal Self-Stabilizing Token Circulation Protocol on Unidirectional Rings.

[BibT_eX]

[DOI]

Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003

Route Preserving Stabilization.

[BibT_eX]

[DOI]

Sébastien Tixeuil

Proceedings of the Self-Stabilizing Systems, 6th International Symposium, SSS 2003, 2003

2002

Optimal Snap-Stabilizing Neighborhood Synchronizer in Tree Networks.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2002

Token-Based Self-Stabilizing Uniform Algorithms.

[BibT_eX]

[DOI]

Jérôme Olivier Durand-Lose

J. Parallel Distributed Comput., 2002

Service Time Optimal Self-Stabilizing Token Circulation Protocol on Anonymous Unidrectional Rings.

[BibT_eX]

[DOI]

Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS 2002), 2002

2001

Reliable Self-Stabilizing Communication for Quasi Rendezvous.

[BibT_eX]

[DOI]

Ivan Lavallée

Christian Lavault

Stud. Inform. Univ., 2001

Cross-Over Composition - Enforcement of Fairness under Unfair Adversary.

[BibT_eX]

[DOI]

Proceedings of the Self-Stabilizing Systems, 5th International Workshop, 2001

A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings.

[BibT_eX]

[DOI]

Faith E. Fich

Proceedings of the Distributed Computing, 15th International Conference, 2001

Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2001: Parallel Processing, 2001

2000

Self-stabilizing depth-first token circulation in arbitrary rooted networks.

[BibT_eX]

[DOI]

Distributed Comput., 2000

Fair and Reliable Self-stabilizing Communication.

[BibT_eX]

Ivan Lavallée

Christian Lavault

Proceedings of the Procedings of the 4th International Conference on Principles of Distributed Systems, 2000

1999

Memory Space Requirements for Self-Stabilizing Leader Election Protocols.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

Self-Stabilizing Neighborhood Synchronizer in Tree Networks.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Distributed Computing Systems, Austin, TX, USA, May 31, 1999

1997

Memory-efficient self-stabilizing algorithm to construct BFS spanning trees.

[BibT_eX]

Proceedings of the 3rd Workshop on Self-stabilizing Systems, 1997

Self-Stabilizing Depth-First Token Passing on Rooted Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

1990

PAPETRI: Environment for the Analysis of Petri Nets.

[BibT_eX]

[DOI]

Gérard Berthelot

Laure Petrucci

Proceedings of the Computer Aided Verification, 2nd International Workshop, 1990

1985

PETRIREVE: Proving Petri Net Properties with Rewriting Systems.

[BibT_eX]

[DOI]

Christine Choppy