Randomized Agreement Protocols

@inproceedings{BenOr1986RandomizedAP,
  title={Randomized Agreement Protocols},
  author={Michael Ben-Or},
  booktitle={Fault-Tolerant Distributed Computing},
  year={1986}
}
Reaching agreement in the presence of faults is one of the most important problems in fault-tolerant distributed computation, and it is also a beautiful example of the power of randomized algorithms. This problem, first introduced by Pease, Shostak and Lamport [PSL80] as the "Byzantine Agreement Problem", considers a situation in which each process /~, i… CONTINUE READING