{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:14Z","timestamp":1725455594725},"publisher-location":"Berlin\/Heidelberg","reference-count":19,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540552367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022441","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:03:27Z","timestamp":1131861807000},"page":"108-128","source":"Crossref","is-referenced-by-count":3,"title":["Optimally simulating crash failures in a byzantine environment"],"prefix":"10.1007","author":[{"given":"Rida","family":"Bazzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gil","family":"Neiger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_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 (preliminary report). In Proceedings of the Sixth ACM Symposium on Principles of Distributed Computing, pages 42\u201351, August 1987. Revised version received November 1988.","DOI":"10.1145\/41840.41844"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Piotr Berman and Juan A. Garay. Asymptotically optimal consensus. In Proceedings of the Sixteenth International Conference on Automata, Languages, and Programming, volume 372 of Lecture Notes on Computer Science, pages 80\u201394. Springer-Verlag, 1989.","DOI":"10.1007\/BFb0035753"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Piotr Berman, Juan A. Garay, and Kenneth J. Perry. Towards optimal distributed consensus. In Proceedings of the Thirtieth Symposium on Foundations of Computer Science, pages 410-415. IEEE Computer Society Press, October 1989.","DOI":"10.1109\/SFCS.1989.63511"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Brian A. Coan. A communication-efficient canonical form for fault-tolerant distributed protocols. In Proceedings of the Fifth ACM Symposium on Principles of Distributed Computing, pages 63\u201372, August 1986. A revised version appears in Coan's Ph.D. dissertation [5].","DOI":"10.1145\/10590.10596"},{"key":"8_CR5","unstructured":"Brian A. Coan. Achieving Consensus in Fault-Tolerant Distributed Computer Systems: Protocols, Lower Bounds, and Simulations. Ph.D. dissertation, Massachusetts Institute of Technology, June 1987."},{"issue":"12","key":"8_CR6","doi-asserted-by":"crossref","first-page":"1541","DOI":"10.1109\/12.9732","volume":"37","author":"B. A. Coan","year":"1988","unstructured":"Brian A. Coan. A compiler that increases the fault-tolerance of asynchronous protocols. IEEE Transactions on Computers, 37(12):1541\u20131553, December 1988.","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"8_CR7","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Danny Dolev. The Byzantine generals strike again. Journal of Algorithms, 3(1):14\u201330, 1982.","journal-title":"Journal of Algorithms"},{"key":"8_CR8","unstructured":"Vassos Hadzilacos. Byzantine agreement under restricted types of failures (not telling the truth is different from telling lies). Technical Report 18-83, Department of Computer Science, Harvard University, 1983. A revised version appears in Hadzilacos's Ph.D. dissertation [9]."},{"key":"8_CR9","unstructured":"Vassos Hadzilacos. Issues of Fault Tolerance in Concurrent Computations. Ph.D. dissertation, Harvard University, June 1984. Department of Computer Science Technical Report 11\u201384."},{"issue":"2","key":"8_CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01667081","volume":"2","author":"V. Hadzilacos","year":"1987","unstructured":"Vassos Hadzilacos. Connectivity requirements for Byzantine agreement under restricted types of failures. Distributed Computing, 2(2):95\u2013103, 1987.","journal-title":"Distributed Computing"},{"issue":"3","key":"8_CR11","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/79147.79161","volume":"37","author":"J. Y. Halpern","year":"1990","unstructured":"Joseph Y. Halpern and Yoram Moses. Knowledge and common knowledge in a distributed environment. Journal of the ACM, 37(3):549\u2013587, July 1990.","journal-title":"Journal of the ACM"},{"key":"8_CR12","unstructured":"Joseph Y. Halpern and H. Raymond Strong, March 1986. Personal communication."},{"issue":"3","key":"8_CR13","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Leslie Lamport, Robert Shostak, and Marshall 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"},{"issue":"1","key":"8_CR14","first-page":"121","volume":"3","author":"M. Yoram","year":"1988","unstructured":"Yoram Moses and Mark R. Tuttle. Programming simultaneous actions using common knowledge. Algorithmica, 3(1):121\u2013169, 1988.","journal-title":"Algorithmica"},{"issue":"3","key":"8_CR15","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0196-6774(90)90019-B","volume":"11","author":"G. Neiger","year":"1990","unstructured":"Gil Neiger and Sam Toueg. Automatically increasing the fault-tolerance of distributed algorithms. Journal of Algorithms, 11(3):374\u2013419, September 1990.","journal-title":"Journal of Algorithms"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Gil Neiger and Mark R. Tuttle. Common knowledge and consistent simultaneous coordination. In J. van Leeuwen and N. Santoro, editors, Proceedings of the Fourth International Workshop on Distributed Algorithms, volume 486 of Lecture Notes on Computer Science, pages 334\u2013352. Springer-Verlag, September 1990. To appear in Distributed Computing.","DOI":"10.1007\/3-540-54099-7_23"},{"issue":"3","key":"8_CR17","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"},{"issue":"3","key":"8_CR18","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1145\/357369.357371","volume":"1","author":"R. D. Schlichting","year":"1983","unstructured":"Richard D. Schlichting and Fred B. Schneider. Fail-stop processors: an approach to designing fault-tolerant computing systems. ACM Transactions on Computer Systems, 1(3):222\u2013238, August 1983.","journal-title":"ACM Transactions on Computer Systems"},{"issue":"2","key":"8_CR19","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"T. K. Srikanth","year":"1987","unstructured":"T. K. Srikanth and Sam Toueg. Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distributed Computing, 2(2):80\u201394, 1987.","journal-title":"Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022441.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:48:27Z","timestamp":1607550507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022441"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540552367"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0022441","relation":{},"subject":[]}}