Colette Johnen
Colette Johnen, PR
56%
Libre accès
73
Documents
Affiliations actuelles
Identifiants chercheurs
- colette-johnen
- Arxiv : johnen_c_1
- 0000-0001-7170-4521
- Google Scholar : https://scholar.google.fr/citations?user=g_YgoOgAAAAJ&hl=fr
- IdRef : 032681763
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](ttps://www.labri.fr), UMR 5800.
September 2020 to august 2021 : I was in delegation at INRIA, Paris in the [Delys](https://team.inria.fr/delys/) project - Delys is a joint research group between [Inria](http://www.inria.fr) Paris France and CNRS/Sorbonne University Paris France through the “Laboratoire d’Informatique de Paris 6”, [LIP6](https://www.lip6.fr/?LANG=en) (UMR 7606).
**Diplomas:** at the University Paris-Sud (now called University Paris-Saclay)
- November 2007, HdR, title of manuscript: « Some contributions to self-stabilization », reviewers: Marc Bui (EPHE, France), Shlomi Dolev (Univ. of the Negev, Israel), Masafumi Yamashita (Kyushu University, Japan)
- December 1987, PhD, Title of dissertation: “Algorithmic Analysis of Petri Net: home space, rewriting systems”
My **research activities** are focused on:
- the design of efficient self-stabilizing algorithms,
- the algorithm for highly dynamic networks,
- Concurrent algorithm in shared memory.
**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](ttps://www.labri.fr), UMR 5800.
September 2020 to august 2021 : I was in delegation at INRIA, Paris in the [Delys](https://team.inria.fr/delys/) project - Delys is a joint research group between [Inria](http://www.inria.fr) Paris France and CNRS/Sorbonne University Paris France through the “Laboratoire d’Informatique de Paris 6”, [LIP6](https://www.lip6.fr/?LANG=en) (UMR 7606).
**Diplomas:** at the University Paris-Sud (now called University Paris-Saclay)
- November 2007, HdR, title of manuscript: « Some contributions to self-stabilization », reviewers: Marc Bui (EPHE, France), Shlomi Dolev (Univ. of the Negev, Israel), Masafumi Yamashita (Kyushu University, Japan)
- December 1987, PhD, Title of dissertation: “Algorithmic Analysis of Petri Net: home space, rewriting systems”
My **research activities** are focused on:
- the design of efficient self-stabilizing algorithms,
- the algorithm for highly dynamic networks,
- Concurrent algorithm in shared memory.
Domaines de recherche
Calcul parallèle, distribué et partagé [cs.DC]
Publications
|
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⟩
Communication dans un congrès
hal-02376832v3
|
|
É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
Communication dans un congrès
hal-02791667v1
|
|
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⟩
Communication dans un congrès
hal-02911071v1
|
|
Soyez efficace, rembobinezALGOTEL 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France
Communication dans un congrès
hal-02118440v1
|
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⟩
Communication dans un congrès
hal-02489666v1
|
|
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⟩
Communication dans un congrès
hal-02489447v1
|
|
|
Silent self-stabilizing scheme for spanning-tree-like constructionsICDCN 2019, Jan 2019, Bangalore, India. pp.158-167, ⟨10.1145/3288599.3288607⟩
Communication dans un congrès
hal-02127131v1
|
|
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
Communication dans un congrès
hal-01781338v1
|
|
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
Communication dans un congrès
hal-01516163v1
|
|
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
Communication dans un congrès
hal-01304268v2
|
|
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⟩
Communication dans un congrès
hal-01544581v1
|
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⟩
Communication dans un congrès
hal-01411828v1
|
|
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⟩
Communication dans un congrès
hal-01411528v1
|
|
|
Brief Announcement: On the Uncontended Complexity of Anonymous ConsensusDISC 2015, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan
Communication dans un congrès
hal-01207895v1
|
|
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⟩
Communication dans un congrès
hal-00843995v2
|
|
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⟩
Communication dans un congrès
hal-01111188v1
|
Solo-Fast Universal Constructions for Deterministic Abortable Objects28th International Symposium Distributed Computing - DISC 2014, Oct 2014, Austin, United States
Communication dans un congrès
hal-01410291v1
|
|
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
Communication dans un congrès
hal-01410314v1
|
|
|
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
Communication dans un congrès
hal-00986117v1
|
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⟩
Communication dans un congrès
hal-00939428v1
|
|
|
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
Communication dans un congrès
hal-00781267v1
|
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
Communication dans un congrès
hal-00843638v1
|
|
|
É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
Communication dans un congrès
inria-00586841v1
|
Self-stabilization versus Robust Self-stabilization for Clustering in Ad-Hoc NetworkEuro-Par 2011, Aug 2011, Bordeaux, France. pp.117-129
Communication dans un congrès
hal-00647681v1
|
|
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⟩
Communication dans un congrès
hal-00647854v1
|
|
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⟩
Communication dans un congrès
hal-00647859v1
|
|
Robust Self-Stabilizing Construction of Bounded Size Weight-Based Clusters16th International Parallel Processing Conference (Euro-Par 2010), Aug 2010, Ischia, Italy. pp.535-546
Communication dans un congrès
hal-00564951v1
|
|
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
Communication dans un congrès
hal-00355501v1
|
|
|
Vers une modélisation robuste des protocoles de routage pour réseaux de véhiculesCFIP'2009, Oct 2009, Strasbourg, France
Communication dans un congrès
inria-00419460v1
|
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
Communication dans un congrès
hal-00564958v1
|
|
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⟩
Communication dans un congrès
hal-00334322v1
|
|
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⟩
Communication dans un congrès
hal-00355516v1
|
|
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⟩
Communication dans un congrès
hal-00355517v1
|
|
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⟩
Communication dans un congrès
hal-00334323v1
|
|
Relationships between communication models in networks using atomic registers20th EEE International Parallel & Distributed Processing Symposium, Apr 2006, Rhodes Island, Greece. pp.+1
Communication dans un congrès
hal-00336397v1
|
|
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
Communication dans un congrès
hal-00015786v1
|
|
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⟩
Communication dans un congrès
hal-00355509v1
|
|
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⟩
Communication dans un congrès
hal-00336391v1
|
|
Robust Self-Stabilizing Clustering Algorithm10th International Conference Principles of Distributed Systems, Dec 2006, Bordeaux, France. pp.410-424, ⟨10.1007/11945529_29⟩
Communication dans un congrès
inria-00158856v1
|
|
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⟩
Communication dans un congrès
inria-00158857v1
|
|
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⟩
Communication dans un congrès
hal-00336393v1
|
|
|
A Self-Stabilizing Communication PrimitiveInternational Conference on Principles of Distributed Systems (OPODIS), 1998, France. pp.15-23
Communication dans un congrès
hal-00465672v1
|
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
Chapitre d'ouvrage
hal-00821741v1
|
|
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⟩
Chapitre d'ouvrage
hal-00821742v1
|
|
Trade-off between time, space workload: the case of the self-stabilizing unisson2023
Pré-publication, Document de travail
hal-04173649v2
|
|
Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments2023
Pré-publication, Document de travail
hal-04159863v1
|
|
Polynomial Silent Self-Stabilizing p-Star Decomposition2016
Pré-publication, Document de travail
hal-01514323v1
|