English

Parameter-independent Iterative Approximate Byzantine Consensus

Distributed, Parallel, and Cluster Computing 2012-08-27 v1

Abstract

In this work, we explore iterative approximate Byzantine consensus algorithms that do not make explicit use of the global parameter of the graph, i.e., the upper-bound on the number of faults, f.

Keywords

Cite

@article{arxiv.1208.4867,
  title  = {Parameter-independent Iterative Approximate Byzantine Consensus},
  author = {Lewis Tseng and Nitin H. Vaidya},
  journal= {arXiv preprint arXiv:1208.4867},
  year   = {2012}
}
R2 v1 2026-06-21T21:54:41.016Z