{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:17:56Z","timestamp":1725869876953},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319492582"},{"type":"electronic","value":"9783319492599"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-49259-9_32","type":"book-chapter","created":{"date-parts":[[2016,11,2]],"date-time":"2016-11-02T01:11:34Z","timestamp":1478049094000},"page":"415-429","source":"Crossref","is-referenced-by-count":3,"title":["Wait-Free Solvability of Colorless Tasks in Anonymous Shared-Memory Model"],"prefix":"10.1007","author":[{"given":"Nayuta","family":"Yanagisawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,3]]},"reference":[{"issue":"4","key":"32_CR1","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40(4), 873\u2013890 (1993)","journal-title":"J. ACM"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: Proceedings of 12th ACM Symposium on Theory of Computing, pp. 82\u201393. ACM, New York (1980)","DOI":"10.1145\/800141.804655"},{"issue":"4","key":"32_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235\u2013253 (2006)","journal-title":"Distrib. Comput."},{"issue":"3","key":"32_CR4","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H Attiya","year":"1990","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. J. ACM 37(3), 524\u2013548 (1990)","journal-title":"J. ACM"},{"issue":"2","key":"32_CR5","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1006\/inco.2001.3119","volume":"173","author":"H Attiya","year":"2002","unstructured":"Attiya, H., Gorbach, A., Moran, S.: Computing in totally anonymous asynchronous shared memory systems. Inf. Comput. 173(2), 162\u2013183 (2002)","journal-title":"Inf. Comput."},{"issue":"1","key":"32_CR6","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."},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1007\/11596042_77","volume-title":"Embedded and Ubiquitous Computing \u2013 EUC 2005 Workshops","author":"T Chothia","year":"2005","unstructured":"Chothia, T., Chatzikokolakis, K.: A survey of anonymous peer-to-peer file-sharing. In: Enokido, T., Yan, L., Xiao, B., Kim, D., Dai, Y., Yang, L.T. (eds.) EUC 2005. LNCS, vol. 3823, pp. 744\u2013755. Springer, Heidelberg (2005). doi: 10.1007\/11596042_77"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kermarrec, A.M., Ruppert, E., et al.: Byzantine agreement with homonyms. In: Proceedings of 30th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 21\u201330. ACM, New York (2011)","DOI":"10.1145\/1993806.1993810"},{"issue":"5\u20136","key":"32_CR9","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s00446-013-0190-3","volume":"26","author":"C Delporte-Gallet","year":"2013","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kermarrec, A.M., Ruppert, E., et al.: Byzantine agreement with homonyms. Distrib. Comput. 26(5\u20136), 321\u2013340 (2013)","journal-title":"Distrib. Comput."},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-25959-3_6","volume-title":"Distributed Computing and Networking","author":"C Delporte-Gallet","year":"2012","unstructured":"Delporte-Gallet, C., Fauconnier, H., Tran-The, H.: Byzantine agreement with homonyms in synchronous systems. In: Bononi, L., Datta, A.K., Devismes, S., Misra, A. (eds.) ICDCN 2012. LNCS, vol. 7129, pp. 76\u201390. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-25959-3_6"},{"issue":"3","key":"32_CR11","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. J. ACM 33(3), 499\u2013516 (1986)","journal-title":"J. ACM"},{"issue":"2","key":"32_CR12","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s00446-008-0060-6","volume":"21","author":"F Ellen","year":"2008","unstructured":"Ellen, F., Fatourou, P., Ruppert, E.: The space complexity of unbounded timestamps. Distrib. Comput. 21(2), 103\u2013115 (2008)","journal-title":"Distrib. Comput."},{"issue":"2\u20133","key":"32_CR13","doi-asserted-by":"crossref","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. Distrib. Comput. 16(2\u20133), 121\u2013163 (2003)","journal-title":"Distrib. Comput."},{"issue":"2","key":"32_CR14","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ 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":"32_CR15","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)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"32_CR16","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s00446-007-0042-0","volume":"20","author":"R Guerraoui","year":"2007","unstructured":"Guerraoui, R., Ruppert, E.: Anonymous and fault-tolerant shared-memory computing. Distrib. Comput. 20(3), 165\u2013177 (2007)","journal-title":"Distrib. Comput."},{"key":"32_CR17","volume-title":"Distributed Computing Through Combinatorial Topology","author":"M Herlihy","year":"2013","unstructured":"Herlihy, M., Kozlov, D., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, San Francisco (2013)"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: The decidability of distributed decision tasks. In: Proceedings of Symposium on Theory of Computing, pp. 589\u2013598. ACM, New York (1997)","DOI":"10.1145\/258533.258652"},{"issue":"1","key":"32_CR19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0304-3975(01)00396-6","volume":"291","author":"M Herlihy","year":"2003","unstructured":"Herlihy, M., Rajsbaum, S.: A classification of wait-free loop agreement tasks. Theor. Comput. Sci. 291(1), 55\u201377 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: The topology of shared-memory adversaries. In: Proceedings of 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 105\u2013113. ACM, New York (2010)","DOI":"10.1145\/1835698.1835724"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: Simulations and reductions for colorless tasks. In: Proceedings of 2012 ACM Symposium on Principles of Distributed Computing, pp. 253\u2013260. ACM, New York (2012)","DOI":"10.1145\/2332432.2332483"},{"key":"32_CR22","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.tcs.2013.03.002","volume":"509","author":"M Herlihy","year":"2013","unstructured":"Herlihy, M., Rajsbaum, S., Raynal, M.: Power and limits of distributed computing shared memory models. Theor. Comput. Sci. 509, 3\u201324 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-54423-1_19","volume-title":"LATIN 2014: Theoretical Informatics","author":"M Herlihy","year":"2014","unstructured":"Herlihy, M., Rajsbaum, S., Raynal, M., Stainer, J.: Computing in the presence of concurrent solo executions. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 214\u2013225. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-54423-1_19"},{"issue":"6","key":"32_CR24","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(6), 858\u2013923 (1999)","journal-title":"J. ACM"},{"key":"32_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-54099-7_19","volume-title":"Distributed Algorithms","author":"P Jayanti","year":"1991","unstructured":"Jayanti, P., Toueg, S.: Wakeup under read\/write atomicity. In: Leeuwen, J., Santoro, N. (eds.) WDAG 1990. LNCS, vol. 486, pp. 277\u2013288. Springer, Heidelberg (1991). doi: 10.1007\/3-540-54099-7_19"},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"Junqueira, F.P., Marzullo, K.: Synchronous consensus for dependent process failures. In: Proceedings of 23rd International Conference on Distributed Computing Systems, pp. 274\u2013283. IEEE (2003)","DOI":"10.1109\/ICDCS.2003.1203476"},{"key":"32_CR27","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"key":"32_CR28","doi-asserted-by":"crossref","unstructured":"Mendes, H., Tasson, C., Herlihy, M.: Distributed computability in Byzantine asynchronous systems. In: Proceedings of 46th ACM Symposium on Theory of Computing, pp. 704\u2013713. ACM, New York (2014)","DOI":"10.1145\/2591796.2591853"},{"key":"32_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-77096-1_28","volume-title":"Principles of Distributed Systems","author":"E Ruppert","year":"2007","unstructured":"Ruppert, E.: The anonymous consensus hierarchy and naming problems. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol. 4878, pp. 386\u2013400. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-77096-1_28"},{"key":"32_CR30","volume-title":"Algebraic Topology","author":"E Spanier","year":"1966","unstructured":"Spanier, E.: Algebraic Topology, vol. 55. McGraw-Hill, New York (1966). (reprinted by Springer-Verlag)"}],"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-319-49259-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T06:09:40Z","timestamp":1568527780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49259-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319492582","9783319492599"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49259-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}