3 citations · 6 across the 6 of their papers we have counts for
8 papers
Some New Results With k-set agreement
Delporte-Gallet Carole, Fauconnier Hugues, Safir Mouna
In this article, we investigate the solvability of -set agreement among processes in distributed systems prone to different types of process failures. Specifically, we explo…
The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers
Carole Delporte, Hugues Fauconnier, Pierre Fraigniaud +2
The celebrated Asynchronous Computability Theorem of Herlihy and Shavit (STOC 1993 and STOC 1994) provided a topological characterization of the tasks that are solvable in a distri…
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…