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 identifies necessary and sufficient conditions for the existence of iterative
algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs …

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 …

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 …

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 a classical distributed systems problem with both theoretical and practical
interest. Asynchronous Byzantine consensus is currently at the core of some solutions for the …

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 …

In this paper, a novel fault-tolerant algorithm for achieving approximate Byzantine
consensus in asynchronous networks is proposed. It is shown that the topological condition …

We are interested in approximate Byzantine consensus problem, wherein all the fault-free
processes reach consensus asymptotically (approximately in finite time). In particular, we …