{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:55:44Z","timestamp":1725486944152},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540009122"},{"type":"electronic","value":"9783540377955"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-37795-6_6","type":"book-chapter","created":{"date-parts":[[2007,6,24]],"date-time":"2007-06-24T17:20:40Z","timestamp":1182705640000},"page":"29-34","source":"Crossref","is-referenced-by-count":2,"title":["Comparing the Atomic Commitment and Consensus Problems"],"prefix":"10.1007","author":[{"given":"Bernadette","family":"Charron-Bost","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"key":"6_CR1","unstructured":"M. Ben-Or, M. (1983): Another advantage of free choice: Completely asynchronous agreement protocols. PODC, 27\u201330"},{"issue":"4","key":"6_CR2","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T. D. Chandra","year":"1996","unstructured":"Chandra, T. D., Hadzilacos, V, Toueg, S. (1996): The weakest failure detector for solving consensus. JACM 43(4), 685\u2013722","journal-title":"JACM"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T. D. Chandra","year":"1996","unstructured":"Chandra, T. D., Toueg, S. (1996): Unreliable failure detectors for asynchronous systems. JACM. 43(2), 225\u2013267","journal-title":"JACM"},{"key":"6_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/3-540-45627-9_2","volume-title":"Agreement problems in fault-tolerant distributed systems","author":"B. Charron-Bost","year":"2001","unstructured":"Charron-Bost, B. (2001): Agreement problems in fault-tolerant distributed systems. (SOFSEM, LNCS, vol. 2234), 10\u201332"},{"key":"6_CR5","unstructured":"Charron-Bost, B. (2001): The weakest failure detector for solving atomic commitment. Unpublished Notes"},{"key":"6_CR6","unstructured":"Charron-Bost, B., Le Fessant, F. (2002):Validity conditions in agreement problems and time complexity. Tech. Rep. RR-4526, INRIA-Rocquencourt"},{"key":"6_CR7","unstructured":"Charron-Bost, B., Schiper, A. (2000): Uniform consensus is harder than consensus. Tech. Rep. DSC\/2000\/028, EPFL"},{"key":"6_CR8","unstructured":"Charron-Bost, B., Toueg, S. (2001): Comparing the atomic commitment and consensus problems. Unpublished Notes"},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D. Dolev","year":"1990","unstructured":"Dolev, D., Reischuk, R., Strong, H. R. (1990): Early stopping in Byzantine agreement. JACM 37(4), 720\u2013741","journal-title":"JACM"},{"issue":"2","key":"6_CR10","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. (1988): Consensus in the presence of partial synchrony. JACM 35(2), 288\u2013323","journal-title":"JACM"},{"issue":"2","key":"6_CR11","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. (1985): Impossibility of distributed consensus with one faulty process. JACM 32(2), 374\u2013382","journal-title":"JACM"},{"key":"6_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/BFb0042322","volume-title":"Fault Tolerant Distributed Computing","author":"J. Gray","year":"1987","unstructured":"Gray, J. (1987): A comparison of the byzantine agreement problem and the transaction commit problem. (Fault Tolerant Distributed Computing, LNCS vol. 448), 10\u201317"},{"key":"6_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BFb0022140","volume-title":"WDAG","author":"R. Guerraoui","year":"1995","unstructured":"Guerraoui, R. (1995): Revisiting the relationship between non-blocking atomic commitment and consensus. (WDAG, LNCS vol. 972), 87\u2013100"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Guerraoui, R. (2002): Non-blocking atomic commitment in asynchronous systems with failure detectors. Distributed Computing 15(1)","DOI":"10.1007\/s446-002-8027-4"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kouznetsov, P. (2002): On the weakest failure detector for non-blocking atomic commit. International Conference on Theoretical Computer Science","DOI":"10.1007\/978-0-387-35608-2_38"},{"key":"6_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BFb0042336","volume-title":"Fault Tolerant Distributed Computing","author":"V. Hadzilacos","year":"1987","unstructured":"Hadzilacos, V. (1987): On the relationship between the atomic commitment and consensus problems. (Fault Tolerant Distributed Computing, LNCS vol. 448), 201\u2013208"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Keidar, I., Rajsbaum, S. (2002):A simple proof of the uniform consensus synchronous lower bound. IPL, To appear","DOI":"10.1016\/S0020-0190(02)00333-2"},{"key":"6_CR18","unstructured":"Lamport, L. (2000): Lower bounds on consensus. Unpublished manuscript"},{"key":"6_CR19","unstructured":"Merritt, M. J (1985): Unpublished Notes"},{"key":"6_CR20","unstructured":"Skeen, D. (1982): Nonblocking commit protocols. ACM SIGMOD Conf. on Management of Data, 133\u2013147"}],"container-title":["Lecture Notes in Computer Science","Future Directions in Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-37795-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T05:36:23Z","timestamp":1556516183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-37795-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540009122","9783540377955"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-37795-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}