-
How to gather asynchronous oblivious robots on anonymous rings
A set of robots arbitrarily placed on the nodes of an anonymous graph have to meet at one common node and remain in there. This problem is known in the literature as... -
Round-based Synchrony Weakened by Message Adversaries vs Asynchrony Enriched ...
A message adversary is a daemon that suppresses messages in round-based message-passing synchronous systems in which no process crashes. A property imposed on a... -
From an intermittent rotating star to a leader
Ce rapport présente un protocole d'élection d'un leader inéluctable dans un système réparti défini par des hypothèses de synchronisme très faible. \\Considering an... -
In search of the holy grail: Looking for the weakest failure detector for wai...
Asynchronous failure detector-based set agreement algorithms proposed so far assume that all the processes participate in the algorithm. This means that (at least) the... -
Computing in the Presence of Concurrent Solo Executions
In a wait-free model any number of processes may crash. A process runs solo when it computes its local output without receiving any information from other processes,... -
Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarch...
International audience -
Synchrony weakened by message adversaries vs asynchrony restricted by failure...
International audience -
Evaluating Software Merge Quality
International audience
