{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T13:32:12Z","timestamp":1790775132480,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642258725","type":"print"},{"value":"9783642258732","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25873-2_21","type":"book-chapter","created":{"date-parts":[[2011,12,8]],"date-time":"2011-12-08T15:16:34Z","timestamp":1323357394000},"page":"299-312","source":"Crossref","is-referenced-by-count":8,"title":["Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems"],"prefix":"10.1007","author":[{"given":"Martin","family":"Biely","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Robinson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ulrich","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"21_CR1","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.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"Journal of the ACM"},{"key":"21_CR2","first-page":"91","volume-title":"STOC 1993: Proceedings of the ACM Symposium on Theory of Computing","author":"E. Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: STOC 1993: Proceedings of the ACM Symposium on Theory of Computing, pp. 91\u2013100. ACM, New York (1993)"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/167088.167125","volume-title":"STOC 1993: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing","author":"M. Herlihy","year":"1993","unstructured":"Herlihy, M., Shavit, N.: The asynchronous computability theorem for t-resilient tasks. In: STOC 1993: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 111\u2013120. ACM, New York (1993)"},{"issue":"5","key":"21_CR4","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M. Saks","year":"2000","unstructured":"Saks, M., 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":"21_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00446-003-0091-y","volume":"16","author":"F. Fich","year":"2003","unstructured":"Fich, F., Ruppert, E.: Hundreds of impossibility results for distributed computing. Distributed Computing\u00a016, 121\u2013163 (2003)","journal-title":"Distributed Computing"},{"key":"21_CR6","series-title":"LNCS","first-page":"285","volume-title":"OPODIS 2010","author":"M. Biely","year":"2009","unstructured":"Biely, M., Robinson, P., Schmid, U.: Weak synchrony models and failure detectors for message passing k-set agreement. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2010. LNCS, vol.\u00a05923, pp. 285\u2013299. Springer, Heidelberg (2009)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-17653-1_16","volume-title":"Principles of Distributed Systems","author":"Z. Bouzid","year":"2010","unstructured":"Bouzid, Z., Travers, C.: (anti\u2009\u2212\u03a9 x \u00d7\u03a3 z )-Based k-Set Agreement Algorithms. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol.\u00a06490, pp. 189\u2013204. Springer, Heidelberg (2010)"},{"issue":"33","key":"21_CR8","doi-asserted-by":"publisher","first-page":"4273","DOI":"10.1016\/j.tcs.2010.11.007","volume":"412","author":"F. Bonnet","year":"2011","unstructured":"Bonnet, F., Raynal, M.: On the road to the weakest failure detector for k-set agreement in message-passing systems. Theoretical Computer Science\u00a0412(33), 4273\u20134284 (2011)","journal-title":"Theoretical Computer Science"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-642-15763-9_40","volume-title":"Distributed Computing","author":"D. Alistarh","year":"2010","unstructured":"Alistarh, D., Gilbert, S., Guerraoui, R., Travers, C.: Brief Announcement: New Bounds for Partially Synchronous Set Agreement. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 404\u2013405. Springer, Heidelberg (2010)"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed consensus. Journal of the ACM\u00a034(1), 77\u201397 (1987)","journal-title":"Journal of the ACM"},{"key":"#cr-split#-21_CR11.1","doi-asserted-by":"crossref","unstructured":"1. Charron-Bost, B., Schiper, A.: Uniform consensus is harder than consensus. J. Algorithms 51(1), 15-37 (2004)","DOI":"10.1016\/j.jalgor.2003.11.001"},{"key":"#cr-split#-21_CR11.2","doi-asserted-by":"crossref","unstructured":"2. Also published as Tech. Rep. DSC\/2000\/028, EPFL","DOI":"10.1088\/1126-6708\/2000\/02\/028"},{"key":"21_CR12","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann (1996)"},{"issue":"2","key":"21_CR13","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":"21_CR14","doi-asserted-by":"crossref","unstructured":"Biely, M., Robinson, P., Schmid, U.: Easy impossibility proofs for k-set agreement in message passing systems. Research Report 2\/2011, Technische Universit\u00e4t Wien, Institut f\u00fcr Technische Informatik (2011)","DOI":"10.1007\/978-3-642-25873-2_21"},{"key":"21_CR15","unstructured":"Raynal, M.: Failure detectors to solve asynchronous k-set agreement: a glimpse of recent results. Bulletin of the EACTS (103), 74\u201395 (2011)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R.: Tight failure detection bounds on atomic object implementations. J. ACM\u00a057, 22:1\u201322:32 (2010)","DOI":"10.1145\/1734213.1734216"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/224964.224976","volume-title":"Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1995","author":"G. Neiger","year":"1995","unstructured":"Neiger, G.: Failure detectors and the wait-free hierarchy (extended abstract). In: Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1995, pp. 100\u2013109. ACM, New York (1995)"}],"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-25873-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T15:53:04Z","timestamp":1561045984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25873-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258725","9783642258732"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25873-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}