{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:05:14Z","timestamp":1725728714635},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540184782"},{"type":"electronic","value":"9783662011102"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/978-3-662-01110-2_5","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T20:05:22Z","timestamp":1370289922000},"page":"65-81","source":"Crossref","is-referenced-by-count":0,"title":["Konsistenz und Fehlertoleranz in Verteilten Systemen \u2014 Das Problem der Byzantinischen Gener\u00e4le"],"prefix":"10.1007","author":[{"name":"REISCHUK.DDADVSI.EARN","sequence":"first","affiliation":[]},{"given":"R\u00fcdiger","family":"Reischuk","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"FCT Conf. on Foundations of Comupation Theory"},{"key":"5_CR2","unstructured":"FoCS IEEE Symp. on Foundations of Computation Theory"},{"key":"5_CR3","unstructured":"PoDC ACM Symp. on Principles of Distributed Systems"},{"key":"5_CR4","unstructured":"SToC ACM-SIGACT Symp. on Theory of Computing"},{"key":"5_CR5","volume-title":"FoCS","author":"H Attiya","year":"1987","unstructured":"H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, R. Reischuk, Achievable Cases in an Asynchronous Environment, to app. Proc. 27. FoCS, 1987"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"C. Mohan, R. Strong, S. Finkelstein, Method for Distributed Transaction Commit and Recovery Using BA within Clusters of Processors, Proc. 2. PoDC, 1983, 89\u2013103","DOI":"10.1145\/800221.806712"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols, Proc. 2. PODC, 1983, 27\u201330","DOI":"10.1145\/800221.806707"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"G. Bracha, An Asynchronous (n-1)\/3-Resilient Consensus Protocoll, Proc. 3. PoDC, 1984, 154\u2013162","DOI":"10.1145\/800222.806743"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"G. Bracha, An 0(log n) Expected Rounds Randomized Byzantine Generals Algorithms, Proc. 17. SToC, 1985, 316\u2013326","DOI":"10.1145\/22145.22180"},{"key":"5_CR10","first-page":"824","volume":"32","author":"G Bracha","year":"1985","unstructured":"G. Bracha, S. Toueg, Asynchronous Consensus and Broadcast Protocols, J. ACM 32, 1985, 824\u2013840","journal-title":"Asynchronous Consensus and Broadcast Protocols, J. ACM"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"B. Coan, A Communication-Efficient Canonical Form for Fault-Tolerant Distributed Protocols, Proc. 5. PoDC, 1986, 63\u201372","DOI":"10.1145\/10590.10596"},{"key":"5_CR12","volume-title":"Technical Report","author":"B Chor","year":"1987","unstructured":"B. Chor, C. Dwork, Randomization in Byzantine Agreement, Technical Report, 1987"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"B. Coan, D. Dolev, C. Dwork, L. Stockmeyer, The Distributed Firing Squad Problem,. Proc. 17. SToC, 1985, 335\u2013345","DOI":"10.1145\/22145.22182"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D Dolev","year":"1982","unstructured":"D. Dolev, The Byzantine Generals Strike Again, J. Alg. 3, 1982, 14\u201330","journal-title":"J. Alg"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D Dolev","year":"1987","unstructured":"D. Dolev, C. Dwork, L. Stockmeyer, On the Minimal Synchronism Needed for Distributed Consensus, J. ACM 34, 1987, 77\u201397","journal-title":"J. ACM"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0019-9958(82)90776-8","volume":"52","author":"D Dolev","year":"1982","unstructured":"D. Dolev, M. Fischer, R. Fowler, N. Lynch, R. Strong, An Efficient Algorithm for Byzantine Agreement without Authentication, Inf. Control 52, 1982, 257\u2013274","journal-title":"Control"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"D. Dolev, J. Halpern, R. Strong, On the Possibility and Impossibility of Achieving Clock Synchronization, Proc. 16. SToC, 1984, 504\u2013511","DOI":"10.1145\/800057.808720"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D Dolev","year":"1986","unstructured":"D. Dolev, N. Lynch, S. Pinter, F. Stark, W. Weihl, Reaching Approximate Agreement in the Presence of Faults, J. ACM 33, 1986, 499\u2013516","journal-title":"J. ACM"},{"key":"5_CR19","unstructured":"C. Dwork, N. Lynch, L. Stockmeyer, Consensus in the Presence of Partial Synchrony, Proc. 3. PoDC, 1984, 103\u2013118"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"C. Dwork, D. Peleg, N. Pippenger, E. Upfal, Fault Tolerance in Networks of Bounded Degree, Proc. 18. SToC, 1986, 370\u2013379","DOI":"10.1145\/12130.12169"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1145\/2455.214112","volume":"32","author":"D Dolev","year":"1985","unstructured":"D. Dolev, R. Reischuk, Bounds on Information Exchange for Byzantine Agreement, J. ACM 32, 1985, 191\u2013204","journal-title":"J. ACM"},{"key":"5_CR22","volume-title":"Proc. 23. FoCS, 1982, 196-203, to app. as Early Stopping in Byzantine Agreement, J. ACM","author":"D Dolev","year":"1987","unstructured":"D. Dolev, R. Reischuk, R. Strong, \u2018Eventual\u2019 is Earlier than \u2019Immediate\u2019, Proc. 23. FoCS, 1982, 196\u2013203, to app. as Early Stopping in Byzantine Agreement, J. ACM, 1987"},{"key":"5_CR23","volume-title":"on Reliability in Distributed Software and Database Systems","author":"D Dolev","year":"1982","unstructured":"D. Dolev, R. Strong, Distributed Commit with Bounded Waiting, Proc. 2. Symp. on Reliability in Distributed Software and Database Systems, 1982"},{"key":"5_CR24","first-page":"656","volume":"12","author":"D Dolev","year":"1983","unstructured":"D. Dolev, R. Strong, Authenticated Algorithms for Byzantine Agreement, SIAM J. Comput. 12, 1983, 656\u2013666","journal-title":"J. Comput"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"M. Fischer, The Consensus Problem in Unreliable Distributed Systems, Proc. 4. FCT, 1983, 127\u2013140","DOI":"10.1007\/3-540-12689-9_99"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M Fischer","year":"1982","unstructured":"M. Fischer, N. Lynch, A Lower Bound for the Time to Assure Interactive Consistency, Inf. Proc. Letters 14, 1982, 183\u2013186","journal-title":"Proc. Letters"},{"key":"5_CR27","first-page":"26","volume":"1","author":"M Fischer","year":"1986","unstructured":"M. Fischer, N. Lynch, M. Merritt, Easy Impossibility Proofs for Distributed Consensus Problems, Distr. Comp. 1, 1986, 26\u201339","journal-title":"Comp"},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M Fischer","year":"1985","unstructured":"M. Fischer, N. Lynch, M. Paterson, Impossibility of Distributed Consensus with 1 Faulty Process, J. ACM 32, 1985, 374\u2013382","journal-title":"J. ACM"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"J. Halpern, B. Simons, R. Strong, D. Dolev, Fault-Tolerant Clock Synchronization, Proc. 3. PoDC, 1984, 89\u2013102","DOI":"10.1145\/800222.806739"},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/2402.322398","volume":"30","author":"L Lamport","year":"1983","unstructured":"L. Lamport, The Weak Byzantine Generals Problem, J. ACM 30, 1983, 668\u2013676","journal-title":"J. ACM"},{"key":"5_CR31","first-page":"254","volume":"6","author":"L Lamport","year":"1984","unstructured":"L. Lamport, Using Time instead of Timeout for Fault-Tolerant Distributed Systems, ACM Tr. on Progr. Lang. and Systems 6, 1984, 254\u2013280","journal-title":"Lang. and Systems"},{"key":"5_CR32","first-page":"190","volume":"62","author":"J Lundelius","year":"1984","unstructured":"J. Lundelius, N. Lynch, An Upper and Lower Bound for Clock Synchronization, Inf. Control 62, 1984, 190\u2013204","journal-title":"An Upper and Lower Bound for Clock Synchronization, Inf. Control"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"L. Lamport, P. Melliar-Smith, Byzantine Clock Synchronisation, Proc. 3. PoDC, 1984, 68\u201374","DOI":"10.1145\/800222.806737"},{"key":"5_CR34","first-page":"382","volume":"4","author":"L Lamport","year":"1982","unstructured":"L. Lamport, R. Shostak, M. Pease, The Byzantine Generals Problem, ACM Tr. on Progr. Lang. and Systems 4, 1982, 382\u2013401","journal-title":"Lang. and Systems"},{"key":"5_CR35","first-page":"167","volume":"1","author":"Y Moses","year":"1986","unstructured":"Y. Moses, D. Dolev, J. Halpern, Cheating Husbands and other Stories, Dis. Comp. 1, 1986, 167\u2013176","journal-title":"Cheating Husbands and other Stories, Dis. Comp"},{"key":"5_CR36","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"M. Pease, R. Shostak, L. Lamport, Reaching Agreement in the Presence of Faults, J. ACM 27, 1980, 228\u2013234","journal-title":"J. ACM"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"M. Rabin, Randomized Byzantine Generals, Proc. 24. FoCS, 1983, 403\u2013409","DOI":"10.1109\/SFCS.1983.48"},{"key":"5_CR38","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0019-9958(85)80042-5","volume":"64","author":"R Reischuk","year":"1985","unstructured":"R. Reischuk, A New Solution for the Byzantine Generals Problem, Inf. Control 64, 1985, 23\u201342","journal-title":"Control"},{"key":"5_CR39","unstructured":"S. Toueg, Randomized BA, Proc. 3. PoDC, 1984, 163\u2013178"},{"key":"5_CR40","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(84)90027-9","volume":"18","author":"R Turpin","year":"1984","unstructured":"R. Turpin, B. Coan, Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement, Inf. Proc. Letters 18, 1984, 73\u201376","journal-title":"Proc. Letters"},{"key":"5_CR41","unstructured":"S. Toueg, K. Perry, T. Srikanth, Fast Distributed Agreement, Proc. 4. PoDC, 1985, 87\u2013101"}],"container-title":["Informatik-Fachberichte","GI \u2014 17. Jahrestagung Computerintegrierter Arbeitsplatz im B\u00fcro"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-01110-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T17:21:49Z","timestamp":1557768109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-01110-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540184782","9783662011102"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-01110-2_5","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1987]]}}}