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 language | English |
|---|---|
| Pages | 193-200 |
| Number of pages | 8 |
| State | Published - 1998 |
| Event | Proceedings of the 1998 17th Annual ACM Symposium on Principles of Distributed Computing - Puerto Vallarta, Mexico Duration: 28 Jun 1998 → 2 Jul 1998 |
Conference
| Conference | Proceedings of the 1998 17th Annual ACM Symposium on Principles of Distributed Computing |
|---|---|
| City | Puerto Vallarta, Mexico |
| Period | 28/06/98 → 2/07/98 |