{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T00:10:26Z","timestamp":1740010226461,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2010,4,14]],"date-time":"2010-04-14T00:00:00Z","timestamp":1271203200000},"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":[[2010,8]]},"DOI":"10.1007\/s00446-010-0101-9","type":"journal-article","created":{"date-parts":[[2010,4,13]],"date-time":"2010-04-13T16:43:55Z","timestamp":1271177035000},"page":"335-348","source":"Crossref","is-referenced-by-count":11,"title":["Anti-\u03a9: the weakest failure detector for set agreement"],"prefix":"10.1007","volume":"22","author":[{"given":"Piotr","family":"Zieli\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,4,14]]},"reference":[{"key":"101_CR1","first-page":"65","volume-title":"PODC","author":"Y. Afek","year":"2008","unstructured":"Afek Y., Nir I.: Failure detectors in loosely named systems. In: Bazzi, R.A., Patt-Shamir, B. (eds) PODC, pp. 65\u201374. ACM, New York (2008)"},{"key":"101_CR2","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long-lived and adaptive atomic snapshot and immediate snapshot. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC-00), pp. 71\u201380, New York, July 16\u201319 (2000). ACM Press."},{"key":"101_CR3","doi-asserted-by":"crossref","unstructured":"Afek, Y., Gafni, E., Rajsbaum, S., Raynal, M.: Travers corentin: simultaneous consensus tasks: a tighter characterization of set-consensus. Distributed Comput. 22(3) (2010)","DOI":"10.1007\/s00446-009-0090-8"},{"key":"101_CR4","doi-asserted-by":"crossref","unstructured":"Attiya, H.: A direct lower bound for k-set consensus. In: PODC, p. 314 (1998)","DOI":"10.1145\/277697.277770"},{"key":"101_CR5","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: Aggarwal, A. (ed.) Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pp. 91\u2013100, San Diego, May. ACM Press, ISBN 0-89791-591-7 (1993a)","DOI":"10.1145\/167088.167119"},{"key":"101_CR6","doi-asserted-by":"crossref","unstructured":"Borowsky E., Gafni, E.: Immediate atomic snapshots and fast renaming (extended abstract). In: PODC, pp. 41\u201351 (1993b)","DOI":"10.1145\/164051.164056"},{"issue":"4","key":"101_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":"101_CR8","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S.: More choices allow more faults: set Consensus problems in totally asynchronous systems. INFCTRL: Inf. Comput. 105 (1993)","DOI":"10.1006\/inco.1993.1043"},{"key":"101_CR9","doi-asserted-by":"crossref","unstructured":"Chen, W., Zhang, J., Chen, Y., Liu, X.: Weakening failure detectors for k-set agreement via the partition approach. In: Pelc, A. (ed.) Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, Sept 24\u201326, 2007, Proceedings, vol. 4731 of Lecture Notes in Computer Science, pp. 123\u2013138. Springer (2007)","DOI":"10.1007\/978-3-540-75142-7_12"},{"issue":"2","key":"101_CR10","doi-asserted-by":"crossref","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. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"issue":"3","key":"101_CR11","doi-asserted-by":"crossref","first-page":"970","DOI":"10.1137\/S0097539796305766","volume":"28","author":"E. Gafni","year":"1999","unstructured":"Gafni E., Koutsoupias E.: Three-processor tasks are undecidable. SIAM J. Comput. 28(3), 970\u2013983 (1999) ISSN 0097-5397","journal-title":"SIAM J. Comput."},{"key":"101_CR12","doi-asserted-by":"crossref","unstructured":"Gafni, E., Kuznetsov, P.: The weakest failure detector for solving k-set agreement. In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing (PODC 2009), Calgary (2009, August)","DOI":"10.1145\/1582716.1582735"},{"issue":"1","key":"101_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00446-002-0070-8","volume":"16","author":"E. Gafni","year":"2003","unstructured":"Gafni E., Lamport L.: Disk paxos. Distributed Comput. 16(1), 1\u201320 (2003)","journal-title":"Distributed Comput."},{"key":"101_CR14","doi-asserted-by":"crossref","unstructured":"Gafni, E., Rajsbaum, S., Herlihy, M.: Subconsensus tasks: renaming is weaker than set agreement. In: Dolev, S. (ed) Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sept. 18\u201320, 2006, Proceedings, vol. 4167 of Lecture Notes in Computer Science, pp. 329\u2013338. Springer, ISBN 3-540-44624-9 (2006)","DOI":"10.1007\/11864219_23"},{"key":"101_CR15","doi-asserted-by":"crossref","unstructured":"Guerraoui, R.: Indulgent algorithms. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pp. 289\u2013298, New York. ACM Press (2000, July)","DOI":"10.1145\/343477.343630"},{"key":"101_CR16","unstructured":"Guerraoui, R., Kuznetsov, P.: Finally the weakest failure detector for non-blocking atomic commit. Technical Report LPD-2003-005, EPFL, Lausanne, Switzerland (2003, December)"},{"issue":"1","key":"101_CR17","doi-asserted-by":"crossref","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. Comput. J. 50(1), 53\u201367 (2007)","journal-title":"Comput. J."},{"issue":"5","key":"101_CR18","doi-asserted-by":"crossref","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 Comput. 21(5), 353\u2013366 (2009)","journal-title":"Distributed Comput."},{"key":"101_CR19","doi-asserted-by":"crossref","unstructured":"Herlihy, S.: The topological structure of asynchronous computability. J. ACM 46 (1999)","DOI":"10.1145\/331524.331529"},{"key":"101_CR20","first-page":"75","volume-title":"PODC","author":"P. Jayanti","year":"2008","unstructured":"Jayanti P., Toueg S.: Every problem has a weakest failure detector. In: Rida, A.B., Patt-Shamir, B. (eds) PODC, pp. 75\u201384. ACM, New York (2008)"},{"key":"101_CR21","doi-asserted-by":"crossref","unstructured":"Lo, W.-K., Hadzilacos, V.: Using failure detectors to solve consensus in asynchronous shared-memory systems. In: Proceedings of the 8th International Workshop on Distributed Algorithms (WDAG), vol. 857 of LNCS, pp. 280\u2013295, Terschelling, 29 September\u20131 October. Springer (1994)","DOI":"10.1007\/BFb0020440"},{"key":"101_CR22","unstructured":"Raynal, M.: k-Anti-omega failure detector. Rump session at PODC 2007 (2007)"},{"key":"101_CR23","doi-asserted-by":"crossref","unstructured":"Raynal, M., Travers, C.: In search of the holy grail: Looking for the weakest failure detector for wait-free set agreement. In: Proceedings of the 10th International Conference on Principles of Distributed Systems (OPODIS), vol. 4305 of LNCS, pp. 3\u201319, Bordeaux. Springer (2006, December)","DOI":"10.1007\/11945529_2"},{"key":"101_CR24","doi-asserted-by":"crossref","unstructured":"Sak, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: the topology of public knowledge. SICOMP: SIAM J. Comput. 29 (2000)","DOI":"10.1137\/S0097539796307698"},{"key":"101_CR25","doi-asserted-by":"crossref","unstructured":"Zieli\u0144ski, P.: Automatic classification of eventual failure detectors. In: Proceedings of the 21st International Symposium on Distributed Computing (DISC), Lemesos (2007, September)","DOI":"10.1007\/978-3-540-75142-7_35"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-010-0101-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-010-0101-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-010-0101-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T23:40:37Z","timestamp":1740008437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-010-0101-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,14]]},"references-count":25,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["101"],"URL":"https:\/\/doi.org\/10.1007\/s00446-010-0101-9","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2010,4,14]]}}}