{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T12:40:12Z","timestamp":1687437612037},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,5,4]],"date-time":"2012-05-04T00:00:00Z","timestamp":1336089600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s00224-012-9407-2","type":"journal-article","created":{"date-parts":[[2012,5,3]],"date-time":"2012-05-03T13:33:12Z","timestamp":1336051992000},"page":"404-424","source":"Crossref","is-referenced-by-count":1,"title":["Generating Fast Indulgent Algorithms"],"prefix":"10.1007","volume":"51","author":[{"given":"Dan","family":"Alistarh","sequence":"first","affiliation":[]},{"given":"Seth","family":"Gilbert","sequence":"additional","affiliation":[]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[]},{"given":"Corentin","family":"Travers","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,5,4]]},"reference":[{"key":"9407_CR1","first-page":"126","volume-title":"WDAG","author":"M.K. Aguilera","year":"1997","unstructured":"Aguilera, M.K., Chen, W., Toueg, S.: Heartbeat: A timeout-free failure detector for quiescent reliable communication. In: WDAG, pp. 126\u2013140 (1997)"},{"key":"9407_CR2","first-page":"32","volume-title":"DISC","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: DISC, pp. 32\u201346 (2008)"},{"key":"9407_CR3","first-page":"943","volume-title":"Proceedings of the 20th International Symposium on Algorithms and Computation, ISAAC \u201909","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: Proceedings of the 20th International Symposium on Algorithms and Computation, ISAAC \u201909, pp. 943\u2013953. Springer, Berlin (2009)"},{"issue":"3","key":"9407_CR4","doi-asserted-by":"crossref","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. J. ACM 37(3), 524\u2013548 (1990)","journal-title":"J. ACM"},{"key":"9407_CR5","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/112600.112627","volume-title":"ACM Symposium on Principles of Distributed Computing","author":"T.D. Chandra","year":"1991","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for asynchronous systems (preliminary version). In: ACM Symposium on Principles of Distributed Computing, August, pp. 325\u2013340 (1991)"},{"issue":"1","key":"9407_CR6","doi-asserted-by":"crossref","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. 220(1), 211\u2013245 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"9407_CR7","first-page":"8","volume-title":"DISC","author":"C. Delporte-Gallet","year":"2009","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The disagreement power of an adversary. In: DISC, pp. 8\u201321 (2009)"},{"key":"9407_CR8","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1145\/571825.571838","volume-title":"PODC \u201902: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing","author":"P. Dutta","year":"2002","unstructured":"Dutta, P., Guerraoui, R.: The inherent price of indulgence. In: PODC \u201902: Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, pp. 88\u201397 (2002)"},{"issue":"1","key":"9407_CR9","doi-asserted-by":"crossref","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. Distrib. Comput. 18(1), 85\u201398 (2005)","journal-title":"Distrib. Comput."},{"issue":"5\u20136","key":"9407_CR10","doi-asserted-by":"crossref","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. Distrib. Comput. 19(5\u20136), 373\u2013386 (2007)","journal-title":"Distrib. Comput."},{"issue":"2","key":"9407_CR11","doi-asserted-by":"crossref","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. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"9407_CR12","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/277697.277724","volume-title":"Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, PODC \u201998","author":"E. Gafni","year":"1998","unstructured":"Gafni, E.: Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, PODC \u201998, pp. 143\u2013152. ACM, New York (1998)"},{"key":"9407_CR13","first-page":"289","volume-title":"PODC\u2019 2000","author":"R. Guerraoui","year":"2000","unstructured":"Guerraoui, R.: Indulgent algorithms. In: PODC\u2019 2000, July, pp. 289\u2013297. ACM, New York (2000)"},{"issue":"2","key":"9407_CR14","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M. Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. J. ACM 46(2), 858\u2013923 (1999)","journal-title":"J. ACM"},{"key":"9407_CR15","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1145\/1146381.1146408","volume-title":"PODC","author":"I. Keidar","year":"2006","unstructured":"Keidar, I., Shraer, A.: Timeliness, failure-detectors, and consensus performance. In: PODC, pp. 169\u2013178 (2006)"},{"key":"9407_CR16","unstructured":"Lamport, L.: Generalized consensus and paxos. Microsoft research technical report MSR-TR-2005-33 (2005)"},{"issue":"2","key":"9407_CR17","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s00446-006-0005-x","volume":"19","author":"L. Lamport","year":"2006","unstructured":"Lamport, L.: Fast paxos. Distrib. Comput. 19(2), 79\u2013103 (2006)","journal-title":"Distrib. Comput."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9407-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-012-9407-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9407-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T12:20:20Z","timestamp":1687436420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-012-9407-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,4]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["9407"],"URL":"https:\/\/doi.org\/10.1007\/s00224-012-9407-2","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,4]]}}}