Emmanuel Godard

49 papers A* 2A 5B 13C 2Journal 24Unranked 3
YearRankTypeTitle / Venue / Authors
2026 J jnl
Leveraging Structural Knowledge for Solving Election in Anonymous Networks with Shared Randomness.
CoRR
Jérémie Chalopin, Emmanuel Godard
2025 B conf
A General Input-Dependent Colorless Computability Theorem and Applications to Core-Dependent Adversaries.
OPODIS
Yannis Coutouly, Emmanuel Godard
2025 J jnl
A General Input-Dependent Colorless Computability Theorem and Applications to Core-Dependent Adversaries.
CoRR
Yannis Coutouly, Emmanuel Godard
2025 J jnl
Stone Duality Proofs for Colorless Distributed Computability Theorems.
CoRR
Cameron Calk, Emmanuel Godard
2024 A conf
A Simple Computability Theorem for Colorless Tasks in Submodels of the Iterated Immediate Snapshot.
DISC
Yannis Coutouly, Emmanuel Godard
2023 A conf
A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement.
DISC
Yannis Coutouly, Emmanuel Godard
2023 J jnl
A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement.
CoRR
Yannis Coutouly, Emmanuel Godard
2022 J jnl
Snap-Stabilizing Tasks in Anonymous Networks.
CoRR
Emmanuel Godard
2021 J jnl
Back to the Coordinated Attack Problem.
CoRR
Emmanuel Godard, Eloi Perdereau
2020 J jnl
Back to the Coordinated Attack Problem.
Math. Struct. Comput. Sci.
Emmanuel Godard, Eloi Perdereau
2020 A* conf
From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems.
PODC
Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
2020 J jnl
Leader-based de-anonymization of an anonymous read/write memory.
Theor. Comput. Sci.
Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
2019 B conf
Anonymous Read/Write Memory: Leader Election and De-anonymization.
SIROCCO
Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
2019 — conf
Mutex-Based De-anonymization of an Anonymous Read/Write Memory.
NETYS
Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
2019 J jnl
Mutex-based Desanonymization of an Anonymous Read/Write Memory.
CoRR
Emmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld
2019 J jnl
Snap-Stabilizing Tasks in Anonymous Networks.
Theory Comput. Syst.
Emmanuel Godard
2016 C conf
Snap-Stabilizing Tasks in Anonymous Networks.
SSS
Emmanuel Godard
2016 J jnl
Using Binoculars for Fast Exploration and Map Construction in Chordal Graphs and Extensions.
CoRR
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
2016 B conf
k-Set Agreement in Communication Networks with Omission Faults.
OPODIS
Emmanuel Godard, Eloi Perdereau
2015 J jnl
A characterization of oblivious message adversaries for which Consensus is solvable.
Theor. Comput. Sci.
Étienne Coulouma, Emmanuel Godard, Joseph G. Peters
2015 A conf
Anonymous Graph Exploration with Binoculars.
DISC
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
2015 J jnl
Anonymous Graph Exploration with Binoculars.
CoRR
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
2015 J jnl
On the expressivity of time-varying graphs.
Theor. Comput. Sci.
Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
2014 C conf
Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is Hard.
ALGOSENSORS
Emmanuel Godard, Dorian Mazauric
2014 B conf
What Do We Need to Know to Elect in Networks with Unknown Participants?
SIROCCO
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
2013 B conf
A Characterization of Dynamic Networks Where Consensus Is Solvable.
SIROCCO
Étienne Coulouma, Emmanuel Godard
2013 B conf
Expressivity of Time-Varying Graphs.
FCT
Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
2012 J jnl
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives.
Algorithmica
Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès
2012 A* conf
Brief announcement: waiting in dynamic networks.
PODC
Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
2012 J jnl
Election in partially anonymous networks with arbitrary knowledge in message passing systems.
Distributed Comput.
Jérémie Chalopin, Emmanuel Godard, Yves Métivier
2012 J jnl
Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks
CoRR
Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita
2011 J jnl
Consensus vs Broadcast in Communication Networks with Arbitrary Mobile Omission Faults
CoRR
Emmanuel Godard, Joseph G. Peters
2011 B conf
Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults.
SIROCCO
Emmanuel Godard, Joseph G. Peters
2011 A conf
Minimal Obstructions for the Coordinated Attack Problem and Beyond.
IPDPS
Tristan Fevat, Emmanuel Godard
2010 J jnl
Termination Detection of Local Computations
CoRR
Emmanuel Godard, Yves Métivier, Gerard Tel
2008 A conf
Local Terminations and Distributed Computability in Anonymous Networks.
DISC
Jérémie Chalopin, Emmanuel Godard, Yves Métivier
2007 B conf
A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives.
SIROCCO
Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès
2007 — conf
About the Termination Detection in the Asynchronous Message Passing Model.
SOFSEM (1)
Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Gerard Tel
2006 B conf
Mobile Agent Algorithms Versus Message Passing Algorithms.
OPODIS
Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Rodrigue Ossamy
2004 J jnl
Characterizations of Classes of Graphs Recognizable by Local Computations.
Theory Comput. Syst.
Emmanuel Godard, Yves Métivier, Anca Muscholl
2003 J jnl
Acyclic and k-distance coloring of the grid.
Inf. Process. Lett.
Guillaume Fertin, Emmanuel Godard, André Raspaud
2003 J jnl
Deducible and Equivalent Structural Knowledges in Distributed Algorithms.
Theory Comput. Syst.
Emmanuel Godard, Yves Métivier
2002 B conf
A Characterization of Families of Graphs in Which Election Is Possible.
FoSSaCS
Emmanuel Godard, Yves Métivier
2002 J jnl
A self-stabilizing enumeration algorithm.
Inf. Process. Lett.
Emmanuel Godard
2002 B conf
Equivalence of Structural Knowledges in Distributed Algorithms.
SIROCCO
Emmanuel Godard, Yves Métivier
2002 J jnl
Minimum feedback vertex set and acyclic coloring.
Inf. Process. Lett.
Guillaume Fertin, Emmanuel Godard, André Raspaud
2002 B conf
Termination Detection of Distributed Algorithms by Graph Relabelling Systems.
ICGT
Emmanuel Godard, Yves Métivier, Mohamed Mosbah, Afif Sellami
2001 B conf
A Characterization of Classes of GraphsRecognizable by Local Computations with Initial Knowledge.
SIROCCO
Emmanuel Godard, Yves Métivier
1998 — conf
The Power of Local Computations in Graphs with Initial Knowledge.
TAGT
Emmanuel Godard, Yves Métivier, Anca Muscholl