Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs

The Byzantine generals problem

Leslie Lamport, Robert Shostak, and Marshall Pease · 1982

Earlier work this paper cites.

Easy impossibility proofs for distributed consensus problems

Michael J. Fischer, Nancy A. Lynch, and Michael Merritt · 1985

Earlier work this paper cites.

Reaching approximate agreement in the presence of faults

Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, and William 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

Nancy A. Lynch · 1996

Earlier work this paper cites.

Parallel and Distributed Computation: Numerical Methods

Dimitri P. Bertsekas and John N. Tsitsiklis · 1997

Cited alongside, same era.

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

A.H. Azadmanesh and H. Bajwa · 2001

Cited alongside, same era.

Asynchronous approximate agreement in partially connected networks

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

Cited alongside, same era.

Chord: a scalable peer-to-peer lookup protocol for internet applications

I. Stoica, R. Morris, D. Liben-Nowell, D.R. Karger, M.F. Kaashoek, F. Dabek, and H. Balakrishnan · 2003

Cited alongside, same era.

Exploiting markov chains to reach approximate agreement in partially connected networks

Satish M. Srinivasana and Azad H. Azadmanesh · 2007

Cited alongside, same era.

Data aggregation in partially connected networks

Satish M. Srinivasan and Azad H. Azadmanesh · 2009

Simple gradecast based algorithms

Original

Michael Ben-Or, Danny Dolev, and Ezra N. Hoch · 2010

Later among the works it cites.

Heath LeBlanc and Xenofon Koutsoukos. “Consensus in Networked Multi-Agent Systems with Adversaries,” 14th international conference on Hybrid systems: computation and control (HSCC), 2011

2011

Later among the works it cites.

Distributed function calculation via linear iterative strategies in the presence of malicious agents

S. Sundaram and C.N. Hadjicostis · 2011

Later among the works it cites.

Robustness of Information Diffusion Algorithms to Locally Bounded Adversaries

Original

Haotian Zhang and Shreyas Sundaram · 2011

Later among the works it cites.