Colette Johnen

According to our database1, Colette Johnen authored at least 62 papers between 1985 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
On the complexity of basic abstractions to implement consensus.
Theor. Comput. Sci., 2018

2017
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps.
Discrete Mathematics & Theoretical Computer Science, 2017

On the uncontended complexity of anonymous agreement.
Distributed Computing, 2017

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

2016
Silent self-stabilizing BFS tree algorithms revisited.
J. Parallel Distrib. Comput., 2016

Polynomial Silent Self-Stabilizing p-Star Decomposition (Short Paper).
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

2015
Silent Self-stabilizing BFS Tree Algorithms Revised.
CoRR, 2015

On the Uncontended Complexity of Anonymous Consensus.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Memory Efficient Self-stabilizing Distance-k Independent Dominating Set Construction.
Proceedings of the Networked Systems - Third International Conference, 2015

2014
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters.
J. Parallel Distrib. Comput., 2014

Fast, silent self-stabilizing distance-k independent dominating set construction.
Inf. Process. Lett., 2014

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

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

Testing Temporal Connectivity in Sparse Dynamic Graphs.
CoRR, 2014

Solo-Fast Universal Constructions for Deterministic Abortable Objects.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2013
Memory Efficient Self-Stabilizing k-Independent Dominating Set Construction.
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.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2012

2011
Self-Stabilizing Computation and Preservation of Knowledge of Neighbor Clusters.
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.
Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

2010
Reliable Self-Stabilizing Communication for Quasi Rendezvous.
CoRR, 2010

Quantitative model for evaluate routing protocols in a vehicular ad hoc networks on highway.
Proceedings of the Second IEEE Vehicular Networking Conference, 2010

Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters.
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.
Theor. Comput. Sci., 2009

Brief Announcement: Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters.
Proceedings of the Stabilization, 2009

Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks.
Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

2008
Safe peer-to-peer self-downloading.
TAAS, 2008

Fault-tolerant implementations of atomic registers by safe registers in networks.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Self-Stabilizing Construction of Bounded Size Clusters.
Proceedings of the IEEE International Symposium on Parallel and Distributed Processing with Applications, 2008

Analyze of Probabilistic Algorithms under Indeterministic Scheduler.
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.
Distributed Computing, 2007

Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

2006
Brief Announcement: Computing Automatically the Stabilization Time Against the Worst and the Best Schedules.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Safe Peer-to-Peer Self-downloading.
Proceedings of the Stabilization, 2006

All k -Bounded Policies Are Equivalent for Self-stabilization.
Proceedings of the Stabilization, 2006

Robust Self-stabilizing Clustering Algorithm.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Relationships between communication models in networks using atomic registers.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2006

2005
Strategies for peer-to-peer downloading.
Inf. Process. Lett., 2005

2004
Autostabilisation et protocoles réseau.
Technique et Science Informatiques, 2004

Bounded Service Time and Memory Space Optimal Self-Stabilizing Token Circulation Protocol on Unidirectional Rings.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003
Route Preserving Stabilization.
Proceedings of the Self-Stabilizing Systems, 6th International Symposium, SSS 2003, 2003

2002
Optimal Snap-Stabilizing Neighborhood Synchronizer in Tree Networks.
Parallel Processing Letters, 2002

Token-Based Self-Stabilizing Uniform Algorithms.
J. Parallel Distrib. Comput., 2002

Service Time Optimal Self-Stabilizing Token Circulation Protocol on Anonymous Unidrectional Rings.
Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS 2002), 2002

2001
Reliable Self-Stabilizing Communication for Quasi Rendezvous.
Stud. Inform. Univ., 2001

Cross-Over Composition - Enforcement of Fairness under Unfair Adversary.
Proceedings of the Self-Stabilizing Systems, 5th International Workshop, 2001

A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings.
Proceedings of the Distributed Computing, 15th International Conference, 2001

Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler.
Proceedings of the Euro-Par 2001: Parallel Processing, 2001

2000
Self-stabilizing depth-first token circulation in arbitrary rooted networks.
Distributed Computing, 2000

Fair and Reliable Self-stabilizing Communication.
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.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

Self-Stabilizing Neighborhood Synchronizer in Tree Networks.
Proceedings of the 19th International Conference on Distributed Computing Systems, Austin, TX, USA, May 31, 1999

1998
Self-stabilizing depth-first token circulation in arbitrary rooted networks.
Proceedings of the SIROCCO'98, 1998

1997
Memory-efficient self-stabilizing algorithm to construct BFS spanning trees.
Proceedings of the 3rd Workshop on Self-stabilizing Systems, 1997

Self-Stabilizing Depth-First Token Passing on Rooted Networks.
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

Memory Efficient, Self-Stabilizing Algorithm to Construct BFS Spanning Trees.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

1990
PAPETRI: Environment for the Analysis of PETRI Nets.
Proceedings of the Computer-Aided Verification, 1990

PAPETRI: Environment for the Analysis of Petri Nets.
Proceedings of the Computer Aided Verification, 2nd International Workshop, 1990

1985
PETRIREVE: Proving Petri Net Properties with Rewriting Systems.
Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985


  Loading...