{"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":1791174600592,"version":"4.1.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2011,10,28]],"date-time":"2011-10-28T00:00:00Z","timestamp":1319760000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s00446-011-0142-8","type":"journal-article","created":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T19:25:16Z","timestamp":1319743516000},"page":"149-163","source":"Crossref","is-referenced-by-count":16,"title":["On set consensus numbers"],"prefix":"10.1007","volume":"24","author":[{"given":"Eli","family":"Gafni","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,10,28]]},"reference":[{"issue":"1","key":"142_CR1","doi-asserted-by":"crossref","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. Inf. Comput. 105(1), 132\u2013158 (1993)","journal-title":"Inf. Comput."},{"issue":"2","key":"142_CR2","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"},{"issue":"5","key":"142_CR3","doi-asserted-by":"crossref","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. 29(5), 1449\u20131483 (2000)","journal-title":"SIAM J. Comput."},{"key":"142_CR4","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: STOC, pp. 91\u2013100. ACM Press (1993)","DOI":"10.1145\/167088.167119"},{"issue":"3","key":"142_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/PL00008933","volume":"14","author":"E. Borowsky","year":"2001","unstructured":"Borowsky E., Gafni E., Lynch N.A., Rajsbaum S.: The BG distributed simulation algorithm. Distrib. Comput. 14(3), 127\u2013146 (2001)","journal-title":"Distrib. Comput."},{"issue":"2","key":"142_CR6","doi-asserted-by":"crossref","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 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"issue":"4","key":"142_CR7","doi-asserted-by":"crossref","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 43(4), 685\u2013722 (1996)","journal-title":"J. ACM"},{"key":"142_CR8","doi-asserted-by":"crossref","unstructured":"Jayanti, P., Toueg, S.: Every problem has a weakest failure detector. In: PODC, pp. 75\u201384 (2008)","DOI":"10.1145\/1400751.1400763"},{"key":"142_CR9","unstructured":"Raynal, M.: K-anti-Omega (2007) Rump session at PODC (2007)"},{"issue":"5\u20136","key":"142_CR10","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s00446-010-0101-9","volume":"22","author":"P. Zieli\u0144ski","year":"2010","unstructured":"Zieli\u0144ski P.: Anti-omega: the weakest failure detector for set agreement. Distrib. Comput. 22(5\u20136), 335\u2013348 (2010)","journal-title":"Distrib. Comput."},{"issue":"7","key":"142_CR11","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Lamport L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"issue":"1","key":"142_CR12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 123\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"142_CR13","unstructured":"Zieli\u0144ski, P.: Automatic classification of eventual failure detectors. In: DISC (2007)"},{"issue":"6","key":"142_CR14","first-page":"293","volume":"67","author":"F. Chu","year":"1998","unstructured":"Chu F.: Reducing \u03a9 to $${\\diamondsuit W}$$ . Inf. Process. Lett. 67(6), 293\u2013298 (1998)","journal-title":"Inf. Process. Lett."},{"key":"142_CR15","doi-asserted-by":"crossref","unstructured":"Lo, W.K., Hadzilacos, V.: Using failure detectors to solve consensus in asynchronous shared memory systems. In: WDAG, LNCS 857, pp. 280\u2013295 (1994)","DOI":"10.1007\/BFb0020440"},{"key":"142_CR16","doi-asserted-by":"crossref","unstructured":"Gafni, E., Guerraoui, R.: Simulating few by many: limited concurrency=set consensus. Unpublished manuscript, available at http:\/\/www.cs.ucla.edu\/~eli\/eli\/kconc.pdf (2009)","DOI":"10.1007\/978-3-642-04355-0_8"},{"issue":"5","key":"142_CR17","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s00446-007-0043-z","volume":"20","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui R., Kuznetsov P.: Failure detectors as type boosters. Distrib. Comput. 20(5), 343\u2013358 (2008)","journal-title":"Distrib. Comput."},{"key":"142_CR18","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S.: Agreement is harder than consensus: Set consensus problems in totally asynchronous systems. In: PODC, pp. 311\u2013324 (1990)","DOI":"10.1145\/93385.93431"},{"key":"142_CR19","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Shavit, N.: The asynchronous computability theorem for t-resilient tasks. In: STOC, pp. 111\u2013120 (1993)","DOI":"10.1145\/167088.167125"},{"key":"142_CR20","doi-asserted-by":"crossref","unstructured":"Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. In: STOC, pp. 101\u2013110. ACM Press (1993)","DOI":"10.1145\/167088.167122"},{"key":"142_CR21","unstructured":"Gafni, E., Kuznetsov, P.: The weakest failure detector for solving k-set agreement. In: PODC (2009). Full version: http:\/\/www.net.t-labs.tu-berlin.de\/~petr\/pubs\/wfd-kset.pdf"},{"key":"142_CR22","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The disagreement power of an adversary (brief announcement). In: PODC (2009)","DOI":"10.1145\/1582716.1582769"},{"key":"142_CR23","unstructured":"Anta, A.F., Rajsbaum, S., Travers, C.: Weakest failure detectors via an egg-laying simulation (brief announcement). In: PODC (2009)"},{"key":"142_CR24","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Tielmann, A.: The disagreement power of an adversary. Distrib. Comput. (2011)","DOI":"10.1007\/s00446-010-0122-4"},{"key":"142_CR25","unstructured":"Gafni, E., Kuznetsov, P.: On set consensus numbers. In: DISC (2009) pp. 35\u201347"},{"key":"142_CR26","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Tight failure detection bounds on atomic object implementations. J. ACM 57(4), 22:1\u201322:32 (2010)","DOI":"10.1145\/1734213.1734216"},{"key":"142_CR27","unstructured":"Zieli\u0144ski, P.: Sub-consensus hierarchy is false (for symmetric, participation-aware tasks). https:\/\/sites.google.com\/site\/piotrzielinski\/home\/symmetric.pdf?attredirects=0 (2009)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-011-0142-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-011-0142-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-011-0142-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,12]],"date-time":"2021-12-12T23:13:05Z","timestamp":1639350785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-011-0142-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,28]]},"references-count":27,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["142"],"URL":"https:\/\/doi.org\/10.1007\/s00446-011-0142-8","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,28]]}}}