{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:06Z","timestamp":1725664026982},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540561880"},{"type":"electronic","value":"9783540474845"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56188-9_12","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:56:10Z","timestamp":1330253770000},"page":"166-184","source":"Crossref","is-referenced-by-count":6,"title":["Simulating crash failures with many faulty processors (extended abstract)"],"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","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Hagit Attiya, Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Bounds on the time to reach agreement in the presence of timing uncertainty. In Proceedings of the Twenty-Third ACM Symposium on Theory of Computing, pages 359\u2013369, May 1991.","DOI":"10.1145\/103418.103457"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Rida Bazzi and Gil Neiger. Optimally providing fault-tolerance in a Byzantine environment. In S. Toueg, P. G. Spirakis, and L. Kirousis, editors, Proceedings of the Fifth International Workshop on Distributed Algorithms, volume 579 of Lecture Notes on Computer Science, pages 108\u2013128. Springer-Verlag, October 1991.","DOI":"10.1007\/BFb0022441"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Rida Bazzi and Gil Neiger. The complexity and impossibility of achieving fault-tolerant coordination. In Proceedings of the Eleventh ACM Symposium on Principles of Distributed Computing, August 1992. To appear.","DOI":"10.1145\/135419.135460"},{"issue":"12","key":"12_CR4","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":"12_CR5","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":"12_CR6","unstructured":"Vassos Hadzilacos. Byzantine agreement under restricted types of failures (not telling the truth is different from telling lies). Technical Report 18\u201383, Department of Computer Science, Harvard University, 1983. A revised version appears in Hadzilacos's Ph.D. dissertation [7]."},{"key":"12_CR7","unstructured":"Vassos Hadzilacos. Issues of Fault Tolerance in Concurrent Computations. Ph.D. dissertation, Harvard University, June 1984. Technical Report 11\u201384, Department of Computer Science."},{"issue":"2","key":"12_CR8","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"},{"key":"12_CR9","unstructured":"Joseph Y. Halpern and H. Raymond Strong, March 1986. Personal communication."},{"issue":"3","key":"12_CR10","doi-asserted-by":"publisher","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":"3","key":"12_CR11","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":"12_CR12","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":"12_CR13","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"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Stephen Ponzio. Consensus in the presence of timing uncertainty: Omission and Byzantine faults. In Proceedings of the Tenth ACM Symposium on Principles of Distributed Computing, pages 125\u2013138, August 1991.","DOI":"10.1145\/112600.112612"},{"issue":"3","key":"12_CR15","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":"12_CR16","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":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56188-9_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:48:40Z","timestamp":1619570920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56188-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540561880","9783540474845"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-56188-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}