Fault-tolerant consensus has received significant attention over the past three decades
since the seminal work by Lamport, Shostak, and Pease [33, 26]. The consensus problem …

Consider a point-to-point network in which nodes are connected by directed links. This
paper proves tight necessary and sufficient conditions on the underlying communication …

As distributed systems nowadays scale to thousands or more of nodes, fault-tolerance
becomes one of the most important topics. This dissertation studies the fault-tolerance …

Consider a synchronous point-to-point network of n nodes connected by directed links,
wherein each node has a binary input. This paper proves a tight necessary and sufficient …

This paper considers the problem of approximate consensus in directed asynchronous
message-passing networks where some nodes may become Byzantine faulty. We obtain a …

This paper proves a necessary and sufficient condition for the existence of iterative,
algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs …

This paper explores the problem of reaching approximate consensus in synchronous point-
to-point networks, where each directed link of the underlying communication graph …

Consensus is arguably the most studied problem in distributed computing as a whole, and
particularly in the distributed message-passing setting. In this latter framework, research on …

This paper identifies necessary and sufficient conditions for the existence of iterative
algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs …

This paper explores the problem of reaching approximate consensus in synchronous point-
to-point networks, where each pair of nodes is able to communicate with each other directly …