This book presents the most important fault-tolerant distributed programming abstractions
and their associated distributed algorithms, in particular in terms of reliable communication …

Fault-tolerant consensus has been studied extensively in the literature, because it is one of
the important distributed primitives and has wide applications in practice. This paper surveys …

Understanding distributed computing is not an easy task. This is due to the many facets of
uncertainty one has to cope with and master in order to produce correct distributed software …

We provide a suite of impossibility results and lower bounds for the required number of
processes and rounds for synchronous consensus under transient link failures. Our results …

We compare the consensus and uniform consensus problems in synchronous systems. In
contrast to consensus, uniform consensus is not solvable with byzantine failures. This still …

The long-standing byzantine agreement problem gets more attention in recent years due to
the increasing demand for scalable geo-replicated Byzantine state machine replication …

Minimizing the round complexity of byzantine broadcast is a fundamental question in
distributed computing and cryptography. In this work, we present the first early stopping …

Guerraoui proposed an indulgent solution for the binary consensus problem. Namely, he
showed that an arbitrary behavior of the failure detector never violates safety requirements …

This paper presents a tight lower bound on the time complexity of indulgent consensus
algorithms, ie, consensus algorithms that use unreliable failure detectors. We state and …

The unbeatability of a consensus protocol, introduced by Halpern, Moses and Waarts in [15],
is a stronger notion of optimality than the accepted notion of early stopping protocols. Using …