7 citations · 15 across the 10 of their papers we have counts for
12 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…
Set-Consensus Collections are Decidable
Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni +1
A natural way to measure the power of a distributed-computing model is to characterize the set of tasks that can be solved in it. %the model. In general, however, the question of w…
Beyond One Third Byzantine Failures
Cheng Wang, Carole Delporte-Gallet, Hugues Fauconnier +2
The Byzantine agreement problem requires a set of processes to agree on a value sent by a transmitter, despite a subset of processes behaving in an arbitrary, i.e. Byzantin…
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 …
Wait-Freedom with Advice
Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni +1
We motivate and propose a new way of thinking about failure detectors which allows us to define, quite surprisingly, what it means to solve a distributed task \emph{wait-free} \emp…
Algorithms For Extracting Timeliness Graphs
Carole Delporte-Gallet, Stéphane Devismes, Hugues Fauconnier +1
We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p; q) is an e…
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…