Colette Johnen

	2009
36		Colette Johnen, Lisa Higham: Fault-Tolerant Implementations of Regular Registers by Safe Registers with Applications to Networks. ICDCN 2009: 337-348
35		Colette Johnen, Fouzi Mekhaldi: Brief Announcement: Robust Self-stabilizing Construction of Bounded Size Weight-Based Clusters. SSS 2009: 787-788
34		Colette Johnen, Le Huy Nguyen: Robust self-stabilizing weight-based clustering algorithm. Theor. Comput. Sci. 410(6-7): 581-594 (2009)
	2008
33		Colette Johnen, Le Huy Nguyen: Self-Stabilizing Construction of Bounded Size Clusters. ISPA 2008: 43-50
32		Joffroy Beauquier, Colette Johnen: Analyze of Probabilistic Algorithms under Indeterministic Scheduler. ISPA 2008: 553-558
31		Colette Johnen, Lisa Higham: Fault-tolerant implementations of atomic registers by safe registers in networks. PODC 2008: 449
30		Kajari Ghosh Dastidar, Ted Herman, Colette Johnen: Safe peer-to-peer self-downloading. TAAS 3(4): (2008)
	2007
29		Colette Johnen, Lisa Higham: Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks. DISC 2007: 485-487
28		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)
	2006
27		Colette Johnen, Le Huy Nguyen: Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks. ALGOSENSORS 2006: 83-94
26		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
25		Lisa Higham, Colette Johnen: Relationships between communication models in networks using atomic registers. IPDPS 2006
24		Colette Johnen, Le Huy Nguyen: Robust Self-stabilizing Clustering Algorithm. OPODIS 2006: 410-424
23		Kajari Ghosh Dastidar, Ted Herman, Colette Johnen: Safe Peer-to-Peer Self-downloading. SSS 2006: 324-334
22		Joffroy Beauquier, Colette Johnen, Stéphane Messika: All k -Bounded Policies Are Equivalent for Self-stabilization. SSS 2006: 82-94
	2005
21		Ted Herman, Colette Johnen: Strategies for peer-to-peer downloading. Inf. Process. Lett. 94(5): 203-209 (2005)
	2004
20		Colette Johnen: Bounded Service Time and Memory Space Optimal Self-Stabilizing Token Circulation Protocol on Unidirectional Rings. IPDPS 2004
19		Colette Johnen, Franck Petit, Sébastien Tixeuil: Autostabilisation et protocoles réseau. Technique et Science Informatiques 23(8): 1027-1056 (2004)
	2003
18		Colette Johnen, Sébastien Tixeuil: Route Preserving Stabilization. Self-Stabilizing Systems 2003: 184-198
	2002
17		Colette Johnen: Service Time Optimal Self-Stabilizing Token Circulation Protocol on Anonymous Unidrectional Rings. SRDS 2002: 80-
16		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)
15		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)
	2001
14		Faith E. Fich, Colette Johnen: A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings. DISC 2001: 224-239
13		Maria Gradinariu, Colette Johnen: Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler. Euro-Par 2001: 458-465
12		Joffroy Beauquier, Maria Gradinariu, Colette Johnen: Cross-Over Composition - Enforcement of Fairness under Unfair Adversary. WSS 2001: 19-34
11		Colette Johnen, Ivan Lavallée, Christian Lavault: Reliable Self-Stabilizing Communication for Quasi Rendezvous. Stud. Inform. Univ. 1(1): 59-76 (2001)
	2000
10		Ivan Lavallée, Christian Lavault, Colette Johnen: Fair and Reliable Self-stabilizing Communication. OPODIS 2000: 163-176
9		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)
	1999
8		Colette Johnen, Luc Onana Alima, Ajoy Kumar Datta, Sébastien Tixeuil: Self-Stabilizing Neighborhood Synchronizer in Tree Networks. ICDCS 1999: 487-494
7		Joffroy Beauquier, Maria Gradinariu, Colette Johnen: Memory Space Requirements for Self-Stabilizing Leader Election Protocols. PODC 1999: 199-207
	1998
6		Ajoy Kumar Datta, Colette Johnen, Franck Petit, Vincent Villain: Self-stabilizing depth-first token circulation in arbitrary rooted networks. SIROCCO 1998: 229-243
	1997
5		Colette Johnen: Memory Efficient, Self-Stabilizing Algorithm to Construct BFS Spanning Trees. PODC 1997: 288
4		Colette Johnen, Gianluigi Alari, Joffroy Beauquier, Ajoy Kumar Datta: Self-Stabilizing Depth-First Token Passing on Rooted Networks. WDAG 1997: 260-274
3		Colette Johnen: Memory-efficient self-stabilizing algorithm to construct BFS spanning trees. WSS 1997: 125-140
	1990
2		Gérard Berthelot, Colette Johnen, Laure Petrucci: PAPETRI: Environment for the Analysis of Petri Nets. CAV 1990: 13-22
	1985
1		Christine Choppy, Colette Johnen: PETRIREVE: Proving Petri Net Properties with Rewriting Systems. RTA 1985: 271-286

Coauthor Index

1	Gianluigi Alari	[4]
2	Luc Onana Alima	[8] [15]
3	Joffroy Beauquier	[4] [7] [12] [16] [22] [26] [28] [32]
4	Gérard Berthelot	[2]
5	Christine Choppy	[1]
6	Kajari Ghosh Dastidar	[23] [30]
7	Ajoy Kumar Datta	[4] [6] [8] [9] [15]
8	Jérôme Olivier Durand-Lose (Jérôme Durand-Lose)	[16]
9	Faith Ellen (Faith Ellen Fich, Faith E. Fich)	[14]
10	Ted Herman	[21] [23] [30]
11	Lisa Higham	[25] [29] [31] [36]
12	Ivan Lavallée	[10] [11]
13	Christian Lavault	[10] [11]
14	Fouzi Mekhaldi	[35]
15	Stéphane Messika	[22] [26]
16	Le Huy Nguyen	[24] [27] [33] [34]
17	Franck Petit	[6] [9] [19]
18	Laure Petrucci (Laure Petrucci-Dauchy)	[2]
19	Maria Gradinariu Potop-Butucaru (Maria Potop-Butucaru, Maria Gradinariu)	[7] [12] [13] [16] [28]
20	Sébastien Tixeuil	[8] [15] [18] [19]
21	Vincent Villain	[6] [9]

Colors in the list of coauthors