{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:55Z","timestamp":1725455695809},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602743"},{"type":"electronic","value":"9783540447832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0022151","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:19:52Z","timestamp":1131862792000},"page":"242-256","source":"Crossref","is-referenced-by-count":7,"title":["Total ordering algorithms for asynchronous Byzantine systems"],"prefix":"10.1007","author":[{"given":"Louise E.","family":"Moser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. M.","family":"Melliar-Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"17_CR1","first-page":"95","volume-title":"Lecture Notes in Computer Science 579","author":"A. Bar-Noy","year":"1991","unstructured":"A. Bar-Noy, X. Deng, J. A. Garay and T. Kameda, \u201cOptimal amortized distributed consensus,\u201d Proceedings of the 5th International Workshop on Distributed Algorithms, Delphi, Greece, October 1991, Lecture Notes in Computer Science 579, Springer Verlag, pp. 95\u2013107."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF01798957","volume":"4","author":"A. Bar-Noy","year":"1991","unstructured":"A. Bar-Noy and D. Dolev, \u201cConsensus algorithms with one-bit messages,\u201d Distributed Computing, vol. 4, 1991, pp. 105\u2013110.","journal-title":"Distributed Computing"},{"key":"17_CR3","first-page":"166","volume-title":"Lecture Notes in Computer Science 647","author":"R. Bazzi","year":"1992","unstructured":"R. Bazzi and G. Neiger, \u201cSimulating crash failures with many faulty processors,\u201d Proceedings of the 6th International Workshop on Distributed Algorithms, Haifa, Israel, November 1992, Lecture Notes in Computer Science 647, Springer Verlag, pp. 166\u2013184."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, \u201cAnother advantage of free choice: Completely asynchronous agreement protocols,\u201d Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Cananda, August 1983, pp. 27\u201330.","DOI":"10.1145\/800221.806707"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G. Bracha","year":"1987","unstructured":"G. Bracha, \u201cAsynchronous Byzantine agreement protocols,\u201d Information and Computation, vol. 75, no. 2, November 1987, pp. 130\u2013143.","journal-title":"Information and Computation"},{"issue":"4","key":"17_CR6","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1145\/4221.214134","volume":"31","author":"G. Bracha","year":"1985","unstructured":"G. Bracha and S. Toueg, \u201cAsynchronous consensus and broadcast protocols,\u201d Journal of the ACM, vol. 31, no. 4, October 1985, pp. 824\u2013840.","journal-title":"Journal of the ACM"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"T. D. Chandra and S. Toueg, \u201cUnreliable failure detectors for asynchronous systems,\u201d Proceedings of the Tenth ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, August 1991, pp. 325\u2013340.","DOI":"10.1145\/112600.112627"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"T. D. Chandra, V. Hadzilacos and S. Toueg, \u201cThe weakest failure detector for solving consensus,\u201d Proceedings of the Eleventh ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, August 1992, pp. 147\u2013158.","DOI":"10.1145\/135419.135451"},{"issue":"2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. J. Fischer","year":"1985","unstructured":"M. J. Fischer, N. A. Lynch and M. S. Paterson, \u201cImpossibility of distributed consensus with one faulty process,\u201d Journal of the ACM, vol. 32, no. 2, April 1985, pp. 374\u2013382.","journal-title":"Journal of the ACM"},{"key":"17_CR10","first-page":"153","volume-title":"Lecture Notes in Computer Science 647","author":"J. A. Garay","year":"1992","unstructured":"J. A. Garay and K. J. Perry, \u201cA continuum of failure models for distributed computing,\u201d Proceedings of the 6th International Workshop on Distributed Algorithms, Haifa, Israel, November 1992, Lecture Notes in Computer Science 647, Springer Verlag, pp. 153\u2013165."},{"key":"17_CR11","first-page":"110","volume-title":"Lecture Notes in Computer Science 392","author":"A. Gopal","year":"1989","unstructured":"A. Gopal and S. Toueg, \u201cReliable broadcast in synchronous and asynchronous environments,\u201d Proceedings of the 3rd International Workshop on Distributed Algorithms, Nice, France, September 1989, Lecture Notes in Computer Science 392, Springer Verlag, pp. 110\u201323."},{"issue":"7","key":"17_CR12","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"L. Lamport, \u201cTime, clocks, and the ordering of events in a distributed system,\u201d Communications of the ACM, vol. 21, no. 7, July 1978, pp. 558\u2013565.","journal-title":"Communications of the ACM"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/71.89066","volume":"2","author":"F. J. Meyer","year":"1991","unstructured":"F. J. Meyer and D. K. Pradhan, \u201cConsensus with dual failure modes,\u201d IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 2, April 1991, pp. 214\u2013222.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"4","key":"17_CR14","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1137\/0222048","volume":"22","author":"L. E. Moser","year":"1993","unstructured":"L. E. Moser, P. M. Melliar-Smith and V. Agrawala, \u201cAsynchronous fault-tolerant total ordering algorithms,\u201d SIAM Journal of Computing, vol. 22, no. 4, August 1993, pp. 727\u2013750.","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"M. Pease, R. E. Shostak and L. Lamport, \u201cReaching agreement in the presence of faults,\u201d Journal of the ACM, vol. 27, no. 2, 1980, pp. 228\u2013234.","journal-title":"Journal of the ACM"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"M. O. Rabin, \u201cRandomized Byzantine generals,\u201d Proceedings of the 24th Annual Symposium on Foundations of Computer Science, Tucson, AZ, November 1983, pp. 403\u2013409.","DOI":"10.1109\/SFCS.1983.48"},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/190.357399","volume":"2","author":"F. B. Schneider","year":"1984","unstructured":"F. B. Schneider, \u201cByzantine generals in action: Implementing fail-stop processors,\u201d ACM Transactions on Computer Systems, vol. 2, no. 2, May 1984, pp. 145\u2013154.","journal-title":"ACM Transactions on Computer Systems"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"P. Thambidurai and Y. K. Park, \u201cInteractive consistency with multiple failure modes,\u201d Proceedings of the 7th IEEE Symposium on Reliable Distributed Systems, Columbus, OH, October 1988, pp. 93\u2013100.","DOI":"10.1109\/RELDIS.1988.25784"},{"issue":"3","key":"17_CR19","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1137\/0216031","volume":"16","author":"S. Toueg","year":"1987","unstructured":"S. Toueg, K. J. Perry and T. K. Srikanth, \u201cFast distributed agreement,\u201d SIAM Journal of Computing, vol. 16, no. 3, June 1987, pp. 445\u2013457.","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022151","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:45:35Z","timestamp":1586551535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602743","9783540447832"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0022151","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}