Colette Johnen

87 papers A* 7A 9B 11C 12Misc 3Journal 33Unranked 12
YearRankTypeTitle / Venue / Authors
2025 A conf
Being Efficient in Time, Space, and Workload: a Self-Stabilizing Unison and Its Consequences.
STACS
Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit
2025 J jnl
Silent anonymous snap-stabilizing termination detection.
Distributed Comput.
Lélia Blin, Colette Johnen, Gabriel Le Bouder, Franck Petit
2024 A* conf
Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient.
PODC
Colette Johnen, Stéphane Devismes, Frédéric Mazoit, David Ilcinkas
2024 B conf
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers.
SIROCCO
Colette Johnen, Adnane Khattabi, Alessia Milani, Jennifer L. Welch
2024 J jnl
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers.
CoRR
Colette Johnen, Adnane Khattabi, Alessia Milani, Jennifer L. Welch
2023 J jnl
Analysis of a memory-efficient self-stabilizing BFS spanning tree construction.
Theor. Comput. Sci.
Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore
2023 J jnl
Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments.
CoRR
Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit
2023 J jnl
Self-stabilizing systems in spite of high dynamics.
Theor. Comput. Sci.
Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit
2023 J jnl
Trade-off between Time, Space, and Workload: the case of the Self-stabilizing Unison.
CoRR
Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit
2022 B conf
Efficient Wait-Free Queue Algorithms with Multiple Enqueuers and Multiple Dequeuers.
OPODIS
Colette Johnen, Adnane Khattabi, Alessia Milani
2022 J jnl
Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions.
Algorithmica
Stéphane Devismes, David Ilcinkas, Colette Johnen
2022 B conf
Silent Anonymous Snap-Stabilizing Termination Detection.
SRDS
Lélia Blin, Colette Johnen, Gabriel Le Bouder, Franck Petit
2021 B conf
FIFO and Atomic broadcast algorithms with bounded message size for dynamic systems.
SRDS
Colette Johnen, Luciana Arantes, Pierre Sens
2021 A* conf
On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics.
PODC
Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit
2021 Misc conf
Self-stabilizing Systems in Spite of High Dynamics.
ICDCN
Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit
2021 C ed.
Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, SSS 2021, Virtual Event, November 17-20, 2021, Proceedings
SSS
Colette Johnen, Elad Michael Schiller, Stefan Schmid
2020 A* conf
Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics.
PODC
Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit
2020 J jnl
Polynomial Silent Self-Stabilizing p-Star Decomposition†.
Comput. J.
Mohammed Haddad, Colette Johnen, Sven Köhler
2019 J jnl
Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree.
CoRR
Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore
2019 C conf
Brief Announcement: Analysis of a Memory-Efficient Self-stabilizing BFS Spanning Tree Construction.
SSS
Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore
2019 J jnl
Disconnected components detection and rooted shortest-path tree maintenance in networks.
J. Parallel Distributed Comput.
Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen
2019 J jnl
Maintaining a Distributed Spanning Forest in Highly Dynamic Networks.
Comput. J.
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz
2019 A conf
Self-Stabilizing Distributed Cooperative Reset.
ICDCS
Stéphane Devismes, Colette Johnen
2019 J jnl
Self-Stabilizing Distributed Cooperative Reset.
CoRR
Stéphane Devismes, Colette Johnen
2019 Misc conf
Silent self-stabilizing scheme for spanning-tree-like constructions.
ICDCN
Stéphane Devismes, David Ilcinkas, Colette Johnen
2018 J jnl
On the complexity of basic abstractions to implement consensus.
Theor. Comput. Sci.
Claire Capdevielle, Colette Johnen, Alessia Milani
2017 J jnl
On the uncontended complexity of anonymous agreement.
Distributed Comput.
Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani
2017 J jnl
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps.
CoRR
Stéphane Devismes, David Ilcinkas, Colette Johnen
2017 J jnl
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps.
Discret. Math. Theor. Comput. Sci.
Stéphane Devismes, David Ilcinkas, Colette Johnen
2016 C conf
Polynomial Silent Self-Stabilizing p-Star Decomposition (Short Paper).
SSS
Mohammed Haddad, Colette Johnen, Sven Köhler
2016 B conf
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps.
OPODIS
Stéphane Devismes, David Ilcinkas, Colette Johnen
2016 J jnl
Silent self-stabilizing BFS tree algorithms revisited.
J. Parallel Distributed Comput.
Stéphane Devismes, Colette Johnen
2015 — conf
Memory Efficient Self-stabilizing Distance-k Independent Dominating Set Construction.
NETYS
Colette Johnen
2015 B conf
On the Uncontended Complexity of Anonymous Consensus.
OPODIS
Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani
2015 J jnl
Silent Self-stabilizing BFS Tree Algorithms Revised.
CoRR
Stéphane Devismes, Colette Johnen
2014 C conf
Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks.
SSS
Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen
2014 J jnl
Fast, silent self-stabilizing distance-k independent dominating set construction.
Inf. Process. Lett.
Colette Johnen
2014 B conf
Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case.
OPODIS
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz
2014 J jnl
Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case.
CoRR
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz
2014 J jnl
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters.
J. Parallel Distributed Comput.
Colette Johnen, Fouzi Mekhaldi
2014 A conf
Solo-Fast Universal Constructions for Deterministic Abortable Objects.
DISC
Claire Capdevielle, Colette Johnen, Alessia Milani
2014 J jnl
Testing Temporal Connectivity in Sparse Dynamic Graphs.
CoRR
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz
2014 J jnl
Un algorithme de test pour la connexité temporelle des graphes dynamiques de faible densité.
CoRR
Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz
2013 C conf
Memory Efficient Self-Stabilizing k-Independent Dominating Set Construction.
SSS
Colette Johnen
2012 C conf
From Self- to Self-stabilizing with Service Guarantee 1-hop Weight-Based Clustering.
SSS
Colette Johnen, Fouzi Mekhaldi
2011 — conf
Self-Stabilizing Computation and Preservation of Knowledge of Neighbor Clusters.
SASO
Colette Johnen, Fouzi Mekhaldi
2011 — conf
Self-stabilization versus Robust Self-stabilization for Clustering in Ad-Hoc Network.
Euro-Par (1)
Colette Johnen, Fouzi Mekhaldi
2010 — conf
Quantitative model for evaluate routing protocols in a vehicular ad hoc networks on highway.
VNC
Florent Kaisser, Colette Johnen, Véronique Vèque
2010 J jnl
Reliable Self-Stabilizing Communication for Quasi Rendezvous.
CoRR
Colette Johnen, Ivan Lavallée, Christian Lavault
2010 — conf
Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters.
Euro-Par (1)
Colette Johnen, Fouzi Mekhaldi
2009 C conf
Brief Announcement: Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters.
SSS
Colette Johnen, Fouzi Mekhaldi
2009 Misc conf
Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks.
ICDCN
Colette Johnen, Lisa Higham
2009 J jnl
Robust self-stabilizing weight-based clustering algorithm.
Theor. Comput. Sci.
Colette Johnen, Le Huy Nguyen
2008 C conf
Analyze of Probabilistic Algorithms under Indeterministic Scheduler.
ISPA
Joffroy Beauquier, Colette Johnen
2008 A* conf
Fault-tolerant implementations of atomic registers by safe registers in networks.
PODC
Colette Johnen, Lisa Higham
2008 J jnl
Safe peer-to-peer self-downloading.
ACM Trans. Auton. Adapt. Syst.
Kajari Ghosh Dastidar, Ted Herman, Colette Johnen
2008 C conf
Self-Stabilizing Construction of Bounded Size Clusters.
ISPA
Colette Johnen, Le Huy Nguyen
2007 A conf
Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks.
DISC
Colette Johnen, Lisa Higham
2007 J jnl
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings.
Distributed Comput.
Joffroy Beauquier, Maria Gradinariu, Colette Johnen
2006 C conf
All
SSS
Joffroy Beauquier, Colette Johnen, Stéphane Messika
2006 A conf
Brief Announcement: Computing Automatically the Stabilization Time Against the Worst and the Best Schedules.
DISC
Joffroy Beauquier, Colette Johnen, Stéphane Messika
2006 A conf
Relationships between communication models in networks using atomic registers.
IPDPS
Lisa Higham, Colette Johnen
2006 B conf
Robust Self-stabilizing Clustering Algorithm.
OPODIS
Colette Johnen, Le Huy Nguyen
2006 C conf
Safe Peer-to-Peer Self-downloading.
SSS
Kajari Ghosh Dastidar, Ted Herman, Colette Johnen
2006 C conf
Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks.
ALGOSENSORS
Colette Johnen, Le Huy Nguyen
2005 J jnl
Strategies for peer-to-peer downloading.
Inf. Process. Lett.
Ted Herman, Colette Johnen
2004 J jnl
Autostabilisation et protocoles réseau.
Tech. Sci. Informatiques
Colette Johnen, Franck Petit, Sébastien Tixeuil
2004 A conf
Bounded Service Time and Memory Space Optimal Self-Stabilizing Token Circulation Protocol on Unidirectional Rings.
IPDPS
Colette Johnen
2003 — conf
Route Preserving Stabilization.
Self-Stabilizing Systems
Colette Johnen, Sébastien Tixeuil
2002 J jnl
Optimal Snap-Stabilizing Neighborhood Synchronizer in Tree Networks.
Parallel Process. Lett.
Colette Johnen, Luc Onana Alima, Ajoy Kumar Datta, Sébastien Tixeuil
2002 B conf
Service Time Optimal Self-Stabilizing Token Circulation Protocol on Anonymous Unidrectional Rings.
SRDS
Colette Johnen
2002 J jnl
Token-Based Self-Stabilizing Uniform Algorithms.
J. Parallel Distributed Comput.
Joffroy Beauquier, Maria Gradinariu, Colette Johnen, Jérôme Olivier Durand-Lose
2001 A conf
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings.
DISC
Faith E. Fich, Colette Johnen
2001 — conf
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary.
WSS
Joffroy Beauquier, Maria Gradinariu, Colette Johnen
2001 J jnl
Reliable Self-Stabilizing Communication for Quasi Rendezvous.
Stud. Inform. Univ.
Colette Johnen, Ivan Lavallée, Christian Lavault
2001 — conf
Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler.
Euro-Par
Maria Gradinariu, Colette Johnen
2000 B conf
Fair and Reliable Self-stabilizing Communication.
OPODIS
Ivan Lavallée, Christian Lavault, Colette Johnen
2000 J jnl
Self-stabilizing depth-first token circulation in arbitrary rooted networks.
Distributed Comput.
Ajoy Kumar Datta, Colette Johnen, Franck Petit, Vincent Villain
1999 A* conf
Memory Space Requirements for Self-Stabilizing Leader Election Protocols.
PODC
Joffroy Beauquier, Maria Gradinariu, Colette Johnen
1999 A conf
Self-Stabilizing Neighborhood Synchronizer in Tree Networks.
ICDCS
Colette Johnen, Luc Onana Alima, Ajoy Kumar Datta, Sébastien Tixeuil
1998 B conf
Self-stabilizing depth-first token circulation in arbitrary rooted networks.
SIROCCO
Ajoy Kumar Datta, Colette Johnen, Franck Petit, Vincent Villain
1997 A* conf
Memory Efficient, Self-Stabilizing Algorithm to Construct BFS Spanning Trees.
PODC
Colette Johnen
1997 — conf
Memory-efficient self-stabilizing algorithm to construct BFS spanning trees.
WSS
Colette Johnen
1997 — conf
Self-Stabilizing Depth-First Token Passing on Rooted Networks.
WDAG
Colette Johnen, Gianluigi Alari, Joffroy Beauquier, Ajoy Kumar Datta
1990 — conf
PAPETRI: Environment for the Analysis of PETRI Nets.
CAV (DIMACS/AMS volume)
Gérard Berthelot, Colette Johnen, Laure Petrucci
1990 A* conf
PAPETRI: Environment for the Analysis of Petri Nets.
CAV
Gérard Berthelot, Colette Johnen, Laure Petrucci
1985 — conf
PETRIREVE: Proving Petri Net Properties with Rewriting Systems.
RTA
Christine Choppy, Colette Johnen