Bounded polynomial randomized consensus

Hagit Attiya, Danny Dolev, Nir Shavit

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

K. Abrahamson presented a solution to the randomized consensus problem of B. Chor, A. Israeli and M. Li, without assuming the existence of an atomic coin flip operation. This elegant algorithm uses unbounded memory, and has expected exponential running time. J. Aspens and M.P. Herlihy provided a breakthrough polynomial-time algorithm. However, it too is based on the use of unbounded memory. In this paper, we present a solution to the randomized consensus problem that is bounded in space and runs in polynomial expected time.

Original languageEnglish
Title of host publicationProc Eighth ACM Symp Princ Distrib Comput
PublisherAssociation for Computing Machinery (ACM)
Pages281-293
Number of pages13
ISBN (Print)0897913264, 9780897913263
DOIs
StatePublished - 1989
Externally publishedYes
EventProceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing - Edmonton, Alberta, Can
Duration: 14 Aug 198916 Aug 1989

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

ConferenceProceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing
CityEdmonton, Alberta, Can
Period14/08/8916/08/89

Fingerprint

Dive into the research topics of 'Bounded polynomial randomized consensus'. Together they form a unique fingerprint.

Cite this