{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T04:30:00Z","timestamp":1791174600954,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642176524","type":"print"},{"value":"9783642176531","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17653-1_16","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T00:50:47Z","timestamp":1291596647000},"page":"189-204","source":"Crossref","is-referenced-by-count":9,"title":["$(\\mathrm{anti-}\\Omega^{x} \\times \\Sigma_{z})$ -Based k-Set Agreement Algorithms"],"prefix":"10.1007","author":[{"given":"Zohir","family":"Bouzid","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Corentin","family":"Travers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","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, pp. 943\u2013953. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-10631-6_95"},{"key":"16_CR2","first-page":"290","volume-title":"PODC 2009","author":"A.F. Anta","year":"2009","unstructured":"Anta, A.F., Rajsbaum, S., Travers, C.: Brief announcement: weakest failure detectors via an egg-laying simulation. In: PODC 2009, pp. 290\u2013291. ACM Press, New York (2009)"},{"key":"16_CR3","unstructured":"Anta, A.F., Rajsbaum, S., Travers, C.: Weakest failure detectors via an egg-laying simulation (preliminary version). Technical report, Universidad Rey Juan Carlos. Reports on Systems and Communications, vol. IX(2) (January 2009), http:\/\/gsyc.es\/tr-docs\/RoSaC-2009-2.pdf"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-05118-0_11","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"F. Bonnet","year":"2009","unstructured":"Bonnet, F., Raynal, M.: Looking for the weakest failure detector for k-set agreement in message-passing systems: Is \u03c0 k the end of the road? In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol.\u00a05873, pp. 149\u2013164. Springer, Heidelberg (2009)"},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.ipl.2009.11.011","volume":"110","author":"F. Bonnet","year":"2010","unstructured":"Bonnet, F., Raynal, M.: A simple proof of the necessity of the failure detector sigma to implement an atomic register in asynchronous message-passing systems. Information Processing Letters\u00a0110(4), 153\u2013157 (2010)","journal-title":"Information Processing Letters"},{"key":"16_CR6","first-page":"91","volume-title":"STOC 1993","author":"E. Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: STOC 1993, pp. 91\u2013100. ACM Press, New York (1993)"},{"key":"16_CR7","unstructured":"Bouzid, Z., Travers, C.: $(\\mathrm{anti-}\\Omega^{x} \\times \\Sigma_{z})$ -based k-set Agreement Algorithms. Technical report, http:\/\/hal.archives-ouvertes.fr\/inria-00519606\/en\/"},{"issue":"4","key":"16_CR8","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. J. ACM\u00a043(4), 685\u2013722 (1996)","journal-title":"J. ACM"},{"issue":"2","key":"16_CR9","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. J. ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/inco.1993.1043","volume":"105","author":"S. Chaudhuri","year":"1993","unstructured":"Chaudhuri, S.: More choices allow more faults: Set consensus problems in totally asynchronous systems. Information and Computation\u00a0105(1), 132\u2013158 (1993)","journal-title":"Information and Computation"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-75142-7_12","volume-title":"Distributed Computing","author":"W. Chen","year":"2007","unstructured":"Chen, W., Zhang, J., Chen, Y., Liu, X.: Weakening failure detectors for k-set agreement via the partition approach. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 123\u2013138. Springer, Heidelberg (2007)"},{"key":"16_CR12","first-page":"85","volume-title":"PODC 2008","author":"C. Delporte-Gallet","year":"2008","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Sharing is harder than agreeing. In: PODC 2008, pp. 85\u201394. ACM Press, New York (2008)"},{"key":"16_CR13","first-page":"338","volume-title":"PODC 2004","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, pp. 338\u2013346. ACM Press, New York (2004)"},{"key":"16_CR14","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":"16_CR15","first-page":"288","volume-title":"PODC 2009","author":"C. Delporte-Gallet","year":"2009","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The disagreement power of an adversary: extended abstract. In: PODC 2009, pp. 288\u2013289. ACM Press, New York (2009)"},{"issue":"1","key":"16_CR16","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"},{"issue":"2","key":"16_CR17","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.: Impossibility of distributed consensus with one faulty process. J. ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"16_CR18","first-page":"83","volume-title":"PODC 2009","author":"E. Gafni","year":"2009","unstructured":"Gafni, E., Kuznetsov, P.: The weakest failure detector for solving k-set agreement. In: PODC 2009, pp. 83\u201391. ACM Press, New York (2009)"},{"key":"16_CR19","first-page":"289","volume-title":"PODC 2000","author":"R. Guerraoui","year":"2000","unstructured":"Guerraoui, R.: Indulgent algorithms (preliminary version). In: PODC 2000, pp. 289\u2013297. ACM Press, New York (2000)"},{"issue":"5","key":"16_CR20","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00446-009-0079-3","volume":"21","author":"R. Guerraoui","year":"2009","unstructured":"Guerraoui, R., Herlihy, M., Kuznetsov, P., Lynch, N.A., Newport, C.C.: On the weakest failure detector ever. Distributed Computing\u00a021(5), 353\u2013366 (2009)","journal-title":"Distributed Computing"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Lynch, N.A.: A general characterization of indulgence. Transactions on Autonomous and Adaptive Systems\u00a03(4) (2008)","DOI":"10.1145\/1452001.1452010"},{"issue":"1","key":"16_CR22","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1093\/comjnl\/bxl046","volume":"50","author":"R. Guerraoui","year":"2007","unstructured":"Guerraoui, R., Raynal, M.: The alpha of indulgent consensus. The Computer Journal\u00a050(1), 53\u201367 (2007)","journal-title":"The Computer Journal"},{"key":"16_CR23","unstructured":"Hadzilacos, V., Toueg, S.: Reliable broadcast and related problems. In: Distributed Systems, pp. 97\u2013145 (1993)"},{"issue":"2","key":"16_CR24","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00446-005-0141-8","volume":"18","author":"M. Herlihy","year":"2005","unstructured":"Herlihy, M., Penso, L.D.: Tight bounds for k-set agreement with limited-scope failure detectors. Distributed Computing\u00a018(2), 157\u2013166 (2005)","journal-title":"Distributed Computing"},{"issue":"6","key":"16_CR25","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. J. ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"J. ACM"},{"issue":"3","key":"16_CR26","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00446-008-0064-2","volume":"21","author":"A. Most\u00e9faoui","year":"2008","unstructured":"Most\u00e9faoui, A., Rajsbaum, S., Raynal, M., Travers, C.: On the computability power and the robustness of set agreement-oriented failure detector classes. Distributed Computing\u00a021(3), 201\u2013222 (2008)","journal-title":"Distributed Computing"},{"key":"16_CR27","first-page":"143","volume-title":"PODC 2000","author":"A. Most\u00e9faoui","year":"2000","unstructured":"Most\u00e9faoui, A., Raynal, M.: k-set agreement with limited accuracy failure detectors. In: PODC 2000, pp. 143\u2013152. ACM Press, New York (2000)"},{"key":"16_CR28","first-page":"100","volume-title":"PODC 1995","author":"G. Neiger","year":"1995","unstructured":"Neiger, G.: Failure detectors and the wait-free hierarchy. In: PODC 1995, pp. 100\u2013109. ACM Press, New York (1995)"},{"key":"16_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11945529_2","volume-title":"Principles of Distributed Systems","author":"M. Raynal","year":"2006","unstructured":"Raynal, M., Travers, C.: In search of the holy grail: Looking for the weakest failure detector for wait-free set agreement. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 3\u201319. Springer, Heidelberg (2006)"},{"issue":"5","key":"16_CR30","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":"16_CR31","first-page":"297","volume-title":"PODC 1998","author":"J. Yang","year":"1998","unstructured":"Yang, J., Neiger, G., Gafni, E.: Structured derivations of consensus algorithms for failure detectors. In: PODC 1998, pp. 297\u2013306. ACM Press, New York (1998)"},{"key":"16_CR32","first-page":"55","volume-title":"PODC 2008","author":"P. Zieli\u0144ski","year":"2008","unstructured":"Zieli\u0144ski, P.: Anti-omega: the weakest failure detector for set agreement. In: PODC 2008, 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-17653-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T16:51:57Z","timestamp":1559839917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17653-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642176524","9783642176531"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17653-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}