@inproceedings{dac9eae8e0a14adaa70284c8700946f4,

title = "Bounded polynomial randomized consensus",

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.",

author = "Hagit Attiya and Danny Dolev and Nir Shavit",

year = "1989",

doi = "10.1145/72981.73001",

language = "אנגלית",

isbn = "0897913264",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery (ACM)",

pages = "281--293",

booktitle = "Proc Eighth ACM Symp Princ Distrib Comput",

address = "ארצות הברית",

note = "null ; Conference date: 14-08-1989 Through 16-08-1989",

}