Emmanuel Godard

Publication Activity (10 Years)

Years Active: 1998-2023
Publications (10 Years): 18

Top Topics

Mutual Exclusion

Dynamic Networks

Graph Theoretic

External Memory

Top Venues

Theor. Comput. Sci.

Publications

Yannis Coutouly, Emmanuel Godard
A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement. DISC (2023)
Yannis Coutouly, Emmanuel Godard
A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement. CoRR (2023)
Emmanuel Godard
Snap-Stabilizing Tasks in Anonymous Networks. CoRR (2022)
Emmanuel Godard, Eloi Perdereau
Back to the Coordinated Attack Problem. CoRR (2021)
Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
Leader-based de-anonymization of an anonymous read/write memory. Theor. Comput. Sci. 836 (2020)
Emmanuel Godard, Eloi Perdereau
Back to the Coordinated Attack Problem. Math. Struct. Comput. Sci. 30 (10) (2020)
Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems. PODC (2020)
Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
Anonymous Read/Write Memory: Leader Election and De-anonymization. SIROCCO (2019)
Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
Mutex-based Desanonymization of an Anonymous Read/Write Memory. CoRR (2019)
Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
Mutex-Based De-anonymization of an Anonymous Read/Write Memory. NETYS (2019)
Emmanuel Godard
Snap-Stabilizing Tasks in Anonymous Networks. Theory Comput. Syst. 63 (2) (2019)
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
Using Binoculars for Fast Exploration and Map Construction in Chordal Graphs and Extensions. CoRR (2016)
Emmanuel Godard
Snap-Stabilizing Tasks in Anonymous Networks. SSS (2016)
Emmanuel Godard, Eloi Perdereau
k-Set Agreement in Communication Networks with Omission Faults. OPODIS (2016)
Étienne Coulouma, Emmanuel Godard, Joseph G. Peters
A characterization of oblivious message adversaries for which Consensus is solvable. Theor. Comput. Sci. 584 (2015)
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
Anonymous Graph Exploration with Binoculars. DISC (2015)
Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
On the expressivity of time-varying graphs. Theor. Comput. Sci. 590 (2015)
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
Anonymous Graph Exploration with Binoculars. CoRR (2015)
Emmanuel Godard, Dorian Mazauric
Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Hard. ALGOSENSORS (2014)
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
What Do We Need to Know to Elect in Networks with Unknown Participants? SIROCCO (2014)
Étienne Coulouma, Emmanuel Godard
A Characterization of Dynamic Networks Where Consensus Is Solvable. SIROCCO (2013)
Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
Expressivity of Time-Varying Graphs. FCT (2013)
Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks CoRR (2012)
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) (2012)
Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
Brief announcement: waiting in dynamic networks. PODC (2012)
Jérémie Chalopin, Emmanuel Godard, Yves Métivier
Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distributed Comput. 25 (4) (2012)
Tristan Fevat, Emmanuel Godard
Minimal Obstructions for the Coordinated Attack Problem and Beyond. IPDPS (2011)
Emmanuel Godard, Joseph G. Peters
Consensus vs Broadcast in Communication Networks with Arbitrary Mobile Omission Faults CoRR (2011)
Emmanuel Godard, Joseph G. Peters
Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults. SIROCCO (2011)
Emmanuel Godard, Yves Métivier, Gerard Tel
Termination Detection of Local Computations CoRR (2010)
Jérémie Chalopin, Emmanuel Godard, Yves Métivier
Local Terminations and Distributed Computability in Anonymous Networks. DISC (2008)
Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Gerard Tel
About the Termination Detection in the Asynchronous Message Passing Model. SOFSEM (1) (2007)
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)
Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Rodrigue Ossamy
Mobile Agent Algorithms Versus Message Passing Algorithms. OPODIS (2006)
Emmanuel Godard, Yves Métivier, Anca Muscholl
Characterizations of Classes of Graphs Recognizable by Local Computations. Theory Comput. Syst. 37 (2) (2004)
Emmanuel Godard, Yves Métivier
Deducible and Equivalent Structural Knowledges in Distributed Algorithms. Theory Comput. Syst. 36 (6) (2003)
Guillaume Fertin, Emmanuel Godard, André Raspaud
Acyclic and k-distance coloring of the grid. Inf. Process. Lett. 87 (1) (2003)
Emmanuel Godard, Yves Métivier, Mohamed Mosbah, Afif Sellami
Termination Detection of Distributed Algorithms by Graph Relabelling Systems. ICGT (2002)
Emmanuel Godard, Yves Métivier
A Characterization of Families of Graphs in Which Election Is Possible. FoSSaCS (2002)
Emmanuel Godard
A self-stabilizing enumeration algorithm. Inf. Process. Lett. 82 (6) (2002)
Guillaume Fertin, Emmanuel Godard, André Raspaud
Minimum feedback vertex set and acyclic coloring. Inf. Process. Lett. 84 (3) (2002)
Emmanuel Godard, Yves Métivier
Equivalence of Structural Knowledges in Distributed Algorithms. SIROCCO (2002)
Emmanuel Godard, Yves Métivier
A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge. SIROCCO (2001)
Emmanuel Godard, Yves Métivier, Anca Muscholl
The Power of Local Computations in Graphs with Initial Knowledge. TAGT (1998)