The Power of Local Computations in Graphs with Initial Knowledge. - Emmanuel Godard; Yves Métivier; Anca Muscholl (TAGT, 1998)

A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge. - Emmanuel Godard; Yves Métivier (SIROCCO, 2001)

A Characterization of Families of Graphs in Which Election Is Possible. - Emmanuel Godard; Yves Métivier (FoSSaCS, 2002)

Termination Detection of Distributed Algorithms by Graph Relabelling Systems. - Emmanuel Godard; Yves Métivier; Mohamed Mosbah 001; Afif Sellami (ICGT, 2002)

Equivalence of Structural Knowledges in Distributed Algorithms. - Emmanuel Godard; Yves Métivier (SIROCCO, 2002)

Minimum feedback vertex set and acyclic coloring. - Guillaume Fertin; Emmanuel Godard; André Raspaud (Inf. Process. Lett., 2002)

A self-stabilizing enumeration algorithm. - Emmanuel Godard (Inf. Process. Lett., 2002)

Acyclic and k-distance coloring of the grid. - Guillaume Fertin; Emmanuel Godard; André Raspaud (Inf. Process. Lett., 2003)

Deducible and Equivalent Structural Knowledges in Distributed Algorithms. - Emmanuel Godard; Yves Métivier (Theory Comput. Syst., 2003)

Characterizations of Classes of Graphs Recognizable by Local Computations. - Emmanuel Godard; Yves Métivier; Anca Muscholl (Theory Comput. Syst., 2004)

Mobile Agent Algorithms Versus Message Passing Algorithms. - Jérémie Chalopin; Emmanuel Godard; Yves Métivier; Rodrigue Ossamy (OPODIS, 2006)

About the Termination Detection in the Asynchronous Message Passing Model. - Jérémie Chalopin; Emmanuel Godard; Yves Métivier; Gerard Tel (SOFSEM (1), 2007)

Local Terminations and Distributed Computability in Anonymous Networks. - Jérémie Chalopin; Emmanuel Godard; Yves Métivier (DISC, 2008)

Termination Detection of Local Computations - Emmanuel Godard; Yves Métivier; Gerard Tel (CoRR, 2010)

Minimal Obstructions for the Coordinated Attack Problem and Beyond. - Tristan Fevat; Emmanuel Godard (IPDPS, 2011)

Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults. - Emmanuel Godard; Joseph G. Peters (SIROCCO, 2011)

Brief announcement: waiting in dynamic networks. - Arnaud Casteigts; Paola Flocchini; Emmanuel Godard; Nicola Santoro; Masafumi Yamashita (PODC, 2012)

A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives. - Victor Chepoi; Tristan Fevat; Emmanuel Godard; Yann Vaxès (Algorithmica, 2012)

Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks - Arnaud Casteigts; Paola Flocchini; Emmanuel Godard; Nicola Santoro; Masafumi Yamashita (CoRR, 2012)

Election in partially anonymous networks with arbitrary knowledge in message passing systems. - Jérémie Chalopin; Emmanuel Godard; Yves Métivier (Distributed Comput., 2012)

A Characterization of Dynamic Networks Where Consensus Is Solvable. - Étienne Coulouma; Emmanuel Godard (SIROCCO, 2013)

Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Hard. - Emmanuel Godard; Dorian Mazauric (ALGOSENSORS, 2014)

What Do We Need to Know to Elect in Networks with Unknown Participants? - Jérémie Chalopin; Emmanuel Godard; Antoine Naudin (SIROCCO, 2014)

Anonymous Graph Exploration with Binoculars. - Jérémie Chalopin; Emmanuel Godard; Antoine Naudin (DISC, 2015)

On the expressivity of time-varying graphs. - Arnaud Casteigts; Paola Flocchini; Emmanuel Godard; Nicola Santoro; Masafumi Yamashita (Theor. Comput. Sci., 2015)

A characterization of oblivious message adversaries for which Consensus is solvable. - Étienne Coulouma; Emmanuel Godard; Joseph G. Peters (Theor. Comput. Sci., 2015)

k-Set Agreement in Communication Networks with Omission Faults. - Emmanuel Godard; Eloi Perdereau (OPODIS, 2016)

Using Binoculars for Fast Exploration and Map Construction in Chordal Graphs and Extensions. - Jérémie Chalopin; Emmanuel Godard; Antoine Naudin (CoRR, 2016)

Mutex-Based De-anonymization of an Anonymous Read/Write Memory. - Emmanuel Godard; Damien Imbs; Michel Raynal; Gadi Taubenfeld (NETYS, 2019)

Anonymous Read/Write Memory: Leader Election and De-anonymization. - Emmanuel Godard; Damien Imbs; Michel Raynal; Gadi Taubenfeld (SIROCCO, 2019)

Mutex-based Desanonymization of an Anonymous Read/Write Memory. - Emmanuel Godard; Damien Imbs; Michel Raynal; Gadi Taubenfeld (CoRR, 2019)

Snap-Stabilizing Tasks in Anonymous Networks. - Emmanuel Godard (Theory Comput. Syst., 2019)

From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems. - Emmanuel Godard; Damien Imbs; Michel Raynal; Gadi Taubenfeld (PODC, 2020)

Back to the Coordinated Attack Problem. - Emmanuel Godard; Eloi Perdereau (Math. Struct. Comput. Sci., 2020)

Leader-based de-anonymization of an anonymous read/write memory. - Emmanuel Godard; Damien Imbs; Michel Raynal; Gadi Taubenfeld (Theor. Comput. Sci., 2020)

A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement. - Yannis Coutouly; Emmanuel Godard (DISC, 2023)

A Simple Computability Theorem for Colorless Tasks in Submodels of the Iterated Immediate Snapshot. - Yannis Coutouly; Emmanuel Godard (DISC, 2024)