Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Colette Johnen
2010 – today
- 2012
[c32]Colette Johnen, Fouzi Mekhaldi: From Self- to Self-stabilizing with Service Guarantee 1-hop Weight-Based Clustering. SSS 2012: 163-178- 2011
[c31]Colette Johnen, Fouzi Mekhaldi: Self-stabilization versus Robust Self-stabilization for Clustering in Ad-Hoc Network. Euro-Par (1) 2011: 117-129
[c30]Colette Johnen, Fouzi Mekhaldi: Self-Stabilizing Computation and Preservation of Knowledge of Neighbor Clusters. SASO 2011: 41-50- 2010
[c29]Colette Johnen, Fouzi Mekhaldi: Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters. Euro-Par (1) 2010: 535-546
[c28]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
2000 – 2009
- 2009
[j9]Colette Johnen, Le Huy Nguyen: Robust self-stabilizing weight-based clustering algorithm. Theor. Comput. Sci. 410(6-7): 581-594 (2009)
[c27]Colette Johnen, Lisa Higham: Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks. ICDCN 2009: 337-348
[c26]Colette Johnen, Fouzi Mekhaldi: Brief Announcement: Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters. SSS 2009: 787-788- 2008
[j8]Kajari Ghosh Dastidar, Ted Herman, Colette Johnen: Safe peer-to-peer self-downloading. TAAS 3(4) (2008)
[c25]Colette Johnen, Le Huy Nguyen: Self-Stabilizing Construction of Bounded Size Clusters. ISPA 2008: 43-50
[c24]Joffroy Beauquier, Colette Johnen: Analyze of Probabilistic Algorithms under Indeterministic Scheduler. ISPA 2008: 553-558
[c23]Colette Johnen, Lisa Higham: Fault-tolerant implementations of atomic registers by safe registers in networks. PODC 2008: 449- 2007
[j7]Joffroy Beauquier, Maria Gradinariu, Colette Johnen: Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. Distributed Computing 20(1): 75-93 (2007)
[c22]Colette Johnen, Lisa Higham: Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks. DISC 2007: 485-487- 2006
[c21]Colette Johnen, Le Huy Nguyen: Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks. ALGOSENSORS 2006: 83-94
[c20]Lisa Higham, Colette Johnen: Relationships between communication models in networks using atomic registers. IPDPS 2006
[c19]
[c18]Joffroy Beauquier, Colette Johnen, Stéphane Messika: All k -Bounded Policies Are Equivalent for Self-stabilization. SSS 2006: 82-94
[c17]Kajari Ghosh Dastidar, Ted Herman, Colette Johnen: Safe Peer-to-Peer Self-downloading. SSS 2006: 324-334
[c16]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- 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. Technique et Science Informatiques 23(8): 1027-1056 (2004)
[c15]Colette Johnen: Bounded Service Time and Memory Space Optimal Self-Stabilizing Token Circulation Protocol on Unidirectional Rings. IPDPS 2004- 2003
[c14]Colette Johnen, Sébastien Tixeuil: Route Preserving Stabilization. Self-Stabilizing Systems 2003: 184-198- 2002
[j4]Joffroy Beauquier, Maria Gradinariu, Colette Johnen, Jérôme Olivier Durand-Lose: Token-Based Self-Stabilizing Uniform Algorithms. J. Parallel Distrib. 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 Processing Letters 12(3-4): 327-340 (2002)
[c13]Colette Johnen: Service Time Optimal Self-Stabilizing Token Circulation Protocol on Anonymous Unidrectional Rings. SRDS 2002: 80-- 2001
[j2]Colette Johnen, Ivan Lavallée, Christian Lavault: Reliable Self-Stabilizing Communication for Quasi Rendezvous. Stud. Inform. Univ. 1(1): 59-76 (2001)
[c12]Maria Gradinariu, Colette Johnen: Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler. Euro-Par 2001: 458-465
[c11]Faith E. Fich, Colette Johnen: A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings. DISC 2001: 224-239
[c10]Joffroy Beauquier, Maria Gradinariu, Colette Johnen: Cross-Over Composition - Enforcement of Fairness under Unfair Adversary. WSS 2001: 19-34- 2000
[j1]Ajoy Kumar Datta, Colette Johnen, Franck Petit, Vincent Villain: Self-stabilizing depth-first token circulation in arbitrary rooted networks. Distributed Computing 13(4): 207-218 (2000)
[c9]Ivan Lavallée, Christian Lavault, Colette Johnen: Fair and Reliable Self-stabilizing Communication. OPODIS 2000: 163-176
1990 – 1999
- 1999
[c8]Colette Johnen, Luc Onana Alima, Ajoy Kumar Datta, Sébastien Tixeuil: Self-Stabilizing Neighborhood Synchronizer in Tree Networks. ICDCS 1999: 487-494
[c7]Joffroy Beauquier, Maria Gradinariu, Colette Johnen: Memory Space Requirements for Self-Stabilizing Leader Election Protocols. PODC 1999: 199-207- 1998
[c6]Ajoy Kumar Datta, Colette Johnen, Franck Petit, Vincent Villain: Self-stabilizing depth-first token circulation in arbitrary rooted networks. SIROCCO 1998: 229-243- 1997
[c5]Colette Johnen: Memory Efficient, Self-Stabilizing Algorithm to Construct BFS Spanning Trees. PODC 1997: 288
[c4]Colette Johnen, Gianluigi Alari, Joffroy Beauquier, Ajoy Kumar Datta: Self-Stabilizing Depth-First Token Passing on Rooted Networks. WDAG 1997: 260-274
[c3]Colette Johnen: Memory-efficient self-stabilizing algorithm to construct BFS spanning trees. WSS 1997: 125-140- 1990
[c2]Gérard Berthelot, Colette Johnen, Laure Petrucci: PAPETRI: Environment for the Analysis of Petri Nets. CAV 1990: 13-22
1980 – 1989
- 1985
[c1]Christine Choppy, Colette Johnen: PETRIREVE: Proving Petri Net Properties with Rewriting Systems. RTA 1985: 271-286
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:48 CET by the dblp team



