3 citations · 4 across the 4 of their papers we have counts for
6 papers
When Is Recoverable Consensus Harder Than Consensus?
Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier +1
We study the ability of different shared object types to solve recoverable consensus using non-volatile shared memory in a system with crashes and recoveries. In particular, we com…
-Resilient -Immediate Snapshot and its Relation with Agreement Problems
Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum +1
An immediate snapshot object is a high level communication object, built on top of a read/write distributed system in which all except one processes may crash. It allows a process…
Distributed Computing in the Asynchronous LOCAL model
Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud +1
The LOCAL model is among the main models for studying locality in the framework of distributed network computing. This model is however subject to pertinent criticisms, including t…
A characterization of colorless anonymous -resilient task computability
Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum +1
A task is a distributed problem for processes, in which each process starts with a private input value, communicates with other processes, and eventually decides an output valu…
On the Space Complexity of Set Agreement
Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov +1
The -set agreement problem is a generalization of the classical consensus problem in which processes are permitted to output up to different input values. In a system of …
Fault-Tolerant Consensus in Unknown and Anonymous Networks
Carole Delporte-Gallet, Hugues Fauconnier, Andreas Tielmann
This paper investigates under which conditions information can be reliably shared and consensus can be solved in unknown and anonymous message-passing networks that suffer from cra…