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 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 …

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 considers the Byzantine consensus problem for nodes with binary inputs. The
nodes are interconnected by a network represented as an undirected graph, and the system …

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 …

In this work we look at Byzantine consensus in asynchronous systems under the local
broadcast model. In the local broadcast model, a message sent by any node is received …

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

We consider Byzantine consensus in a synchronous system where nodes are connected by
a network modeled as a directed graph, ie, communication links between neighboring …

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