Parameter-independent Iterative Approximate Byzantine Consensus
  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. 
Lewis Tseng and Nitin H. Vaidya
cs.DC