Asymptotically optimal algorithms for approximate agreement

  title={Asymptotically optimal algorithms for approximate agreement},
  author={Alan Fekete},
  journal={Distributed Computing},
This paper introduces some algorithms to solve crash-failure, failure-by-omission and Byzantine failure versions of the Byzantine Generals or consensus problem, where non-faulty processors need only arrive at values that are close together rather than identical. For each failure model and each value ofS, we give at-resilient algorithm usingS rounds of communication. IfS=t+1, exact agreement is obtained. In the algorithms for the failure-by-omission and Byzantine failure models, each processor… CONTINUE READING
Highly Cited
This paper has 76 citations. REVIEW CITATIONS


Publications citing this paper.

76 Citations

Citations per Year
Semantic Scholar estimates that this publication has 76 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…