default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDColette Johnen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2023
[j21]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: 113804 (2023)- [j20]Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit:
Self-stabilizing systems in spite of high dynamics. Theor. Comput. Sci. 964: 113966 (2023) - 2022
- [j19]Stéphane Devismes, David Ilcinkas, Colette Johnen:
Optimized Silent Self-Stabilizing Scheme for Tree-Based Constructions. Algorithmica 84(1): 85-123 (2022) - 2020
- [j18]Mohammed Haddad, Colette Johnen, Sven Köhler:
Polynomial Silent Self-Stabilizing p-Star Decomposition†. Comput. J. 63(2): 253-266 (2020) - 2019
- [j17]Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz:
Maintaining a Distributed Spanning Forest in Highly Dynamic Networks. Comput. J. 62(2): 231-246 (2019) - [j16]Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen:
Disconnected components detection and rooted shortest-path tree maintenance in networks. J. Parallel Distributed Comput. 132: 299-309 (2019) - 2018
- [j15]Claire Capdevielle, Colette Johnen, Alessia Milani:
On the complexity of basic abstractions to implement consensus. Theor. Comput. Sci. 715: 86-96 (2018) - 2017
- [j14]Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani:
On the uncontended complexity of anonymous agreement. Distributed Comput. 30(6): 459-468 (2017) - [j13]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) - 2016
- [j12]Stéphane Devismes, Colette Johnen:
Silent self-stabilizing BFS tree algorithms revisited. J. Parallel Distributed Comput. 97: 11-23 (2016) - 2014
- [j11]Colette Johnen:
Fast, silent self-stabilizing distance-k independent dominating set construction. Inf. Process. Lett. 114(10): 551-555 (2014) - [j10]Colette Johnen, Fouzi Mekhaldi:
Self-stabilizing with service guarantee construction of 1-hop weight-based bounded size clusters. J. Parallel Distributed Comput. 74(1): 1900-1913 (2014) - 2009
- [j9]Colette Johnen, Le Huy Nguyen:
Robust self-stabilizing weight-based clustering algorithm. Theor. Comput. Sci. 410(6-7): 581-594 (2009) - 2008
- [j8]Kajari Ghosh Dastidar, Ted Herman, Colette Johnen:
Safe peer-to-peer self-downloading. ACM Trans. Auton. Adapt. Syst. 3(4): 19:1-19:18 (2008) - 2007
- [j7]Joffroy Beauquier, Maria Gradinariu, Colette Johnen:
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. Distributed Comput. 20(1): 75-93 (2007) - 2005
- [j6]Ted Herman, Colette Johnen:
Strategies for peer-to-peer downloading. Inf. Process. Lett. 94(5): 203-209 (2005) - 2004
- [j5]Colette Johnen, Franck Petit, Sébastien Tixeuil:
Autostabilisation et protocoles réseau. Tech. Sci. Informatiques 23(8): 1027-1056 (2004) - 2002
- [j4]Joffroy Beauquier, Maria Gradinariu, Colette Johnen, Jérôme Olivier Durand-Lose:
Token-Based Self-Stabilizing Uniform Algorithms. J. Parallel Distributed Comput. 62(5): 899-921 (2002) - [j3]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): 327-340 (2002) - 2001
- [j2]Colette Johnen, Ivan Lavallée, Christian Lavault:
Reliable Self-Stabilizing Communication for Quasi Rendezvous. Stud. Inform. Univ. 1(1): 59-76 (2001) - 2000
- [j1]Ajoy Kumar Datta, Colette Johnen, Franck Petit, Vincent Villain:
Self-stabilizing depth-first token circulation in arbitrary rooted networks. Distributed Comput. 13(4): 207-218 (2000)
Conference and Workshop Papers
- 2024
- [c52]Colette Johnen, Stéphane Devismes, Frédéric Mazoit, David Ilcinkas:
Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient. PODC 2024: 538-548 - [c51]Colette Johnen, Adnane Khattabi, Alessia Milani, Jennifer L. Welch:
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers. SIROCCO 2024: 318-335 - 2022
- [c50]Colette Johnen, Adnane Khattabi, Alessia Milani:
Efficient Wait-Free Queue Algorithms with Multiple Enqueuers and Multiple Dequeuers. OPODIS 2022: 4:1-4:19 - [c49]Lélia Blin, Colette Johnen, Gabriel Le Bouder, Franck Petit:
Silent Anonymous Snap-Stabilizing Termination Detection. SRDS 2022: 156-165 - 2021
- [c48]Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit:
Self-stabilizing Systems in Spite of High Dynamics. ICDCN 2021: 156-165 - [c47]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: 21-31 - [c46]Colette Johnen, Luciana Arantes, Pierre Sens:
FIFO and Atomic broadcast algorithms with bounded message size for dynamic systems. SRDS 2021: 277-287 - 2020
- [c45]Karine Altisen, Stéphane Devismes, Anaïs Durand, Colette Johnen, Franck Petit:
Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics. PODC 2020: 227-229 - 2019
- [c44]Stéphane Devismes, David Ilcinkas, Colette Johnen:
Silent self-stabilizing scheme for spanning-tree-like constructions. ICDCN 2019: 158-167 - [c43]Stéphane Devismes, Colette Johnen:
Self-Stabilizing Distributed Cooperative Reset. ICDCS 2019: 379-389 - [c42]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: 99-104 - 2016
- [c41]Stéphane Devismes, David Ilcinkas, Colette Johnen:
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. OPODIS 2016: 10:1-10:16 - [c40]Mohammed Haddad, Colette Johnen, Sven Köhler:
Polynomial Silent Self-Stabilizing p-Star Decomposition (Short Paper). SSS 2016: 185-189 - 2015
- [c39]Colette Johnen:
Memory Efficient Self-stabilizing Distance-k Independent Dominating Set Construction. NETYS 2015: 354-366 - [c38]Claire Capdevielle, Colette Johnen, Petr Kuznetsov, Alessia Milani:
On the Uncontended Complexity of Anonymous Consensus. OPODIS 2015: 12:1-12:16 - 2014
- [c37]Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz:
Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case. OPODIS 2014: 277-292 - [c36]Christian Glacet, Nicolas Hanusse, David Ilcinkas, Colette Johnen:
Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks. SSS 2014: 120-134 - [c35]Claire Capdevielle, Colette Johnen, Alessia Milani:
Solo-Fast Universal Constructions for Deterministic Abortable Objects. DISC 2014: 288-302 - 2013
- [c34]Colette Johnen:
Memory Efficient Self-Stabilizing k-Independent Dominating Set Construction. SSS 2013: 341-343 - 2012
- [c33]Colette Johnen, Fouzi Mekhaldi:
From Self- to Self-stabilizing with Service Guarantee 1-hop Weight-Based Clustering. SSS 2012: 163-178 - 2011
- [c32]Colette Johnen, Fouzi Mekhaldi:
Self-stabilization versus Robust Self-stabilization for Clustering in Ad-Hoc Network. Euro-Par (1) 2011: 117-129 - [c31]Colette Johnen, Fouzi Mekhaldi:
Self-Stabilizing Computation and Preservation of Knowledge of Neighbor Clusters. SASO 2011: 41-50 - 2010
- [c30]Colette Johnen, Fouzi Mekhaldi:
Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters. Euro-Par (1) 2010: 535-546 - [c29]Florent Kaisser, Colette Johnen, Véronique Vèque:
Quantitative model for evaluate routing protocols in a vehicular ad hoc networks on highway. VNC 2010: 330-337 - 2009
- [c28]Colette Johnen, Lisa Higham:
Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks. ICDCN 2009: 337-348 - [c27]Colette Johnen, Fouzi Mekhaldi:
Brief Announcement: Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters. SSS 2009: 787-788 - 2008
- [c26]Colette Johnen, Le Huy Nguyen:
Self-Stabilizing Construction of Bounded Size Clusters. ISPA 2008: 43-50 - [c25]Joffroy Beauquier, Colette Johnen:
Analyze of Probabilistic Algorithms under Indeterministic Scheduler. ISPA 2008: 553-558 - [c24]Colette Johnen, Lisa Higham:
Fault-tolerant implementations of atomic registers by safe registers in networks. PODC 2008: 449 - 2007
- [c23]Colette Johnen, Lisa Higham:
Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks. DISC 2007: 485-487 - 2006
- [c22]Colette Johnen, Le Huy Nguyen:
Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks. ALGOSENSORS 2006: 83-94 - [c21]Lisa Higham, Colette Johnen:
Relationships between communication models in networks using atomic registers. IPDPS 2006 - [c20]Colette Johnen, Le Huy Nguyen:
Robust Self-stabilizing Clustering Algorithm. OPODIS 2006: 410-424 - [c19]Joffroy Beauquier, Colette Johnen, Stéphane Messika:
All k -Bounded Policies Are Equivalent for Self-stabilization. SSS 2006: 82-94 - [c18]Kajari Ghosh Dastidar, Ted Herman, Colette Johnen:
Safe Peer-to-Peer Self-downloading. SSS 2006: 324-334 - [c17]Joffroy Beauquier, Colette Johnen, Stéphane Messika:
Brief Announcement: Computing Automatically the Stabilization Time Against the Worst and the Best Schedules. DISC 2006: 543-547 - 2004
- [c16]Colette Johnen:
Bounded Service Time and Memory Space Optimal Self-Stabilizing Token Circulation Protocol on Unidirectional Rings. IPDPS 2004 - 2003
- [c15]Colette Johnen, Sébastien Tixeuil:
Route Preserving Stabilization. Self-Stabilizing Systems 2003: 184-198 - 2002
- [c14]Colette Johnen:
Service Time Optimal Self-Stabilizing Token Circulation Protocol on Anonymous Unidrectional Rings. SRDS 2002: 80- - 2001
- [c13]Maria Gradinariu, Colette Johnen:
Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler. Euro-Par 2001: 458-465 - [c12]Faith E. Fich, Colette Johnen:
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings. DISC 2001: 224-239 - [c11]Joffroy Beauquier, Maria Gradinariu, Colette Johnen:
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary. WSS 2001: 19-34 - 2000
- [c10]Ivan Lavallée, Christian Lavault, Colette Johnen:
Fair and Reliable Self-stabilizing Communication. OPODIS 2000: 163-176 - 1999
- [c9]Colette Johnen, Luc Onana Alima, Ajoy Kumar Datta, Sébastien Tixeuil:
Self-Stabilizing Neighborhood Synchronizer in Tree Networks. ICDCS 1999: 487-494 - [c8]Joffroy Beauquier, Maria Gradinariu, Colette Johnen:
Memory Space Requirements for Self-Stabilizing Leader Election Protocols. PODC 1999: 199-207 - 1998
- [c7]Ajoy Kumar Datta, Colette Johnen, Franck Petit, Vincent Villain:
Self-stabilizing depth-first token circulation in arbitrary rooted networks. SIROCCO 1998: 229-243 - 1997
- [c6]Colette Johnen:
Memory Efficient, Self-Stabilizing Algorithm to Construct BFS Spanning Trees. PODC 1997: 288 - [c5]Colette Johnen, Gianluigi Alari, Joffroy Beauquier, Ajoy Kumar Datta:
Self-Stabilizing Depth-First Token Passing on Rooted Networks. WDAG 1997: 260-274 - [c4]Colette Johnen:
Memory-efficient self-stabilizing algorithm to construct BFS spanning trees. WSS 1997: 125-140 - 1990
- [c3]Gérard Berthelot, Colette Johnen, Laure Petrucci:
PAPETRI: Environment for the Analysis of Petri Nets. CAV 1990: 13-22 - [c2]Gérard Berthelot, Colette Johnen, Laure Petrucci:
PAPETRI: Environment for the Analysis of PETRI Nets. CAV (DIMACS/AMS volume) 1990: 43-56 - 1985
- [c1]Christine Choppy, Colette Johnen:
PETRIREVE: Proving Petri Net Properties with Rewriting Systems. RTA 1985: 271-286
Editorship
- 2021
- [e1]Colette Johnen, Elad Michael Schiller, Stefan Schmid:
Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, SSS 2021, Virtual Event, November 17-20, 2021, Proceedings. Lecture Notes in Computer Science 13046, Springer 2021, ISBN 978-3-030-91080-8 [contents]
Informal and Other Publications
- 2024
- [i11]Colette Johnen, Adnane Khattabi, Alessia Milani, Jennifer L. Welch:
Efficient Wait-Free Linearizable Implementations of Approximate Bounded Counters Using Read-Write Registers. CoRR abs/2402.14120 (2024) - 2023
- [i10]Stéphane Devismes, David Ilcinkas, Colette Johnen, Frédéric Mazoit:
Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments. CoRR abs/2307.06635 (2023) - [i9]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 abs/2307.16593 (2023) - 2019
- [i8]Stéphane Devismes, Colette Johnen:
Self-Stabilizing Distributed Cooperative Reset. CoRR abs/1901.03587 (2019) - [i7]Ajoy K. Datta, Stéphane Devismes, Colette Johnen, Lawrence L. Larmore:
Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree. CoRR abs/1907.07944 (2019) - 2017
- [i6]Stéphane Devismes, David Ilcinkas, Colette Johnen:
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps. CoRR abs/1703.03315 (2017) - 2015
- [i5]Stéphane Devismes, Colette Johnen:
Silent Self-stabilizing BFS Tree Algorithms Revised. CoRR abs/1509.03815 (2015) - 2014
- [i4]Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz:
Testing Temporal Connectivity in Sparse Dynamic Graphs. CoRR abs/1404.7634 (2014) - [i3]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 abs/1405.0170 (2014) - [i2]Matthieu Barjon, Arnaud Casteigts, Serge Chaumette, Colette Johnen, Yessin M. Neggaz:
Maintaining a Spanning Forest in Highly Dynamic Networks: The Synchronous Case. CoRR abs/1410.4373 (2014) - 2010
- [i1]Colette Johnen, Ivan Lavallée, Christian Lavault:
Reliable Self-Stabilizing Communication for Quasi Rendezvous. CoRR abs/1005.5630 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
