The term distributed system typically refers to a set of entities, called nodes, connected by
point-topoint communication links. The set of nodes together with the set of links form a …

We study the minority-opinion dynamics over a fully-connected network of n nodes with
binary opinions. Upon activation, a node receives a sample of opinions from a limited …

The multivalued consensus problem is a fundamental issue in fault-tolerant distributed
computing. It encompasses a wide range of agreement problems where processes must …

We study the problem of privately emulating shared memory in message-passing networks.
The system includes clients that store and retrieve replicated information on N servers, out of …

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 …

We present the first (practically) self-stabilizing replicated state machine for asynchronous
message passing systems. The scheme is based on a variant of the Paxos algorithm and …

In its classical form, a consistent replicated service requires all replicas to witness the same
evolution of the service state. Assuming a message-passing environment with a majority of …

The virtual synchrony abstraction was proven to be extremely useful for asynchronous, large-
scale, message-passing distributed systems. Self-stabilizing systems can automatically …

One of the most celebrated problems of fault-tolerant distributed computing is the consensus
problem. It was shown to abstract a myriad of problems in which processes have to agree on …

Consensus, abstracting a myriad of problems in which processes have to agree on a single
value, is one of the most celebrated problems of fault-tolerant distributed computing …