Colette Johnen
Présentation
Current Position: Since September 2008, I am full professor at the University of Bordeaux. I am member of Combinatorics and Algorithms team of “Laboratoire Bordelais de Recherche en Informatique” LaBRI, UMR 5800. September 2020 to august 2021 : I was in delegation at INRIA, Paris in the Delys project - Delys is a joint research group between Inria Paris France and CNRS/Sorbonne University Paris France through the “Laboratoire d’Informatique de Paris 6”, LIP6 (UMR 7606). Diplomas: at the University Paris-Sud (now called University Paris-Saclay) My research activities are focused on:
Domaines de recherche
Publications
Publications
|
|
Being Efficient in Time, Space, and Workload: a Self-stabilizing Unison and its ConsequencesSTACS 2025: 42nd International Symposium on Theoretical Aspects of Computer Science, Mar 2025, Jena, Germany. pp.30:1-30:18, ⟨10.4230/LIPICS.STACS.2025.30⟩ |
|
|
Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficientPODC '24: 43rd ACM Symposium on Principles of Distributed Computing, Jun 2024, Nantes, France. pp.538-548, ⟨10.1145/3662158.3662803⟩ |
|
|
Self-stabilizing Systems in Spite of High Dynamics22nd International Conference on Distributed Computing and Networking, ICDCN'21, Jan 2021, Nara, Japan. pp.156-165, ⟨10.1145/3427796.3427838⟩ |
|
|
Brief Announcement: Self-stabilizing Systems in Spite of High DynamicsPODC 2020 - ACM Symposium on Principles of Distributed Computing, Aug 2020, Salerne / Virtual, Italy. ⟨10.1145/3382734.3404502⟩ |
|
|
Élection Autostabilisante dans les Réseaux à Haute DynamicitéALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France |
|
|
Self-Stabilizing Distributed Cooperative Reset2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS), Jul 2019, Dallas, United States. pp.379-389, ⟨10.1109/ICDCS.2019.00045⟩ |
|
|
Soyez efficace, rembobinezALGOTEL 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France |
|
|
Silent self-stabilizing scheme for spanning-tree-like constructionsICDCN 2019, Jan 2019, Bangalore, India. pp.158-167, ⟨10.1145/3288599.3288607⟩ |
|
|
Brief Announcement: Analysis of a Memory-Efficient Self-stabilizing BFS Spanning Tree Construction21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2019), Oct 2019, Pise, Italy. pp.99-104, ⟨10.1007/978-3-030-34992-9_8⟩ |
|
|
Schéma général auto-stabilisant et silencieux de constructions de type arbres couvrantsALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2018, Roscoff, France |
|
|
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps20th International Conference on Principles of Distributed Systems (OPODIS 2016), Dec 2016, Madrid, Spain. pp.10:1-10:16, ⟨10.4230/LIPIcs.OPODIS.2016.10⟩ |
|
|
Polynomial Silent Self-Stabilizing Maximal p-Star DecompositionALGOTEL 2017 - 19èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2017, Quiberon, France |
|
|
Complexité du consensus anonyme en l'absence de concurrenceALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2016, Bayonne, France |
Polynomial Silent Self-Stabilizing p-Star Decomposition (Short Paper)18th International Symposium on Stabilization, Safety, and Security of Distributed Systems - SSS 2016, Nov 2016, Lyon, France. ⟨10.1007/978-3-319-49259-9_15⟩ |
|
|
|
Brief Announcement: On the Uncontended Complexity of Anonymous ConsensusDISC 2015, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan |
On the Uncontended Complexity of Anonymous Consensus19th International Conference on Principles of Distributed Systems - OPODIS 2015, Dec 2015, Rennes, France. ⟨10.4230/LIPIcs.OPODIS.2015.12⟩ |
|
|
|
Memory Efficient Self-Stabilizing k-Independent Dominating Set ConstructionThird International Conference on Networked Systems - NETYS 2015, May 2015, Agadir, Morocco. ⟨10.1007/978-3-319-26850-7_24⟩ |
Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case18th International Conference on Principles of Distributed Systems - OPODIS 2014, Dec 2014, Cortina d'Ampezzo, Italy. pp.277-292 |
|
Solo-Fast Universal Constructions for Deterministic Abortable Objects28th International Symposium Distributed Computing - DISC 2014, Oct 2014, Austin, United States |
|
|
|
Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in NetworksProceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2014), Sep 2014, Paderborn, Germany. pp.120 - 134, ⟨10.1007/978-3-319-11764-5_9⟩ |
|
|
Un algorithme de test pour la connexité temporelle des graphes dynamiques de faible densitéALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2014, Le Bois-Plage-en-Ré, France. pp.1-4 |
Brief Announcement : Memory Efficient Self-Stabilizing k-Independent Dominating Set Construction15th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS'13), Nov 2013, Osaka, Japan. pp.341-343, ⟨10.1007/978-3-319-03089-0_24⟩ |
|
|
|
Hiérarchisation dans les réseaux ad hoc de véhicules8èmes journées francophones Mobilité et Ubiquité, UBIMOB 2012, Jun 2012, Bayonne, France. pp.45-52 |
From Self- to Self-stabilizing with Service Guarantee 1-hop Weight-Based Clustering4th International Symposium Stabilization, Safety, and Security of Distributed Systems (SSS 2012), Oct 2012, Toronto, Canada. pp.163-178 |
|
Self-stabilization versus Robust Self-stabilization for Clustering in Ad-Hoc NetworkEuro-Par 2011, Aug 2011, Bordeaux, France. pp.117-129 |
|
|
|
Étude de la formation de convois dans un réseau de véhicules sur autorouteCFIP 2011 - Colloque Francophone sur l Ingénierie des Protocoles, UTC, May 2011, Sainte Maxime, France |
Self-Stabilizing Computation and Preservation of Knowledge of Neighbor ClustersSASO 2011, Oct 2011, Ann Arbor, United States. pp.41-50, ⟨10.1109/SASO.2011.15⟩ |
|
Quantitative model for evaluate routing protocols in a vehicular ad hoc networks on highwayVNC 2010, Dec 2010, Jersey City, United States. pp.330-337, ⟨10.1109/VNC.2010.5698255⟩ |
|
Robust Self-Stabilizing Construction of Bounded Size Weight-Based Clusters16th International Parallel Processing Conference (Euro-Par 2010), Aug 2010, Ischia, Italy. pp.535-546 |
|
Fault-tolerant implementations of regular registers by safe registers10th International conference on Distributed Computing and Networking, ICDCN 2009, Jan 2009, Hyderabad, India. pp.337-348 |
|
Brief Announcement: Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2009), Nov 2009, Lyon, France. pp.787-788 |
|
|
|
Vers une modélisation robuste des protocoles de routage pour réseaux de véhiculesCFIP'2009, Oct 2009, Strasbourg, France |
Self-Stabilizing Construction of Bounded Size ClustersThe 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2008, Dec 2008, Sydney, Australia. pp.43-50, ⟨10.1109/ISPA.2008.43⟩ |
|
Fault-tolerant implementations of atomic registers by safe registers in networksACM Symposium on Principles of Distributed Computing, PODC 2008, Aug 2008, Toronto, Canada. pp.449, ⟨10.1145/1400751.1400845⟩ |
|
Analyze of Probabilistic Algorithms under Indeterministic SchedulerInternational Symposium on Advances in Parallel and Distributed Computing Techniques (APDCT-08), Dec 2008, Sydney, Australia. pp.553-558, ⟨10.1109/ISPA.2008.21⟩ |
|
Safe Peer-to-Peer Self-downloading8th International Symposium, SSS 2006, Nov 2006, Dallas, Texas, United States. pp.324-334, ⟨10.1007/978-3-540-49823-0_23⟩ |
|
Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks21st International Symposium on Distributed Computing, DISC 2007, Sep 2007, Limassol, Cyprus. pp.485-487, ⟨10.1007/978-3-540-75142-7_38⟩ |
|
Robust Self-Stabilizing Clustering Algorithm10th International Conference Principles of Distributed Systems, Dec 2006, Bordeaux, France. pp.410-424, ⟨10.1007/11945529_29⟩ |
|
All k -Bounded Policies Are Equivalent for Self-stabilization8th International Symposium, SSS 2006, Nov 2006, Dallas, Texas, United States. pp.82-94, ⟨10.1007/978-3-540-49823-0_6⟩ |
|
Relationships between communication models in networks using atomic registers20th EEE International Parallel & Distributed Processing Symposium, Apr 2006, Rhodes Island, Greece. pp.+1 |
|
Brief Announcement: Computing Automatically the Stabilization Time Against the Worst and the Best Schedules20th International Symposium of Distributed Computing, DISC 2006, Oct 2006, Stockholm, Sweden. pp.543-547, ⟨10.1007/11864219_40⟩ |
|
Self-Stabilizing weight-based Clustering Algorithm for Ad hoc sensor NetworksSecond International Workshop on Algorithmic Aspects of Wireless Sensor Networks, Jun 2006, Venice, Italy. pp.83-94, ⟨10.1007/11963271_8⟩ |
|
Bounded Service Time and Memory Space Optimal Self-Stabilizing Token Circulation Protocol on unidirectional rings18th International Parallel and Distributed Processing Symposium, Apr 2006, Santa Fe, New Mexico, United States. pp.+1 |
|
|
|
A Self-Stabilizing Communication PrimitiveInternational Conference on Principles of Distributed Systems (OPODIS), 1998, France. pp.15-23 |
CONVOI : un protocole de formation de clusters pour les réseaux de véhiculesLabiod, H. and Beylot, A.L. Modèles et algorithmes pour les réseaux véhiculaires, Hermès, pp.1-15, 2013, Traité IC2 |
|
CONVOY: a new Cluster-based routing Protocol for Vehicular NetworksLabiod, H. and Beylot, A.L. Vehicular Networks: Models and Algorithms, ISTE Publishing Knowledge /John Wiley and Sons Inc, pp.91-129, 2013, 9781848214897. ⟨10.1002/9781118648759.ch3⟩ |
|
|
Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments2023 |
|
|
Trade-off between time, space workload: the case of the self-stabilizing unisson2023 |
|
|
Polynomial Silent Self-Stabilizing p-Star Decomposition2016 |
|
|
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write RegistersLaBRI, Université de Bordeaux; Laboratoire d'informatique et des Systèmes - LIS (UMR 7020). 2024 |
|
|
Efficient self-stabilizing construction of disjoint MDSs in distance-2 model[Research Report] Inria Paris, Sorbonne Université; LaBRI, CNRS UMR 5800; LIRIS UMR CNRS 5205. 2021 |
|
|
On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics[Research Report] Université Grenoble Alpes, VERIMAG, UMR 5104, France; LIMOS, Université Clermont Auvergne, CNRS, UMR 6158, France; Université de Bordeaux, LaBRI, UMR 5800, France; Sorbonne Université, Paris, LIP6, UMR 7606, France. 2020 |
|
|
Self-Stabilizing Distributed Cooperative Reset[Research Report] Université Grenoble Alpes (France). 2019 |
|
|
Silent Self-Stabilizing Scheme for Spanning-Tree-like Constructions[Research Report] VERIMAG/LaBRI. 2018 |
|
|
Disconnected components detection and rooted shortest-path tree maintenance in networks - extended version[Research Report] LaBRI, CNRS UMR 5800. 2016 |
|
|
Silent Self-stabilizing BFS Tree Algorithms Revised[Research Report] Université Grenoble Alpes. 2015 |
|
|
On the Uncontended Complexity of Anonymous Consensus[Research Report] University of Bordeaux LaBRI, UMR 5800, F-33400 Talence, France Telecom ParisTech. 2015 |
|
|
Fast self-stabilizing k-independent dominating set construction2013 |
|
|
From self- to self-stabilizing with service guarantee 1-hop weight-based clustering2012 |