{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:38:16Z","timestamp":1725619096056},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642245497"},{"type":"electronic","value":"9783642245503"}],"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-24550-3_10","type":"book-chapter","created":{"date-parts":[[2011,10,8]],"date-time":"2011-10-08T02:56:37Z","timestamp":1318042597000},"page":"108-119","source":"Crossref","is-referenced-by-count":2,"title":["A Non-topological Proof for the Impossibility of k-Set Agreement"],"prefix":"10.1007","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[]},{"given":"Armando","family":"Casta\u00f1eda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1137\/S0097539797330689","volume":"31","author":"H. Attiya","year":"2002","unstructured":"Attiya, H., Rajsbaum, S.: The Combinatorial Structure of Wait-Free Solvable Tasks. SIAM Journal on Computing\u00a031(4), 1286\u20131313 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR2","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H. Attiya","year":"1998","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, New York (1998)"},{"key":"10_CR3","first-page":"91","volume-title":"Proc. 25th ACM Symposium on Theory of Computing (STOC 1993)","author":"E. Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP Impossibility Result for t-Resilient Asynchronous Computations. In: Proc. 25th ACM Symposium on Theory of Computing (STOC 1993), pp. 91\u2013100. ACM Press, New York (1993)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Immediate Atomic Snapshots and Fast Renaming. In: Proc. 12th ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 41-51 (1993)","DOI":"10.1145\/164051.164056"},{"key":"10_CR5","first-page":"295","volume-title":"Proc. 27th ACM Symposium on Principles of Distributed Computing (PODC 2008)","author":"A. Casta\u00f1eda","year":"2008","unstructured":"Casta\u00f1eda, A., Rajsbaum, S.: New Combinatorial Topology Upper and Lower Bounds for Renaming. In: Proc. 27th ACM Symposium on Principles of Distributed Computing (PODC 2008), pp. 295\u2013304. ACM Press, New York (2008)"},{"issue":"1","key":"10_CR6","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"},{"issue":"2","key":"10_CR7","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"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","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 Journal on Computing\u00a028(3), 970\u2013983 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11864219_23","volume-title":"Distributed Computing","author":"E. Gafni","year":"2006","unstructured":"Gafni, E., Rajsbaum, S., Herlihy, M.P.: Subconsensus Tasks: Renaming is Weaker Than Set Agreement. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 329\u2013338. Springer, Heidelberg (2006)"},{"key":"10_CR10","volume-title":"A Combinatorial Introduction to Topology","author":"M. Henle","year":"1994","unstructured":"Henle, M.: A Combinatorial Introduction to Topology. Dover, New York (1994)"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. Transactions on Programming Languages and Systems\u00a013(1), 124\u2013149 (1991)","journal-title":"Transactions on Programming Languages and Systems"},{"key":"10_CR12","first-page":"324","volume-title":"Proc. 13th Annual ACM Symposium on Principles on Distributed Computing (PODC 1994)","author":"M.P. Herlihy","year":"1994","unstructured":"Herlihy, M.P., Rajsbaum, S.: Set Consensus Using Arbitrary Objects (Preliminary Version). In: Proc. 13th Annual ACM Symposium on Principles on Distributed Computing (PODC 1994), pp. 324\u2013333. ACM Press, New York (1994)"},{"issue":"4","key":"10_CR13","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1017\/S0960129500003170","volume":"10","author":"M.P. Herlihy","year":"2000","unstructured":"Herlihy, M.P., Rajsbaum, S.: Algebraic Spans. Mathematical Structures in Computer Science\u00a010(4), 549\u2013573 (2000)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0304-3975(01)00396-6","volume":"291","author":"M.P. Herlihy","year":"2003","unstructured":"Herlihy, M.P., Rajsbaum, S.: A Classification of Wait-free Loop Agreement Tasks. Theoretical Computer Science\u00a0291(1), 55\u201377 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"10_CR15","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M.P. Herlihy","year":"1999","unstructured":"Herlihy, M.P., Shavit, N.: The Topological Structure of Asynchronous Computability. Journal of the ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"Journal of the ACM"},{"issue":"2","key":"10_CR16","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1137\/S0097539701397412","volume":"36","author":"G. Hoest","year":"2006","unstructured":"Hoest, G., Shavit, N.: Toward a Topological Characterization of Asynchronous Complexity. SIAM Journal on Computing\u00a036(2), 457\u2013497 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR17","first-page":"163","volume-title":"Advances in Computing Research","author":"M. Loui","year":"1987","unstructured":"Loui, M., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. In: Preparata, F.P. (ed.) Advances in Computing Research, vol.\u00a04, pp. 163\u2013183. JAI Press, Greenwich (1987)"},{"issue":"5","key":"10_CR18","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 Journal on Computing\u00a029(5), 1449\u20131483 (2000)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24550-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T06:39:32Z","timestamp":1554878372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24550-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642245497","9783642245503"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24550-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}