{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:10:11Z","timestamp":1736082611297,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540193661"},{"type":"electronic","value":"9783540392392"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/bfb0019795","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:25:50Z","timestamp":1131859550000},"page":"76-83","source":"Crossref","is-referenced-by-count":0,"title":["Byzantine firing squad using a faulty external source"],"prefix":"10.1007","author":[{"given":"Edward T.","family":"Ordman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"J.E. Burns and N.A. Lynch, The byzantine firing squad problem, MIT Laboratory for Computer Science report TM-275, April 1985; to appear in Advances in Computing Research.","DOI":"10.21236\/ADA154770"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"M.J. Fischer, N.A. Lynch and M. Merritt, Easy impossibility proofs for distributed consensus problems, Proc. 4th ACM Symp. on Principles of Distributed Computing, Minaki, Canada, August, 1985, 59\u201370.","DOI":"10.1145\/323596.323602"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0304-3975(81)90004-9","volume":"14","author":"Y. Nishitani","year":"1981","unstructured":"Y. Nishitani and N. Honda, The firing squad synchronization problem for graphs, Theoretical Computer Science 14(1981), 39\u201361.","journal-title":"Theoretical Computer Science"},{"key":"6_CR4","unstructured":"E.T. Ordman, Distributed graph recognition with malicious faults, to appear in Proceedings First China-U.S.A. International Conf. on Graph Theory and its Applications, Jinan, China, June, 1986."},{"key":"6_CR5","unstructured":"E.T. Ordman, A byzantine firing squad algorithm for networks, Technical report, Memphis State University Dept. of Mathematical Sciences, 1987."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"S. Toueg, K.J. Perry and T.K. Srikanth, Fast distributed agreement, Proc. 4th ACM Symposium on Principles of Distributed Computing, Minaki, Canada, August, 1985, 87\u2013101.","DOI":"10.1145\/323596.323604"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T12:56:46Z","timestamp":1736081806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540193661","9783540392392"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/bfb0019795","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}