{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:13:00Z","timestamp":1725541980781},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108761"},{"type":"electronic","value":"9783642108778"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10877-8_11","type":"book-chapter","created":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T07:11:04Z","timestamp":1259737864000},"page":"115-128","source":"Crossref","is-referenced-by-count":1,"title":["The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems"],"prefix":"10.1007","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[]},{"given":"Sam","family":"Toueg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","first-page":"13","volume-title":"Distributed Computing","author":"M.K. Aguilera","year":"1999","unstructured":"Aguilera, M.K., Toueg, S., Deianov, B.: Revisiting the weakest failure detector for uniform reliable broadcast. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol.\u00a01693, pp. 13\u201333. Springer, Heidelberg (1999)"},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/0196-6774(90)90020-F","volume":"11","author":"O. Biran","year":"1990","unstructured":"Biran, O., Moran, S., Zaks, S.: A combinatorial characterization of the distributed 1-solvable tasks. J. Algorithms\u00a011(3), 420\u2013440 (1990)","journal-title":"J. Algorithms"},{"issue":"4","key":"11_CR3","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\u00a043(4), 685\u2013722 (1996)","journal-title":"Journal of the ACM"},{"issue":"2","key":"11_CR4","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\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1145\/93385.93431","volume-title":"PODC 1990: Proceedings of the ninth annual ACM symposium on Principles of Distributed Computing","author":"S. Chaudhuri","year":"1990","unstructured":"Chaudhuri, S.: Agreement is harder than consensus: set consensus problems in totally asynchronous systems. In: PODC 1990: Proceedings of the ninth annual ACM symposium on Principles of Distributed Computing, pp. 311\u2013324. ACM Press, New York (1990)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1145\/1011767.1011818","volume-title":"PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of Distributed Computing","author":"C. Delporte-Gallet","year":"2004","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Hadzilacos, V., Kouznetsov, P., Toueg, S.: The weakest failure detectors to solve certain fundamental problems in distributed computing. In: PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of Distributed Computing, pp. 338\u2013346. ACM Press, New York (2004)"},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.jpdc.2004.11.008","volume":"65","author":"C. Delporte-Gallet","year":"2005","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kouznetsov, P.: Mutual exclusion in asynchronous systems with failure detectors. Journal of Parallel and Distributed Computing\u00a065(4), 492\u2013505 (2005)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-87779-0_8","volume-title":"Distributed Computing","author":"C. Delporte-Gallet","year":"2008","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The weakest failure detector for message passing set-agreement. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 109\u2013120. Springer, Heidelberg (2008)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Toueg, S.: The minimum failure detector for non-local tasks in message-passing systems. Article id hal-00401844, Hyper Article en Ligne (April 2009), http:\/\/hal.archives-ouvertes.fr\/hal-00401844","DOI":"10.1007\/978-3-642-04355-0_37"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/3-540-12689-9_99","volume-title":"Foundations of Computation Theory","author":"M.J. Fischer","year":"1983","unstructured":"Fischer, M.J.: The consensus problem in unreliable distributed systems (a brief survey). In: Karpinski, M. (ed.) FCT 1983. LNCS, vol.\u00a0158, pp. 127\u2013140. Springer, Heidelberg (1983)"},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1145\/1281100.1281135","volume-title":"PODC 2007: Proceedings of the twenty-sixth Annual ACM Symposium on Principles of Distributed Computing","author":"R. Guerraoui","year":"2007","unstructured":"Guerraoui, R., Herlihy, M., Kouznetsov, P., Lynch, N.A., Newport, C.C.: On the weakest failure detector ever. In: PODC 2007: Proceedings of the twenty-sixth Annual ACM Symposium on Principles of Distributed Computing, pp. 235\u2013243. ACM Press, New York (2007)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/11864219_28","volume-title":"Distributed Computing","author":"R. Guerraoui","year":"2006","unstructured":"Guerraoui, R., Kapalka, M., Kouznetsov, P.: The weakest failure detectors to boost obstruction-freedom. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 399\u2013412. Springer, Heidelberg (2006)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BFb0042336","volume-title":"Fault-Tolerant Distributed Computing","author":"V. Hadzilacos","year":"1990","unstructured":"Hadzilacos, V.: On the relationship between the atomic commitment and consensus problems. In: Simons, B., Spector, A.Z. (eds.) Fault-Tolerant Distributed Computing. LNCS, vol.\u00a0448, pp. 201\u2013208. Springer, Heidelberg (1990)"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/301308.301331","volume-title":"PODC 1999: Proceedings of the eighteenth annual ACM symposium on Principles of Distributed Computing","author":"J.Y. Halpern","year":"1999","unstructured":"Halpern, J.Y., Ricciardi, A.: A knowledge-theoretic analysis of uniform distributed coordination and failure detectors. In: PODC 1999: Proceedings of the eighteenth annual ACM symposium on Principles of Distributed Computing, pp. 73\u201382. ACM Press, New York (1999)"},{"issue":"6","key":"11_CR15","doi-asserted-by":"publisher","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. Journal of the ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"Journal of the ACM"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/1400751.1400763","volume-title":"PODC 2008: Proceedings of the twenty-seventh annual ACM Symposium on Principles of Distributed Computing","author":"P. Jayanti","year":"2008","unstructured":"Jayanti, P., Toueg, S.: Every problem has a weakest failure detector. In: PODC 2008: Proceedings of the twenty-seventh annual ACM Symposium on Principles of Distributed Computing, pp. 75\u201384. ACM Press, New York (2008)"},{"issue":"5","key":"11_CR17","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M.E. Saks","year":"2000","unstructured":"Saks, M.E., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM J. Comput.\u00a029(5), 1449\u20131483 (2000)","journal-title":"SIAM J. Comput."},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-540-75142-7_35","volume-title":"Distributed Computing","author":"P. Zielinski","year":"2007","unstructured":"Zielinski, P.: Automatic classification of eventual failure detectors. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 465\u2013479. Springer, Heidelberg (2007)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1145\/1400751.1400761","volume-title":"PODC 2008: Proceedings of the twenty-seventh annual ACM Symposium on Principles of Distributed Computing","author":"P. Zielinski","year":"2008","unstructured":"Zielinski, P.: Anti-Omega: the weakest failure detector for set agreement. In: PODC 2008: Proceedings of the twenty-seventh annual ACM Symposium on Principles of Distributed Computing, pp. 55\u201364. ACM Press, New York (2008)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10877-8_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:36:18Z","timestamp":1606185378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10877-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108761","9783642108778"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10877-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}