Tight lower bound for randomized synchronous consensus

Ziv Bar-Joseph*, Michael Ben-Or

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

45 Scopus citations

Abstract

We prove tight upper and lower bounds of Θ(t/√n log n) on the expected number of rounds needed for randomized synchronous consensus protocols for a fail-stop, full information, dynamic adversary. In particular this proves that some restrictions are needed on the power of the adversary to allow randomized constant expected number of rounds protocols.

Original languageAmerican English
Pages193-200
Number of pages8
StatePublished - 1998
EventProceedings of the 1998 17th Annual ACM Symposium on Principles of Distributed Computing - Puerto Vallarta, Mexico
Duration: 28 Jun 19982 Jul 1998

Conference

ConferenceProceedings of the 1998 17th Annual ACM Symposium on Principles of Distributed Computing
CityPuerto Vallarta, Mexico
Period28/06/982/07/98

Cite this