{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T19:59:02Z","timestamp":1725998342252},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030013240"},{"type":"electronic","value":"9783030013257"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-01325-7_18","type":"book-chapter","created":{"date-parts":[[2018,10,30]],"date-time":"2018-10-30T13:43:05Z","timestamp":1540906985000},"page":"178-192","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Characterization of t-Resilient Colorless Task Anonymous Solvability"],"prefix":"10.1007","author":[{"given":"Carole","family":"Delporte-Gallet","sequence":"first","affiliation":[]},{"given":"Hugues","family":"Fauconnier","sequence":"additional","affiliation":[]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[]},{"given":"Nayuta","family":"Yanagisawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,31]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: 12th Annual ACM Symposium on Theory of Computing (STOC), pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/11780823_2","volume-title":"Structural Information and Communication Complexity","author":"H Attiya","year":"2006","unstructured":"Attiya, H.: Adapting to point contention with long-lived safe agreement. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 10\u201323. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11780823_2"},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","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."},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-15277-1_50","volume-title":"Euro-Par 2010 - Parallel Processing","author":"R Baldoni","year":"2010","unstructured":"Baldoni, R., Bonomi, S., Raynal, M.: Value-based sequential consistency for set objects in dynamic distributed systems. In: D\u2019Ambra, P., Guarracino, M., Talia, D. (eds.) Euro-Par 2010. LNCS, vol. 6271, pp. 523\u2013534. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15277-1_50"},{"issue":"5","key":"18_CR5","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.jcss.2015.11.002","volume":"82","author":"R Baldoni","year":"2016","unstructured":"Baldoni, R., Bonomi, S., Raynal, M.: Implementing set objects in dynamic distributed systems. J. Comput. Syst. Sci. 82(5), 654\u2013689 (2016)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"18_CR6","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., Rajsbaum, S.: The BG distributed simulation algorithm. Distrib. Comput. 14(3), 127\u2013146 (2001)","journal-title":"Distrib. Comput."},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-662-53426-7_13","volume-title":"Distributed Computing","author":"Z Bouzid","year":"2016","unstructured":"Bouzid, Z., Travers, C.: Anonymity-preserving failure detectors. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 173\u2013186. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_13"},{"issue":"6","key":"18_CR8","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s00446-017-0297-z","volume":"30","author":"C Capdevielle","year":"2017","unstructured":"Capdevielle, C., Johnen, C., Kuznetsov, P., Milani, A.: On the uncontended complexity of anonymous agreement. Distrib. Comput. 30(6), 459\u2013468 (2017)","journal-title":"Distrib. Comput."},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.cosrev.2011.04.001","volume":"5","author":"A Casta\u00f1eda","year":"2011","unstructured":"Casta\u00f1eda, A., Rajsbaum, S., Raynal, M.: The renaming problem in shared memory systems: an introduction. Comput. Sci. Rev. 5(3), 229\u2013251 (2011)","journal-title":"Comput. Sci. Rev."},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1137\/130936828","volume":"45","author":"A Casta\u00f1eda","year":"2016","unstructured":"Casta\u00f1eda, A., Imbs, D., Rajsbaum, S., Raynal, M.: Generalized symmetry breaking tasks and nondeterminism in concurrent objects. SIAM J. Comput. 45(2), 379\u2013414 (2016)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"18_CR11","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. Inf. Comput. 105(1), 132\u2013158 (1993)","journal-title":"Inf. Comput."},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-540-92295-7_31","volume-title":"Distributed Computing and Networking","author":"C Delporte-Gallet","year":"2008","unstructured":"Delporte-Gallet, C., Fauconnier, H.: Two consensus algorithms with atomic registers and failure detector $$\\Omega $$. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds.) ICDCN 2009. LNCS, vol. 5408, pp. 251\u2013262. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92295-7_31"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.tcs.2014.10.013","volume":"561","author":"Carole Delporte-Gallet","year":"2015","unstructured":"Delporte-Gallet, C., Fauconnier, H., Gafni, E., Rajsbaum, S.: Linear space bootstrap communication schemes. Theor. Comput. Sci. 561(Pt. B), 122\u2013133 (2015). Special Issue on Distributed Computing and Networking","journal-title":"Theoretical Computer Science"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Rajsbaum, S., Yanagisawa, N.: An anonymous wait-free weak-set object implementation. In: 6th International Conference on Networked Systems (NETYS). LNCS (2018, to appear)","DOI":"10.1007\/978-3-030-05529-5_10"},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","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","key":"18_CR16","doi-asserted-by":"publisher","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":"18_CR17","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 J. Comput. 28(3), 970\u2013983 (1999)","journal-title":"SIAM J. Comput."},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-662-48653-5_30","volume-title":"Distributed Computing","author":"R Gelashvili","year":"2015","unstructured":"Gelashvili, R.: On the optimal space complexity of consensus for anonymous processes. In: Moses, Y. (ed.) DISC 2015. LNCS, vol. 9363, pp. 452\u2013466. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48653-5_30"},{"issue":"3","key":"18_CR19","doi-asserted-by":"publisher","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":"18_CR20","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Kozlov, D., Rajsbaum, S.: Distributed Computing Through Combinatorial Topology. Morgan Kaufmann, San Francisco (2013)","DOI":"10.1016\/B978-0-12-404578-1.00003-6"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: The decidability of distributed decision tasks (extended abstract). In: 29th Annual ACM Symposium on Theory of Computing (STOC), pp. 589\u2013598 (1997)","DOI":"10.1145\/258533.258652"},{"issue":"1","key":"18_CR22","doi-asserted-by":"publisher","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":"18_CR23","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: The topology of shared-memory adversaries. In: 29th ACM Symposium on Principles of Distributed Computing (PODC), pp. 105\u2013113 (2010)","DOI":"10.1145\/1835698.1835724"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: Simulations and reductions for colorless tasks. In: 31st ACM Symposium on Principles of Distributed Computing, PODC 2012, pp. 253\u2013260. ACM, New York (2012)","DOI":"10.1145\/2332432.2332483"},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.04.007","volume":"683","author":"M Herlihy","year":"2017","unstructured":"Herlihy, M., Rajsbaum, S., Raynal, M., Stainer, J.: From wait-free to arbitrary concurrent solo executions in colorless distributed computing. Theor. Comput. Sci. 683, 1\u201321 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"18_CR26","doi-asserted-by":"publisher","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":"18_CR27","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann, San Francisco (2008)"},{"issue":"3","key":"18_CR28","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"18_CR29","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-54099-7_19","volume-title":"Distributed Algorithms","author":"Prasad Jayanti","year":"1991","unstructured":"Jayanti, P., Toueg, S.: Wakeup under read\/write atomicity. In: 4th International Workshop on Distributed Algorithms, pp. 277\u2013288 (1991)"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Rajsbaum, S., Casta\u00f1eda, A., Flores-Pe\u00f1aloza, D., Alcantara, M.: Fault-tolerant robot gathering problems on graphs with arbitrary appearing times. In: 31st IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 493\u2013502, May 2017","DOI":"10.1109\/IPDPS.2017.70"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Yanagisawa, N.: Wait-free solvability of colorless tasks in anonymous shared-memory model. In: Theory of Computing Systems, pp. 1\u201318 (2017)","DOI":"10.1007\/s00224-017-9819-0"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01325-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,29]],"date-time":"2019-10-29T18:29:17Z","timestamp":1572373757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01325-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030013240","9783030013257"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01325-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ma'ale HaHamisha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/sirocco2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"49% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"1.97","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}