Emmanuel Godard - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2023

A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-AgreementYannis Coutouly, Emmanuel Godard. wdag 2023: [doi]

2020

Back to the Coordinated Attack ProblemEmmanuel Godard, Eloi Perdereau. mscs, 30(10):1089-1113, 2020. [doi]

Leader-based de-anonymization of an anonymous read/write memoryEmmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld. TCS, 836:110-123, 2020. [doi]

From Bezout's Identity to Space-Optimal Election in Anonymous Memory SystemsEmmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld. podc 2020: 41-50 [doi]

2019

Snap-Stabilizing Tasks in Anonymous NetworksEmmanuel Godard. mst, 63(2):326-343, 2019. [doi]

Mutex-Based De-anonymization of an Anonymous Read/Write MemoryEmmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld. netys 2019: 311-326 [doi]

Anonymous Read/Write Memory: Leader Election and De-anonymizationEmmanuel Godard, Damien Imbs, Michel Raynal, Gadi Taubenfeld. sirocco 2019: 246-261 [doi]

2016

k-Set Agreement in Communication Networks with Omission FaultsEmmanuel Godard, Eloi Perdereau. opodis 2017: [doi]

Snap-Stabilizing Tasks in Anonymous NetworksEmmanuel Godard. sss 2016: 170-184 [doi]

2015

2014

What Do We Need to Know to Elect in Networks with Unknown Participants?Jérémie Chalopin, Emmanuel Godard, Antoine Naudin. sirocco 2014: 279-294 [doi]

Computing the Dynamic Diameter of Non-Deterministic Dynamic Networks is HardEmmanuel Godard, Dorian Mazauric. algosensors 2015: 88-102 [doi]

2013

Expressivity of Time-Varying GraphsArnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita. fct 2013: 95-106 [doi]

A Characterization of Dynamic Networks Where Consensus Is SolvableÉtienne Coulouma, Emmanuel Godard. sirocco 2013: 24-35 [doi]

2012

2011

Minimal Obstructions for the Coordinated Attack Problem and BeyondTristan Fevat, Emmanuel Godard. ipps 2011: 1001-1011 [doi]

Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission FaultsEmmanuel Godard, Joseph Peters. sirocco 2011: 29-41 [doi]

2008

Local Terminations and Distributed Computability in Anonymous NetworksJérémie Chalopin, Emmanuel Godard, Yves Métivier. wdag 2008: 47-62 [doi]

2007

About the Termination Detection in the Asynchronous Message Passing ModelJérémie Chalopin, Emmanuel Godard, Yves Métivier, Gerard Tel. sofsem 2007: 200-211 [doi]

A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their RelativesVictor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès. sirocco 2007: 81-95 [doi]

2006

Mobile Agent Algorithms Versus Message Passing AlgorithmsJérémie Chalopin, Emmanuel Godard, Yves Métivier, Rodrigue Ossamy. opodis 2006: 187-201 [doi]

2004

Characterizations of Classes of Graphs Recognizable by Local ComputationsEmmanuel Godard, Yves Métivier, Anca Muscholl. mst, 37(2):249-293, 2004. [doi]

2003

Acyclic and k-distance coloring of the gridGuillaume Fertin, Emmanuel Godard, André Raspaud. ipl, 87(1):51-58, 2003. [doi]

Deducible and Equivalent Structural Knowledges in Distributed AlgorithmsEmmanuel Godard, Yves Métivier. mst, 36(6):631-654, 2003. [doi]

2002

2001

A Characterization of Classes of GraphsRecognizable by Local Computations with Initial KnowledgeEmmanuel Godard, Yves Métivier. sirocco 2001: 179-194

1998

The Power of Local Computations in Graphs with Initial KnowledgeEmmanuel Godard, Yves Métivier, Anca Muscholl. tagt 2000: 71-84

Sign in or sign up to see more results.

runs on WebDSL