6 citations · 23 across the 9 of their papers we have counts for
9 papers
A Topology by Geometrization for Sub-Iterated Immediate Snapshot Message Adversaries and Applications to Set-Agreement
Yannis Coutouly, Emmanuel Godard
The Iterated Immediate Snapshot model (IIS) is a central model in the message adversary setting. We consider general message adversaries whose executions are arbitrary subsets of t…
Snap-Stabilizing Tasks in Anonymous Networks
Emmanuel Godard
We consider snap-stabilizing algorithms in anonymous networks. Self-stabilizing algorithms are well known fault tolerant algorithms : a self-stabilizing algorithm will eventually r…
Back to the Coordinated Attack Problem
Emmanuel Godard, Eloi Perdereau
We consider the well known Coordinated Attack Problem, where two generals have to decide on a common attack, when their messengers can be captured by the enemy. Informally, this pr…
Mutex-based Desanonymization of an Anonymous Read/Write Memory
Emmanuel Godard, Damien Imbs, Michel Raynal +1
Anonymous shared memory is a memory in which processes use different names for the same shared read/write register. As an example, a shared register named by a process and…
Using Binoculars for Fast Exploration and Map Construction in Chordal Graphs and Extensions
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
We investigate the exploration and mapping of anonymous graphs by a mobile agent. It is long known that, without global information about the graph, it is not possible to make the…
Anonymous Graph Exploration with Binoculars
Jérémie Chalopin, Emmanuel Godard, Antoine Naudin
We investigate the exploration of networks by a mobile agent. It is long known that, without global information about the graph, it is not possible to make the agent halts after th…
Expressivity of Time-Varying Graphs and the Power of Waiting in Dynamic Networks
Arnaud Casteigts, Paola Flocchini, Emmanuel Godard +2
In infrastructure-less highly dynamic networks, computing and performing even basic tasks (such as routing and broadcasting) is a very challenging activity due to the fact that con…
Consensus vs Broadcast in Communication Networks with Arbitrary Mobile Omission Faults
Emmanuel Godard, Joseph Peters
We compare the solvability of the Consensus and Broadcast problems in synchronous communication networks in which the delivery of messages is not reliable. The failure model is the…
Termination Detection of Local Computations
Emmanuel Godard, Yves Métivier, Gerard Tel
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble…