{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:59:42Z","timestamp":1794383982894,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540201847","type":"print"},{"value":"9783540399896","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":[[2003]]},"DOI":"10.1007\/978-3-540-39989-6_21","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T21:01:57Z","timestamp":1294434117000},"page":"292-305","source":"Crossref","is-referenced-by-count":5,"title":["On Failure Detectors and Type Boosters"],"prefix":"10.1007","author":[{"given":"Rachid","family":"Guerraoui","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Petr","family":"Kouznetsov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Attie, P., Lynch, N., Rajsbaum, S.: Boosting fault-tolerance in asynchronous message passing systems is impossible. Technical report, MIT Laboratory for Computer Science, MIT-LCS-TR-877 (2002)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E., Afek, Y.: Consensus power makes (some) sense! In: Proceedings of the 13th ACM Symposium on Principles of Distributed Computing (PODC), August 1994, pp. 363\u2013372 (1994)","DOI":"10.1145\/197917.198126"},{"key":"21_CR3","first-page":"334","volume-title":"Proceedings of the 13th ACM Symposium on Principles of Distributed Computing (PODC)","author":"T. Chandra","year":"1994","unstructured":"Chandra, T., Hadzilacos, V., Jayanti, P., Toueg, S.: Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies. In: Proceedings of the 13th ACM Symposium on Principles of Distributed Computing (PODC), pp. 334\u2013343. ACM Press, New York (1994)"},{"issue":"4","key":"21_CR4","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.: The weakest failure detector for solving consensus. Journal of the ACM (JACM)\u00a043(4), 685\u2013722 (1996)","journal-title":"Journal of the ACM (JACM)"},{"issue":"2","key":"21_CR5","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.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM (JACM)\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM (JACM)"},{"issue":"2","key":"21_CR6","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 ofthe ACM (JACM)\u00a035(2), 288\u2013323 (1988)","journal-title":"Journal ofthe ACM (JACM)"},{"issue":"3","key":"21_CR7","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 (JACM)\u00a032(3), 374\u2013382 (1985)","journal-title":"Journal of the ACM (JACM)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kouznetsov, P.: On failure detectors and type boosters. Technical report, IC, EPFL, ID:IC\/2003\/48 (2003), Available at http:\/\/icwww.epfl.ch\/publications\/","DOI":"10.1007\/978-3-540-39989-6_21"},{"key":"21_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BFb0042336","volume-title":"Proceedings of the Workshop on Fault-Tolerant Distributed Computing","author":"V. Hadzilacos","year":"1986","unstructured":"Hadzilacos, V.: On the relationship between the atomic commitment and consensus problems. In: Proceedings of the Workshop on Fault-Tolerant Distributed Computing. LNCS, vol.\u00a0448, pp. 201\u2013208. Springer, Heidelberg (1986)"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems (TOPLAS)\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Ruppert, E.: On the existence of booster types. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 653\u2013663 (2000)","DOI":"10.1109\/SFCS.2000.892333"},{"issue":"3","key":"21_CR12","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems (TOPLAS)\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0022136","volume-title":"Distributed Algorithms","author":"P. Jayanti","year":"1995","unstructured":"Jayanti, P.: Wait-free computing. In: Helary, J.-M., Raynal, M. (eds.) WDAG 1995. LNCS, vol.\u00a0972, pp. 19\u201350. Springer, Heidelberg (1995)"},{"issue":"4","key":"21_CR14","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1145\/263867.263888","volume":"44","author":"P. Jayanti","year":"1997","unstructured":"Jayanti, P.: Robust wait-free hierarchies. Journal of the ACM (JACM)\u00a044(4), 592\u2013614 (1997)","journal-title":"Journal of the ACM (JACM)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/BFb0020440","volume-title":"Distributed Algorithms","author":"W.-K. Lo","year":"1994","unstructured":"Lo, W.-K., Hadzilacos, V.: Using failure detectors to solve consensus in asynchronous shared-memory systems. In: Tel, G., Vit\u00e1nyi, P.M.B. (eds.) WDAG 1994. LNCS, vol.\u00a0857, pp. 280\u2013295. Springer, Heidelberg (1994)"},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1137\/S0097539798335766","volume":"30","author":"W.-K. Lo","year":"2000","unstructured":"Lo, W.-K., Hadzilacos, V.: All of us are smarter than any of us: Nondeterministic wait-free hierarchies are not robust. SIAM Journal of Computing\u00a030(3), 689\u2013728 (2000)","journal-title":"SIAM Journal of Computing"},{"key":"21_CR17","unstructured":"Loui, M.C., Abu-Amara, H.H.: Memory requirements for agreement among unreliable asynchronous processes. In: Advances in Computing Research, pp. 163\u2013183 (1987)"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Neiger, G.: Failure detectors and the wait-free hierarchy. In: Proceedings of the 14th ACM Symposium on Principles of Distributed Computing (PODC), August 1995, pp. 100\u2013109 (1995)","DOI":"10.1145\/224964.224976"},{"issue":"4","key":"21_CR19","doi-asserted-by":"publisher","first-page":"1156","DOI":"10.1137\/S0097539797329439","volume":"30","author":"E. Ruppert","year":"2000","unstructured":"Ruppert, E.: Determining consensus numbers. SIAM Journal of Computing\u00a030(4), 1156\u20131168 (2000)","journal-title":"SIAM Journal of Computing"}],"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-39989-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T09:49:48Z","timestamp":1740822588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39989-6_21"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201847","9783540399896"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39989-6_21","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b13831","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}