{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:54:12Z","timestamp":1740099252591,"version":"3.37.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030055288"},{"type":"electronic","value":"9783030055295"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-05529-5_10","type":"book-chapter","created":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T21:54:08Z","timestamp":1546638848000},"page":"141-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Anonymous Wait-Free Weak-Set Object Implementation"],"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":[[2019,1,5]]},"reference":[{"issue":"4","key":"10_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"},{"issue":"3","key":"10_CR2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s00446-005-0145-4","volume":"18","author":"J Aspnes","year":"2006","unstructured":"Aspnes, J., Fich, F.E., Ruppert, E.: Relationships between broadcast and shared memory in reliable anonymous distributed systems. Distrib. Comput. 18(3), 209\u2013219 (2006)","journal-title":"Distrib. Comput."},{"issue":"2","key":"10_CR3","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H Attiya","year":"1995","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message passing systems. J. ACM 42(2), 124\u2013142 (1995)","journal-title":"J. ACM"},{"issue":"2","key":"10_CR4","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":"5","key":"10_CR5","doi-asserted-by":"crossref","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":"10_CR6","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/0196-6774(90)90020-F","volume":"11","author":"O Biran","year":"1990","unstructured":"Biran, O., Moran, S., Zaks, S.: A combinatorial characterization of the distributed 1-solvable tasks. J. Algorithms 11(3), 420\u2013440 (1990)","journal-title":"J. Algorithms"},{"issue":"3","key":"10_CR7","doi-asserted-by":"crossref","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":"10_CR8","unstructured":"Bouzid, Z., Raynal, M., Sutra, P.: Anonymous obstruction-free (n, k)-set agreement with n-k+1 atomic read\/write registers. In: 19th International Conference on Principles of Distributed Systems, OPODIS 2015, Rennes, France, 14\u201317 December 2015, pp. 18:1\u201318:17 (2015)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-662-48653-5_28","volume-title":"Distributed Computing","author":"A Casta\u00f1eda","year":"2015","unstructured":"Casta\u00f1eda, A., Rajsbaum, S., Raynal, M.: Specifying concurrent problems: beyond linearizability and up to tasks. In: Moses, Y. (ed.) DISC 2015. LNCS, vol. 9363, pp. 420\u2013435. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-48653-5_28"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-319-59647-1_32","volume-title":"Networked Systems","author":"A Casta\u00f1eda","year":"2017","unstructured":"Casta\u00f1eda, A., Rajsbaum, S., Raynal, M.: Long-lived tasks. In: El Abbadi, A., Garbinato, B. (eds.) NETYS 2017. LNCS, vol. 10299, pp. 439\u2013454. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-59647-1_32"},{"issue":"1","key":"10_CR11","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":"10_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 $$\\varOmega $$. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds.) ICDCN 2009. LNCS, vol. 5408, pp. 251\u2013262. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-92295-7_31"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-642-41527-2_19","volume-title":"Distributed Computing","author":"C Delporte-Gallet","year":"2013","unstructured":"Delporte-Gallet, C., Fauconnier, H., Gafni, E., Lamport, L.: Adaptive register allocation with a linear number of registers. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 269\u2013283. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-41527-2_19"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-40148-0_3","volume-title":"Networked Systems","author":"C Delporte-Gallet","year":"2013","unstructured":"Delporte-Gallet, C., Fauconnier, H., Gafni, E., Rajsbaum, S.: Black art: obstruction-free k-set agreement with $$|$$MWMR registers$$|\\ < \\ |$$proccesses$$|$$. In: Gramoli, V., Guerraoui, R. (eds.) NETYS 2013. LNCS, vol. 7853, pp. 28\u201341. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40148-0_3"},{"issue":"Part B","key":"10_CR15","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.tcs.2014.10.013","volume":"561","author":"C Delporte-Gallet","year":"2015","unstructured":"Delporte-Gallet, C., Fauconnier, H., Gafni, E., Rajsbaum, S.: Linear space bootstrap communication schemes. Theor. Comput. Sci. 561(Part B), 122\u2013133 (2015). Special Issue on Distributed Computing and Networking","journal-title":"Theor. Comput. Sci."},{"key":"10_CR16","unstructured":"Delporte-Gallet, C., Fauconnier, H., Rajsbaum, S., Yanagisawa, N.: A characterization of colorless anonymous t-resilient task computability. Technical report, Kyoto University. \narXiv:1712.04393v1\n\n, December 2017"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Tielmann, A.: Fault-tolerant consensus in unknown and anonymous networks. In: 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), Montreal, Qu\u00e9bec, Canada, 22\u201326 June 2009, pp. 368\u2013375. IEEE Computer Society (2009)","DOI":"10.1109\/ICDCS.2009.36"},{"issue":"2","key":"10_CR18","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."},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-540-30577-4_3","volume-title":"SOFSEM 2005: Theory and Practice of Computer Science","author":"FE Fich","year":"2005","unstructured":"Fich, F.E.: How hard is it to take a snapshot? In: Vojt\u00e1\u0161, P., Bielikov\u00e1, M., Charron-Bost, B., S\u00fdkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 28\u201337. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/978-3-540-30577-4_3"},{"issue":"3","key":"10_CR20","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."},{"issue":"1","key":"10_CR21","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"3","key":"10_CR22","doi-asserted-by":"crossref","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."},{"issue":"1","key":"10_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jpdc.2011.08.005","volume":"72","author":"D Imbs","year":"2012","unstructured":"Imbs, D., Raynal, M.: Help when needed, but no more: efficient read\/write partial snapshot. J. Parallel Distrib. Comput. 72(1), 1\u201312 (2012)","journal-title":"J. Parallel Distrib. Comput."},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/BFb0020429","volume-title":"Distributed Algorithms","author":"M Inoue","year":"1994","unstructured":"Inoue, M., Masuzawa, T., Chen, W., Tokura, N.: Linear-time snapshot using multi-writer multi-reader registers. In: Tel, G., Vit\u00e1nyi, P. (eds.) WDAG 1994. LNCS, vol. 857, pp. 130\u2013140. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/BFb0020429"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Johnson, R.E., Schneider, F.B.: Symmetry and similarity in distributed systems. In: Malcolm, M.A., Strong, H.R. (eds.) Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, Minaki, Ontario, Canada, 5\u20137 August 1985, pp. 13\u201322. ACM (1985)","DOI":"10.1145\/323596.323598"},{"key":"10_CR26","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","volume":"2","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication-part i: basic formalism, part ii: algorithms. Distrib. Comput. 2, 77\u2013101 (1986)","journal-title":"Distrib. Comput."},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"Yanagisawa, N.: Wait-free solvability of colorless tasks in anonymous shared-memory model. Theory Comput. Syst. 1\u201318 (2017). \nhttps:\/\/doi.org\/10.1007\/s00224-017-9819-0","DOI":"10.1007\/s00224-017-9819-0"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05529-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T21:59:03Z","timestamp":1546639143000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05529-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030055288","9783030055295"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05529-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Essaouira","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","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":"9 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/history\/netys2018\/","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":"85","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"26% - 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":"2.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6.3","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"}}]}}