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

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 …

This paper presents a proof of correctness of an iterative approximate Byzantine consensus
(IABC) algorithm for directed graphs. The iterative algorithm allows fault-free nodes to reach …

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 …

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 …

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

In this work, we consider a generalized fault model [7, 9, 5] that can be used to represent a
wide range of failure scenarios, including correlated failures and non-uniform node …

arXiv:1208.4867v1 [cs.DC] 23 Aug 2012 Page 1 arXiv:1208.4867v1 [cs.DC] 23 Aug 2012
Parameter-independent Iterative Approximate Byzantine Consensus ∗ Lewis Tseng1,3 and …