Emmanuel Godard

	2012
20		Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès: A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. Algorithmica 62(1-2): 146-168 (2012)
19		Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita: Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks CoRR abs/1205.1975: (2012)
	2011
18		Tristan Fevat, Emmanuel Godard: Minimal Obstructions for the Coordinated Attack Problem and Beyond. IPDPS 2011: 1001-1011
17		Emmanuel Godard, Joseph Peters: Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults. SIROCCO 2011: 29-41
16		Emmanuel Godard, Joseph Peters: Consensus vs Broadcast in Communication Networks with Arbitrary Mobile Omission Faults CoRR abs/1106.3579: (2011)
	2010
15		Emmanuel Godard, Yves Métivier, Gerard Tel: Termination Detection of Local Computations CoRR abs/1001.2785: (2010)
	2008
14		Jérémie Chalopin, Emmanuel Godard, Yves Métivier: Local Terminations and Distributed Computability in Anonymous Networks. DISC 2008: 47-62
	2007
13		Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès: A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. SIROCCO 2007: 81-95
12		Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Gerard Tel: About the Termination Detection in the Asynchronous Message Passing Model. SOFSEM (1) 2007: 200-211
	2006
11		Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Rodrigue Ossamy: Mobile Agent Algorithms Versus Message Passing Algorithms. OPODIS 2006: 187-201
	2004
10		Emmanuel Godard, Yves Métivier, Anca Muscholl: Characterizations of Classes of Graphs Recognizable by Local Computations. Theory Comput. Syst. 37(2): 249-293 (2004)
	2003
9		Guillaume Fertin, Emmanuel Godard, André Raspaud: Acyclic and k-distance coloring of the grid. Inf. Process. Lett. 87(1): 51-58 (2003)
8		Emmanuel Godard, Yves Métivier: Deducible and Equivalent Structural Knowledges in Distributed Algorithms. Theory Comput. Syst. 36(6): 631-654 (2003)
	2002
7		Emmanuel Godard, Yves Métivier: A Characterization of Families of Graphs in Which Election Is Possible. FoSSaCS 2002: 159-172
6		Emmanuel Godard, Yves Métivier, Mohamed Mosbah, Afif Sellami: Termination Detection of Distributed Algorithms by Graph Relabelling Systems. ICGT 2002: 106-119
5		Emmanuel Godard, Yves Métivier: Equivalence of Structural Knowledges in Distributed Algorithms. SIROCCO 2002: 149-164
4		Emmanuel Godard: A self-stabilizing enumeration algorithm. Inf. Process. Lett. 82(6): 299-305 (2002)
3		Guillaume Fertin, Emmanuel Godard, André Raspaud: Minimum feedback vertex set and acyclic coloring. Inf. Process. Lett. 84(3): 131-139 (2002)
	2001
2		Emmanuel Godard, Yves Métivier: A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge. SIROCCO 2001: 179-194
	1998
1		Emmanuel Godard, Yves Métivier, Anca Muscholl: The Power of Local Computations in Graphs with Initial Knowledge. TAGT 1998: 71-84

Coauthor Index

1	Arnaud Casteigts	[19]
2	Jérémie Chalopin	[11] [12] [14]
3	Victor Chepoi	[13] [20]
4	Guillaume Fertin	[3] [9]
5	Tristan Fevat	[13] [18] [20]
6	Paola Flocchini	[19]
7	Yves Métivier	[1] [2] [5] [6] [7] [8] [10] [11] [12] [14] [15]
8	Mohamed Mosbah	[6]
9	Anca Muscholl	[1] [10]
10	Rodrigue Ossamy	[11]
11	Joseph Peters	[16] [17]
12	André Raspaud	[3] [9]
13	Nicola Santoro	[19]
14	Afif Sellami	[6]
15	Gerard Tel	[12] [15]
16	Yann Vaxès	[13] [20]
17	Masafumi Yamashita	[19]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page