{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:14:19Z","timestamp":1763468059769},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617693"},{"type":"electronic","value":"9783540706793"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61769-8_3","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:21:45Z","timestamp":1330294905000},"page":"29-39","source":"Crossref","is-referenced-by-count":9,"title":["Randomization and failure detection: A hybrid approach to solve Consensus"],"prefix":"10.1007","author":[{"given":"Marcos Kawazoe","family":"Aguilera","sequence":"first","affiliation":[]},{"given":"Sam","family":"Toueg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Marcos Kawazoe Aguilera and Sam Toueg. Randomization and failure detection: A hybrid approach to solve consensus. Technical Report 96-1592, Department of Computer Science, Cornell University, June 1996. Available by anonymous ftp from ftp.cs.cornell.edu in pub\/sam\/hybrid.consensus.algorithm.ps.gz.","DOI":"10.1007\/3-540-61769-8_3"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or. Another advantage of free choice: Completely asynchronous agreement protocols. In Proceedings of the Second ACM Symposium on Principles of Distributed Computing, pages 27\u201330, August 1983.","DOI":"10.1145\/800221.806707"},{"issue":"4","key":"3_CR3","first-page":"12","volume":"32","author":"Gabriel Bracha","year":"1983","unstructured":"Gabriel Bracha and Sam Toueg. Resilient consensus protocols. In Proceedings of the Second ACM Symposium on Principles of Distributed Computing, pages 12\u201326, August 1983. An extended and revised version appeared as \u201cAsynchronous consensus and broadcast protocols\u201d in the Journal of the ACM, 32(4):824\u2013840, October 1985.","journal-title":"Journal of the ACM"},{"key":"3_CR4","first-page":"443","volume":"4","author":"B. Chor","year":"1989","unstructured":"Benny Chor and Cynthia Dwork. Randomization in Byzantine Agreement. Advances in Computer Research (JAI Press Inc.), 4:443\u2013497, 1989.","journal-title":"Advances in Computer Research (JAI Press Inc.)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Tushar Deepak Chandra, Vassos Hadzilacos, and Sam Toueg. The weakest failure detector for solving consensus. In Proceedings of the Tenth ACM Symposium on Principles of Distributed Computing, pages 147\u2013158, August 1992.","DOI":"10.21236\/ADA253611"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Tushar Deepak Chandra, Vassos Hadzilacos, and Sam Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43(4), July 1996. An earlier version appeared in [CHT92].","DOI":"10.1145\/234533.234549"},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1145\/65950.65956","volume":"36","author":"B. Chor","year":"1989","unstructured":"Benny Chor, Michael Merritt, and David B. Shmoys. Simple constant-time consensus protocols in realistic failure models. Journal of the ACM, 36(3):591\u2013614, 1989.","journal-title":"Journal of the ACM"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Tushar Deepak Chandra and Sam Toueg. Unreliable failure detectors for asynchronous systems. In Proceedings of the Tenth ACM Symposium on Principles of Distributed Computing, pages 325\u2013340. ACM Press, August 1991.","DOI":"10.1145\/112600.112627"},{"issue":"2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T. D. Chandra","year":"1996","unstructured":"Tushar Deepak Chandra and Sam Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225\u2013267, March 1996. An earlier version appeared in [CT91].","journal-title":"Journal of the ACM"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Danny Dolev, Cynthia Dwork, and Larry Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77\u201397, January 1987.","journal-title":"Journal of the ACM"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Cynthia Dwork, Nancy A. Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288\u2013323, April 1988.","journal-title":"Journal of the ACM"},{"key":"3_CR12","unstructured":"Danny Dolev and Dalia Malki. Consensus made practical. Technical Report CS94-7, The Hebrew University of Jerusalem, March 1994."},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. J. Fischer","year":"1985","unstructured":"Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374\u2013382, April 1985.","journal-title":"Journal of the ACM"},{"issue":"1","key":"3_CR14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0020-0190(90)90185-Z","volume":"36","author":"O. Goldreich","year":"1990","unstructured":"Oded Goldreich and Erez Petrank. The best of both worlds: guaranteeing termination in fast randomized Byzantine Agreement protocols. Information Processing Letters, 36(1):45\u201349, October 1990.","journal-title":"Information Processing Letters"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Michael Rabin. Randomized Byzantine Generals. In Proceedings of the Twenty-Fourth Symposium on Foundations of Computer Science, pages 403\u2013409. IEEE Computer Society Press, November 1983.","DOI":"10.1109\/SFCS.1983.48"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Sam Toueg. Randomized Byzantine Agreements. In Proceedings of the Third ACM Symposium on Principles of Distributed Computing, pages 163\u2013178, August 1984.","DOI":"10.1145\/800222.806744"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Arkady Zamsky. A randomized Byzantine Agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time. In Proceedings of the Fifteenth ACM Symposium on Principles of Distributed Computing, pages 201\u2013208, May 1996.","DOI":"10.1145\/248052.248091"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61769-8_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:10:30Z","timestamp":1605647430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61769-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617693","9783540706793"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-61769-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}