{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:24:48Z","timestamp":1737437088489,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540751410"},{"type":"electronic","value":"9783540751427"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75142-7_23","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T14:00:46Z","timestamp":1189000846000},"page":"283-297","source":"Crossref","is-referenced-by-count":1,"title":["On the Message Complexity of Indulgent Consensus"],"prefix":"10.1007","author":[{"given":"Seth","family":"Gilbert","sequence":"first","affiliation":[]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM\u00a027(2), 228\u2013234 (1980)","journal-title":"Journal of the ACM"},{"issue":"2","key":"23_CR2","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. Fisher","year":"1985","unstructured":"Fisher, M., Lynch, N., Paterson, M.: Impossibility of distributed consensus with one faulty process. Journal of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"issue":"2","key":"23_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., 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":"23_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T. Chandra","year":"1996","unstructured":"Chandra, T., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"issue":"2","key":"23_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L. Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Transactions on Computer Systems\u00a016(2), 133\u2013169 (1998)","journal-title":"ACM Transactions on Computer Systems"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-48169-9_4","volume-title":"Distributed Computing","author":"A. Mostefaoui","year":"1999","unstructured":"Mostefaoui, A., Raynal, M.: Solving consensus using chandra-toueg\u2019s unreliable failure detectors: A general quorum-based approach. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol.\u00a01693, pp. 49\u201363. Springer, Heidelberg (1999)"},{"issue":"4","key":"23_CR7","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1109\/TC.2004.1268403","volume":"53","author":"R. Guerraoui","year":"2004","unstructured":"Guerraoui, R., Raynal, M.: The information structure of indulgent consensus. IEEE Transactions on Computers\u00a053(4), 453\u2013466 (2004)","journal-title":"IEEE Transactions on Computers"},{"issue":"3","key":"23_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s004460050032","volume":"10","author":"A. Schiper","year":"1997","unstructured":"Schiper, A.: Early consensus in an asynchronous system with a weak failure detector. Distributed Computing\u00a010(3), 149\u2013157 (1997)","journal-title":"Distributed Computing"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Guerraoui, R.: Indulgent algorithms (preliminary version). In: Proceedings of the 19th Symposium on Principles of Distributed Computing (PODC), pp. 289\u2013297 (2000)","DOI":"10.1145\/343477.343630"},{"key":"23_CR10","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufman, San Francisco (1996)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Dutta, P., Guerraoui, R.: The inherent price of indulgence. In: Proceedings of the 21st Symposium on Principles of Distributed Computing (PODC), pp. 88\u201397 (2002)","DOI":"10.1145\/571825.571838"},{"key":"23_CR12","unstructured":"Lamport, L.: Fast paxos. Technical Report MSR-TR-2005-12, Microsoft (2005)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/3-540-54099-7_20","volume-title":"Distributed Algorithms","author":"T. Chandra","year":"1991","unstructured":"Chandra, T., Toueg, S.: Time and message efficient reliable broadcasts. In: van Leeuwen, J., Santoro, N. (eds.) Distributed Algorithms. LNCS, vol.\u00a0486, pp. 289\u2013303. Springer, Heidelberg (1991)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Galil, Z., Mayer, A., Yung, M.: Resolving message complexity of byzantine agreement and beyond. In: Proceedings of the 36th Symposium on Foundations of Computer Science (FOCS), pp. 724\u2013733 (1995)","DOI":"10.1109\/SFCS.1995.492674"},{"issue":"4","key":"23_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M. Fisher","year":"1982","unstructured":"Fisher, M., Lynch, N.: A lower bound for the time to assure interactive consistency. Information Processing Letters (IPL)\u00a014(4), 183\u2013186 (1982)","journal-title":"Information Processing Letters (IPL)"},{"key":"23_CR16","unstructured":"Dolev, D., Strong, H.: Requirements for agreement in a distributed system. Technical Report RJ 3418, IBM Research, San Jose, CA (March 1982)"},{"key":"23_CR17","unstructured":"Lamport, L., Fisher, M.: Byzantine generals and transaction commit protocols. Unpublished (April 1982)"},{"issue":"4","key":"23_CR18","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.: Early stopping in byzantine agreement. Journal of the ACM\u00a037(4), 720\u2013741 (1990)","journal-title":"Journal of the ACM"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Charron-Bost, B., Schiper, A.: Improving Fast Paxos: being optimistic with no overhead. In: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (PRDC), pp. 287\u2013295 (2006)","DOI":"10.1109\/PRDC.2006.39"},{"issue":"5","key":"23_CR20","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1137\/S0097539793255527","volume":"27","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Halpern, J., Waarts, O.: Performing work efficiently in the presence of faults. SIAM Journal on Computing\u00a027(5), 1457\u20131491 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Chlebus, B., Kowalski, D.: Gossiping to reach consensus. In: Proceedings of 14th Symposium on Parallel Algorithms and Architectures (SPAA), pp. 220\u2013229 (2002)","DOI":"10.1145\/564870.564908"},{"issue":"8","key":"23_CR22","doi-asserted-by":"publisher","first-page":"1262","DOI":"10.1016\/j.jcss.2006.08.001","volume":"72","author":"B. Chlebus","year":"2006","unstructured":"Chlebus, B., Kowalski, D.: Robust gossiping with an application to consensus. Journal of Computer and System Science\u00a072(8), 1262\u20131281 (2006)","journal-title":"Journal of Computer and System Science"},{"issue":"4","key":"23_CR23","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02277665","volume":"5","author":"S. Amdur","year":"1992","unstructured":"Amdur, S., Weber, S., Hadzilacos, V.: On the message complexity of binary agreement under crash failures. Distributed Computing\u00a05(4), 175\u2013186 (1992)","journal-title":"Distributed Computing"},{"issue":"1","key":"23_CR24","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01187074","volume":"26","author":"V. Hadzilacos","year":"1993","unstructured":"Hadzilacos, V., Halpern, J.: Message-optimal protocols for byzantine agreement. Mathematical Systems Theory\u00a026(1), 41\u2013102 (1993)","journal-title":"Mathematical Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75142-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T21:16:16Z","timestamp":1737407776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75142-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540751410","9783540751427"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75142-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}