Matrix Representation of Iterative Approximate Byzantine Consensus in Directed Graphs

J. Hajnal, “Weak ergodicity in non-homogeneous Markov chains,” Proceedings of the Cambridge Philosophical Society, vol. 54, pp. pp. 233–246, 1958

1958

Earlier work this paper cites.

J. Wolfowitz, “Products of indecomposable, aperiodic, stochastic matrices,” Proceedings of the American Mathematical Society, vol. 14, no. 5, pp. pp. 733–737, 1963

1963

Earlier work this paper cites.

Impossibility of distributed consensus with one faulty process

M. J. Fischer, N. A. Lynch, and M. S. Paterson · 1985

Earlier work this paper cites.

Reaching approximate agreement in the presence of faults

D. Dolev, N. A. Lynch, S. S. Pinter, E. W. Stark, and W. E. Weihl · 1986

Earlier work this paper cites.

Asymptotically optimal algorithms for approximate agreement

A. D. Fekete · 1986

Earlier work this paper cites.

Low cost approximate agreement in partially connected networks

R. M. Kieckhafer and M. H. Azadmanesh · 1993

Earlier work this paper cites.

Distributed Algorithms

N. A. Lynch · 1996

Earlier work this paper cites.

Parallel and Distributed Computation: Numerical Methods

D. P. Bertsekas and J. N. Tsitsiklis · 1997

Cited alongside, same era.

Global convergence in partially fully connected networks (pfcn) with limited relays

A. Azadmanesh and H. Bajwa · 2001

Cited alongside, same era.

Asynchronous approximate agreement in partially connected networks

M. H. Azadmanesh and R. Kieckhafer · 2002

Cited alongside, same era.

Coordination of groups of mobile autonomous agents using nearest neighbor rules

A. Jadbabaie, J. Lin, and A. Morse · 2003

Cited alongside, same era.

F. Benezit, V. Blondel, P. Thiran, J. Tsitsiklis, and M. Vetterli, “Weighted gossip: Distributed averaging using non-doubly stochastic matrices,” in Proc. of IEEE International Symposium on Information Theory, June 2010, pp. 1753–1757

2010

Cited alongside, same era.

N. H. Vaidya, C. N. Hadjicostis, A. D. Dominguez-Garcia. Distributed Algorithms for Consensus and Coordination in the Presence of Packet-Dropping Communication Links - Part II: Coefficients of Ergodicity Analysis Approach. September 2011. Available from http://arxiv.org/abs/1109.6392

Original

2011

Later among the works it cites.

H. Zhang and S. Sundaram. Robustness of Information Diffusion Algorithms to Locally Bounded Adversaries. In CoRR, volume abs/1110.3843, 2011. http://arxiv.org/abs/1110.3843

Original

2011

Later among the works it cites.

Consensus of multi-agent networks in the presence of adversaries using only local information

H. LeBlanc, H. Zhang, S. Sundaram, and X. Koutsoukos · 2012

Closest in time.

Low complexity resilient consensus in networked multi-agent systems with adversaries

H. LeBlanc and X. Koutsoukos · 2012

Closest in time.

Iterative approximate Byzantine consensus in arbitrary directed graphs