{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:13:49Z","timestamp":1742969629040,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642043543"},{"type":"electronic","value":"9783642043550"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04355-0_8","type":"book-chapter","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T02:44:15Z","timestamp":1253673855000},"page":"35-47","source":"Crossref","is-referenced-by-count":3,"title":["On Set Consensus Numbers"],"prefix":"10.1007","author":[{"given":"Eli","family":"Gafni","sequence":"first","affiliation":[]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","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":"8_CR2","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":"8_CR3","first-page":"101","volume-title":"STOC","author":"M. Saks","year":"1993","unstructured":"Saks, M., Zaharoglou, F.: Wait-free k-set agreement is impossible: The topology of public knowledge. In: STOC, pp. 101\u2013110. ACM Press, New York (1993)"},{"key":"8_CR4","first-page":"91","volume-title":"STOC","author":"E. Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: STOC, pp. 91\u2013100. ACM Press, New York (1993)"},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","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. Distributed Computing\u00a014(3), 127\u2013146 (2001)","journal-title":"Distributed Computing"},{"issue":"2","key":"8_CR6","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"},{"issue":"4","key":"8_CR7","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"},{"key":"8_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":"8_CR9","doi-asserted-by":"crossref","unstructured":"Gafni, E., Kuznetsov, P.: The weakest failure detector for solving k-set agreement. In: PODC (2009), http:\/\/www.net.t-labs.tu-berlin.de\/~petr\/pubs\/wfd-kset.pdf","DOI":"10.1145\/1582716.1582735"},{"key":"8_CR10","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":"8_CR11","doi-asserted-by":"crossref","unstructured":"Gafni, E., Guerraoui, R.: Simulating few by many: Limited concurrency=set consensus. Unpublished manuscript (2009), http:\/\/www.cs.ucla.edu\/~eli\/eli\/kconc.pdf","DOI":"10.1007\/978-3-642-04355-0_8"},{"key":"8_CR12","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. Zieli\u0144ski","year":"2007","unstructured":"Zieli\u0144ski, P.: Automatic classification of eventual failure detectors. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 465\u2013479. Springer, Heidelberg (2007)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Zieli\u0144ski, P.: Anti-omega: the weakest failure detector for set agreement. In: PODC (2008)","DOI":"10.1145\/1400751.1400761"},{"key":"8_CR14","unstructured":"Gafni, E.: The extended BG-Simulation. In: STOC (2009), http:\/\/www.cs.ucla.edu\/~eli\/eli\/230-gafni1.pdf"},{"key":"8_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":"5","key":"8_CR16","doi-asserted-by":"publisher","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. Distributed Computing\u00a020(5), 343\u2013358 (2008)","journal-title":"Distributed Computing"},{"key":"8_CR17","unstructured":"Anta, A.F., Rajsbaum, S., Travers, C.: Weakest failure detectors via an egg-laying simulation (brief announcement). In: PODC (2009)"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"123","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\u00a013, 123\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/11561927_15","volume-title":"Distributed Computing","author":"C. Delporte-Gallet","year":"2005","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: (Almost) all objects are universal in message passing systems. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 184\u2013198. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04355-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T21:36:00Z","timestamp":1685136960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04355-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043543","9783642043550"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04355-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}