Colette Johnen

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 29

Top Topics

Dijkstra Algorithm

Top Venues

Theor. Comput. Sci.

Publications

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