Emmanuel Godard

发表

Minimal Obstructions for the Coordinated Attack Problem and Beyond

Tristan Fevat, Emmanuel Godard, Emmanuel Godard, 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

Anonymous Graph Exploration with Binoculars

Jérémie Chalopin, Emmanuel Godard, Antoine Naudin, 2015, DISC.

Equivalence of Structural Knowledges in Distributed Algorithms

Yves Métivier, Emmanuel Godard, 2002, SIROCCO.

A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge

Yves Métivier, Emmanuel Godard, 2001, SIROCCO.

Snap-Stabilizing Tasks in Anonymous Networks

Emmanuel Godard, 2016, SSS.

Brief announcement: waiting in dynamic networks

Nicola Santoro, Paola Flocchini, Masafumi Yamashita, 2012, PODC '12.

Snap-Stabilizing Tasks in Anonymous Networks

Emmanuel Godard, 2018, Theory of Computing Systems.

A characterization of oblivious message adversaries for which Consensus is solvable

Emmanuel Godard, Joseph G. Peters, Étienne Coulouma, 2015, Theor. Comput. Sci..

A Characterization of Families of Graphs in Which Election Is Possible

Yves Métivier, Emmanuel Godard, 2002, FoSSaCS.

Using Binoculars for Fast Exploration and Map Construction in Chordal Graphs and Extensions pdf

Jérémie Chalopin, Emmanuel Godard, Antoine Naudin, 2016, ArXiv.

Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults

Emmanuel Godard, Joseph G. Peters, 2011, SIROCCO.

A self-stabilizing enumeration algorithm

Emmanuel Godard, 2002, Inf. Process. Lett..

Leader-based de-anonymization of an anonymous read/write memory

Michel Raynal, Gadi Taubenfeld, Damien Imbs, 2020, Theor. Comput. Sci..

Anonymous Read/Write Memory: Leader Election and De-anonymization

Michel Raynal, Gadi Taubenfeld, Damien Imbs, 2019, SIROCCO.

What Do We Need to Know to Elect in Networks with Unknown Participants?

Jérémie Chalopin, Emmanuel Godard, Antoine Naudin, 2014, SIROCCO.

The Power of Local Computations in Graphs with Initial Knowledge

Anca Muscholl, Yves Métivier, Emmanuel Godard, 1998, TAGT.

Mutex-based Desanonymization of an Anonymous Read/Write Memory

Michel Raynal, Gadi Taubenfeld, Damien Imbs, 2019, NETYS.

k-Set Agreement in Communication Networks with Omission Faults

Emmanuel Godard, Eloi Perdereau, Emmanuel Godard, 2016, OPODIS.

A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives

Victor Chepoi, Tristan Fevat, Emmanuel Godard, 2007, Algorithmica.

Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Hard

Dorian Mazauric, Emmanuel Godard, Dorian Mazauric, 2014, ALGOSENSORS.

Deducible and Equivalent Structural Knowledges in Distributed Algorithms

Yves Métivier, Emmanuel Godard, 2003, Theory of Computing Systems.

Mobile Agent Algorithms Versus Message Passing Algorithms

Yves Métivier, Jérémie Chalopin, Emmanuel Godard, 2006, OPODIS.

Termination Detection of Local Computations pdf

Yves Métivier, Gerard Tel, Emmanuel Godard, 2010, ArXiv.

Local Terminations and Distributed Computability in Anonymous Networks

Yves Métivier, Jérémie Chalopin, Emmanuel Godard, 2008, DISC.

Expressivity of Time-Varying Graphs

Nicola Santoro, Paola Flocchini, Masafumi Yamashita, 2013, FCT.

Minimum feedback vertex set and acyclic coloring

André Raspaud, Guillaume Fertin, Emmanuel Godard, 2002, Inf. Process. Lett..

Expressivity of Time-Varying Graphs

Nicola Santoro, Paola Flocchini, Masafumi Yamashita, 2013, FCT.

About the Termination Detection in the Asynchronous Message Passing Model

Yves Métivier, Gerard Tel, Jérémie Chalopin, 2007, SOFSEM.

A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives

Victor Chepoi, Tristan Fevat, Emmanuel Godard, 2007, Algorithmica.

Election in partially anonymous networks with arbitrary knowledge in message passing systems

Yves Métivier, Jérémie Chalopin, Emmanuel Godard, 2012, Distributed Computing.

Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks pdf

Nicola Santoro, Paola Flocchini, Masafumi Yamashita, 2012, ArXiv.

From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems

Michel Raynal, Gadi Taubenfeld, Damien Imbs, 2020, PODC.

Editor’s Note: Special Issue on Stabilization, Safety, and Security of Distributed Systems

Boaz Patt-Shamir, Franck Petit, Carole Delporte-Gallet, 2019, Theory of Computing Systems.

Characterizations of Classes of Graphs Recognizable by Local Computations

Anca Muscholl, Yves Métivier, Emmanuel Godard, 2003, Theory of Computing Systems.

Acyclic and k-distance coloring of the grid

André Raspaud, Guillaume Fertin, Emmanuel Godard, 2003, Inf. Process. Lett..

A Characterization of Dynamic Networks Where Consensus Is Solvable

Emmanuel Godard, Étienne Coulouma, 2013, SIROCCO.

Termination Detection of Distributed Algorithms by Graph Relabelling Systems

Yves Métivier, Emmanuel Godard, Mohamed Mosbah, 2002, ICGT.