{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T05:42:59Z","timestamp":1740894179008,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642176784"},{"type":"electronic","value":"9783642176791"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-17679-1_4","type":"book-chapter","created":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T18:44:30Z","timestamp":1294253070000},"page":"41-52","source":"Crossref","is-referenced-by-count":1,"title":["Generating Fast Indulgent Algorithms"],"prefix":"10.1007","author":[{"given":"Dan","family":"Alistarh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seth","family":"Gilbert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Corentin","family":"Travers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Guerraoui, R.: Indulgent algorithms. In: PODC 2000, pp. 289\u2013297. ACM, New York (July 2000)","DOI":"10.1145\/343477.343630"},{"key":"4_CR2","first-page":"288","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N.A., Stockmeyer, L.: Consensus in the presence of partial synchrony. J.\u00a0ACM\u00a035, 288\u2013323 (1988)","journal-title":"J.\u00a0ACM"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Dutta, P., Guerraoui, R.: The inherent price of indulgence. In: PODC 2002: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, pp. 88\u201397 (2002)","DOI":"10.1145\/571825.571838"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00446-006-0005-x","volume":"19","author":"L. Lamport","year":"2006","unstructured":"Lamport, L.: Fast paxos. Distributed Computing\u00a019(2), 79\u2013103 (2006)","journal-title":"Distributed Computing"},{"key":"4_CR5","unstructured":"Lamport, L.: Generalized consensus and paxos. Microsoft Research Technical Report MSR-TR-2005-33 (March 2005)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-87779-0_3","volume-title":"Distributed Computing","author":"D. Alistarh","year":"2008","unstructured":"Alistarh, D., Gilbert, S., Guerraoui, R., Travers, C.: How to solve consensus in the smallest window of synchrony. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 32\u201346. Springer, Heidelberg (2008)"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H. Attiya","year":"1990","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. Journal of the ACM\u00a037(3), 524\u2013548 (1990)","journal-title":"Journal of the ACM"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(98)00242-4","volume":"220","author":"S. Chaudhuri","year":"1999","unstructured":"Chaudhuri, S., Herlihy, M., Tuttle, M.R.: Wait-free implementations in message-passing systems. Theor. Comput. Sci.\u00a0220(1), 211\u2013245 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s00446-005-0124-9","volume":"18","author":"P. Dutta","year":"2005","unstructured":"Dutta, P., Guerraoui, R.: The inherent price of indulgence. Distributed Computing\u00a018(1), 85\u201398 (2005)","journal-title":"Distributed Computing"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10631-6_95","volume-title":"Algorithms and Computation","author":"D. Alistarh","year":"2009","unstructured":"Alistarh, D., Gilbert, S., Guerraoui, R., Travers, C.: Of choices, failures and asynchrony: The many faces of set agreement. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, Springer, Heidelberg (2009)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for asynchronous systems (preliminary version). In: ACM Symposium on Principles of Distributed Computing, pp. 325\u2013340 (August 1991)","DOI":"10.1145\/112600.112627"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Gafni, E.: Round-by-round fault detectors (extended abstract): Unifying synchrony and asynchrony. In: Proceedings of the 17th Symposium on Principles of Distributed Computing (1998)","DOI":"10.1145\/277697.277724"},{"issue":"5-6","key":"4_CR13","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00446-006-0017-6","volume":"19","author":"P. Dutta","year":"2007","unstructured":"Dutta, P., Guerraoui, R., Keidar, I.: The overhead of consensus failure recovery. Distributed Computing\u00a019(5-6), 373\u2013386 (2007)","journal-title":"Distributed Computing"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-642-04355-0_6","volume-title":"Distributed Computing","author":"C. Delporte-Gallet","year":"2009","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The disagreement power of an adversary. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 8\u201321. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17679-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T12:47:05Z","timestamp":1740833225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17679-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642176784","9783642176791"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17679-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}