{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:14Z","timestamp":1725663374797},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540516873"},{"type":"electronic","value":"9783540467502"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51687-5_36","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:12:07Z","timestamp":1330204327000},"page":"110-123","source":"Crossref","is-referenced-by-count":15,"title":["Reliable broadcast in synchronous and asynchronous environments (preliminary version)"],"prefix":"10.1007","author":[{"given":"Ajei","family":"Gopal","sequence":"first","affiliation":[]},{"given":"Sam","family":"Toueg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, and H. Raymond Strong. Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement. In Proceedings of the Sixth ACM Symposium on Principles of Distributed Computing, pages 42\u201351, Vancouver, British Columbia, August 1987. ACM SIGOPS-SIGACT.","DOI":"10.1145\/41840.41844"},{"issue":"4","key":"10_CR2","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1145\/4221.214134","volume":"32","author":"G. Bracha","year":"1985","unstructured":"Gabriel Bracha and Sam Toueg. Asynchronous consensus and broadcast protocols. Journal of the ACM, 32(4):824\u2013840, October 1985.","journal-title":"Journal of the ACM"},{"key":"10_CR3","unstructured":"Brian A. Coan. Achieving Consensus in Fault-Tolerant Distributed Computer Systems: Protocols, Lower Bounds, and Simulations. PhD thesis, Massachusetts Institute of Technology, June 1987."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Michael J. Fischer. The consensus problem in unreliable distributed systems (a brief survey). Technical Report DCS\/RR-273, Department of Computer Science, Yale University, June 1983.","DOI":"10.1007\/3-540-12689-9_99"},{"issue":"2","key":"10_CR5","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. Patterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374\u2013382, April 1985.","journal-title":"Journal of the ACM"},{"key":"10_CR6","unstructured":"Vassos Hadzilacos. Issues of Fault Tolerance in Concurrent Computations. PhD thesis, Harvard University, June 1984. Department of Computer Science Technical Report 11\u201384."},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Leslie Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382\u2013401, July 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Gil Neiger and Sam Toueg. Automatically increasing the fault-tolerance of distributed systems. In Proceedings of the Seventh ACM Symposium on Principles of Distributed Computing, pages 248\u2013262, Toronto, Ontario, August 1988. ACM SIGOPS-SIGACT.","DOI":"10.1145\/62546.62588"},{"issue":"3","key":"10_CR9","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TSE.1986.6312888","volume":"12","author":"K. J. Perry","year":"1986","unstructured":"Kenneth J. Perry and Sam Toueg. Distributed agreement in the presence of processor and communication faults. IEEE Transactions on Software Engineering, 12(3):477\u2013482, March 1986.","journal-title":"IEEE Transactions on Software Engineering"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51687-5_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:22:29Z","timestamp":1605648149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51687-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540516873","9783540467502"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-51687-5_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}