research
∙
09/20/2023
Better Sooner Rather Than Later
This article unifies and generalizes fundamental results related to n-pr...
share
research
∙
07/27/2023
Self-stabilizing Byzantine-tolerant Recycling
Numerous distributed applications, such as cloud computing and distribut...
research
∙
03/09/2023
Good-case Early-Stopping Latency of Synchronous Byzantine Reliable Broadcast: The Deterministic Case (Extended Version)
This paper considers the good-case latency of Byzantine Reliable Broadca...
research
∙
02/13/2023
The Synchronization Power (Consensus Number) of Access-Control Objects: The Case of AllowList and DenyList
This article studies the synchronization power of AllowList and DenyList...
research
∙
09/29/2022
Self-stabilizing Total-order Broadcast
The problem of total-order (uniform reliable) broadcast is fundamental i...
research
∙
05/20/2022
Asynchronous Byzantine Reliable Broadcast With a Message Adversary
This paper considers the problem of reliable broadcast in asynchronous a...
research
∙
04/28/2022
Coping with Byzantine Processes and a Message Adversary: Modularity Helps!
This paper explores how reliable broadcast can be implemented when facin...
research
∙
03/06/2022
Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms
This article addresses election in fully anonymous systems made up of n ...
research
∙
01/30/2022
Self-stabilizing Byzantine-tolerant Broadcast
We study a well-known communication abstraction called Byzantine Reliabl...
research
∙
10/16/2021
Self-stabilizing Byzantine- and Intrusion-tolerant Consensus
One of the most celebrated problems of fault-tolerant distributed comput...
research
∙
05/06/2021
Leader Election in Arbitrarily Connected Networks with Process Crashes and Weak Channel Reliability
A channel from a process p to a process q satisfies the ADD property if ...
research
∙
04/07/2021
Self-stabilizing Multivalued Consensus in Asynchronous Crash-prone Systems
The problem of multivalued consensus is fundamental in the area of fault...
research
∙
03/26/2021
Loosely-self-stabilizing Byzantine-tolerant Binary Consensus for Signature-free Message-passing Systems
At PODC 2014, A. Mostéfaoui, H. Moumen, and M. Raynal presented a new an...
research
∙
03/16/2021
Byzantine-tolerant Distributed Grow-only Sets: Specification and Applications
In order to formalize Distributed Ledger Technologies and their intercon...
research
∙
10/12/2020
Self-Stabilizing Indulgent Zero-degrading Binary Consensus
Guerraoui proposed an indulgent solution for the binary consensus proble...
research
∙
09/30/2020
t-Resilient k-Immediate Snapshot and its Relation with Agreement Problems
An immediate snapshot object is a high level communication object, built...
research
∙
06/18/2020
Money Transfer Made Simple
It has recently been shown (PODC 2019) that, contrarily to a common beli...
research
∙
05/11/2020
What Can Be Done with Consensus Number One: Relaxed Queues and Stacks
Sequentially specified linearizable concurrent data structures must be r...
research
∙
02/26/2020
Appending Atomically in Byzantine Distributed Ledgers
A Distributed Ledger Object (DLO) is a concurrent object that maintains ...
research
∙
01/09/2020
Self-stabilizing Uniform Reliable Broadcast
We study a well-known communication abstraction called Uniform Reliable ...
research
∙
09/12/2019
Fully Anonymous Shared Memory Algorithms
Process anonymity has been studied for a long time. Memory anonymity is ...
research
∙
03/28/2019
Mutex-based Desanonymization of an Anonymous Read/Write Memory
Anonymous shared memory is a memory in which processes use different nam...
research
∙
12/14/2018
Mastering Concurrent Computing Through Sequential Thinking: A Half-century Evolution
Concurrency, the art of doing many things at the same time is slowly bec...
research
∙
10/08/2018
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
The notion of an anonymous shared memory (recently introduced in PODC 20...
research
∙
02/02/2018
Extending Causal Consistency to any Object Defined by a Sequential Specification
This paper presents a simple generalization of causal consistency suited...
research
∙
02/02/2018
