{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:28:51Z","timestamp":1725564531829},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207795"},{"type":"electronic","value":"9783540246183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24618-3_16","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T07:31:03Z","timestamp":1283671863000},"page":"196-207","source":"Crossref","is-referenced-by-count":4,"title":["Validity Conditions in Agreement Problems and Time Complexity"],"prefix":"10.1007","author":[{"given":"Bernadette","family":"Charron-Bost","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrice","family":"Le Fessant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Charron-Bost, B., Schiper, A.: Uniform Consensus is Harder than Consensus. Technical Report DSC\/2000\/028, D\u00e9partement Syst\u00e8mes de Communication, EPFL (May 2000), to appear in Journal of Algorithms"},{"key":"16_CR2","unstructured":"Charron-Bost, B., Toueg, S.: Comparing the Atomic Commitment and Consensus Problems (2001) (in preparation)"},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N.A., Stockmeyer, L.: Consensus in the Presence of Partial Synchrony. Journal of the ACM\u00a035(2), 288\u2013323 (1988)","journal-title":"Journal of the ACM"},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0890-5401(90)90014-9","volume":"88","author":"C. Dwork","year":"1990","unstructured":"Dwork, C., Moses, Y.: Knowledge and Common Knowledge in a Byzantine Environment: Crash Failures. Information and Computation\u00a088(2), 156\u2013186 (1990)","journal-title":"Information and Computation"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0020-0190(02)00333-2","volume":"85","author":"I. Keidar","year":"2003","unstructured":"Keidar, I., Rajsbaum, S.: A Simple Proof of the Uniform Consensus Synchronous Lower Bound. Information Processing Letters\u00a085(1), 47\u201352 (2003)","journal-title":"Information Processing Letters"},{"issue":"3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/2402.322398","volume":"30","author":"L. Lamport","year":"1983","unstructured":"Lamport, L.: The Weak Byzantine Generals Problem. Journal of the ACM\u00a030(3), 668\u2013676 (1983)","journal-title":"Journal of the ACM"},{"key":"16_CR8","unstructured":"Lamport, L.: Lower Bounds on Consensus. Unpublished note (March 2000)"},{"key":"16_CR9","unstructured":"Lamport, L., Fischer, M.: Byzantine Generals and Transaction Commit Protocols. Technical Report 62, SRI International (April 1982)"},{"key":"16_CR10","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"key":"16_CR11","unstructured":"Merritt, M.J.: Unpublished Notes (1985)"},{"key":"16_CR12","first-page":"133","volume-title":"Proceedings of the ACM SIGMOD Conf. on Management of Data","author":"D. Skeen","year":"1982","unstructured":"Skeen, D.: Nonblocking Commit Protocols. In: Proceedings of the ACM SIGMOD Conf. on Management of Data, June 1982, pp. 133\u2013147. ACM, New York (1982)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2004: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24618-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T20:34:42Z","timestamp":1553027682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24618-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540207795","9783540246183"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24618-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}