{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:21Z","timestamp":1759637541653,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030670863"},{"type":"electronic","value":"9783030670870"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-3-030-67087-0_20","type":"book-chapter","created":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T01:17:39Z","timestamp":1610587059000},"page":"314-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fully Anonymous Consensus and Set Agreement Algorithms"],"prefix":"10.1007","author":[{"given":"Michel","family":"Raynal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gadi","family":"Taubenfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,14]]},"reference":[{"issue":"4","key":"20_CR1","doi-asserted-by":"publisher","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":"20_CR2","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-662-57265-8_45","volume-title":"Proofs from THE BOOK","author":"M Aigner","year":"2018","unstructured":"Aigner, M., Ziegler, G.M.: Probability makes counting (sometimes) easy. Proofs from THE BOOK, p. 274. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-57265-8_45. ISBN 978-3-642-00856-6"},{"issue":"4","key":"20_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02280833","volume":"7","author":"JH Anderson","year":"1994","unstructured":"Anderson, J.H.: Multi-writer composite registers. Distrib. Comput. 7(4), 175\u2013195 (1994)","journal-title":"Distrib. Comput."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Angluin D., Local and global properties in networks of processes. In: Proceedings 12th Symposium on Theory of Computing (STOC\u201980), pp. 82\u201393. ACM Press (1980)","DOI":"10.1145\/800141.804655"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Aghazadeh Z., Imbs D., Raynal M., Taubenfeld G., Woelfel, P.: Optimal memory-anonymous symmetric deadlock-free mutual exclusion. In: Proceedings 38th ACM Symposium on Principles of Distributed Computing (PODC\u201919), p. 10. ACM Press (2019)","DOI":"10.1145\/3293611.3331594"},{"issue":"2","key":"20_CR6","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":"20_CR7","doi-asserted-by":"crossref","unstructured":"Borowsky E. and Gafni E., Generalized FLP impossibility results for $$t$$-resilient asynchronous computations. In: Proceedings 25th ACM Symposium on Theory of Computing (STOC\u201993), pp. 91\u2013100 . ACM Press (1993)","DOI":"10.1145\/167088.167119"},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00446-012-0169-5","volume":"26","author":"F Bonnet","year":"2013","unstructured":"Bonnet, F., Raynal, M.: Anonymous asynchronous systems: the case of failure detectors. Distrib. Comput. 26(3), 141\u2013158 (2013)","journal-title":"Distrib. Comput."},{"issue":"2","key":"20_CR9","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s00446-017-0301-7","volume":"31","author":"Z Bouzid","year":"2018","unstructured":"Bouzid, Z., Raynal, M., Sutra, P.: Anonymous obstruction-free $$(n, k)$$-set agreement with $$(n-k+1)$$ atomic read\/write registers. Distrib. Comput. 31(2), 99\u2013117 (2018)","journal-title":"Distrib. Comput."},{"issue":"1","key":"20_CR10","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."},{"issue":"1","key":"20_CR11","first-page":"1","volume":"13","author":"EW Dijkstra","year":"1980","unstructured":"Dijkstra, E.W.: Some beautiful arguments using mathematical induction. Algorithmica 13(1), 1\u20138 (1980)","journal-title":"Algorithmica"},{"issue":"2","key":"20_CR12","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"},{"key":"20_CR13","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 computations. Distrib. Comput. 20, 165\u2013177 (2007)","journal-title":"Distrib. Comput."},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"MP Herlihy","year":"1991","unstructured":"Herlihy, M.P.: Wait-free synchronization. ACM Trans. Programm. Lang. Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Programm. Lang. Syst."},{"key":"20_CR15","unstructured":"Herlihy M.P., Luchangco V., Moir M.: Obstruction-free synchronization: double-ended queues as an example. In: Proceedings 23th International IEEE Conference on Distributed Computing Systems (ICDCS 2003), pp. 522\u2013529. IEEE Press (2003)"},{"issue":"6","key":"20_CR16","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"MP Herlihy","year":"1999","unstructured":"Herlihy, M.P., Shavit, N.: The topological structure of asynchronous computability. J. ACM 46(6), 858\u2013923 (1999)","journal-title":"J. ACM"},{"key":"20_CR17","first-page":"508","volume-title":"The Art of Multiprocessor Programming","author":"M Herlihy","year":"2008","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming, p. 508. Morgan Kaufmann, Cambridge (2008). ISBN 978-0-12-370591-4"},{"issue":"3","key":"20_CR18","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. Programm. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Programm. Lang. Syst."},{"issue":"2","key":"20_CR19","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication, part I: basic formalism. Distrib. Comput. 1(2), 77\u201385 (1986)","journal-title":"Distrib. Comput."},{"key":"20_CR20","unstructured":"Loui, M., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Adv. Comput. Res. 4, 163\u2013183. JAI Press (1987)"},{"issue":"546","key":"20_CR21","first-page":"1","volume":"7","author":"S Navlakha","year":"2011","unstructured":"Navlakha, S., Bar-Joseph, Z.: Algorithms in nature: the convergence of systems biology and computational thinking. Mol. Syst. Biol. 7(546), 1\u201311 (2011)","journal-title":"Mol. Syst. Biol."},{"issue":"1","key":"20_CR22","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/2678280","volume":"58","author":"S Navlakha","year":"2015","unstructured":"Navlakha, S., Bar-Joseph, Z.: Distributed information processing in biological and computational systems. Communi. ACM 58(1), 94\u2013102 (2015)","journal-title":"Communi. ACM"},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-642-32027-9","volume-title":"Concurrent Programming: Algorithms, Principles and Foundations","author":"M Raynal","year":"2013","unstructured":"Raynal, M.: Concurrent Programming: Algorithms, Principles and Foundations, p. 515. Springer, Dordrecht (2013). https:\/\/doi.org\/10.1007\/978-3-642-32027-9. ISBN 978-3-642-32026-2"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-05529-5_9","volume-title":"Networked Systems","author":"M Raynal","year":"2019","unstructured":"Raynal, M., Cao, J.: Anonymity in distributed read\/write systems: an introductory survey. In: Podelski, A., Ta\u00efani, F. (eds.) NETYS 2018. LNCS, vol. 11028, pp. 122\u2013140. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05529-5_9"},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-030-34992-9_24","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M Raynal","year":"2019","unstructured":"Raynal, M., Taubenfeld, G.: Brief announcement: fully anonymous shared memory algorithms. In: Ghaffari, M., Nesterenko, M., Tixeuil, S., Tucci, S., Yamauchi, Y. (eds.) SSS 2019. LNCS, vol. 11914, pp. 301\u2013306. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34992-9_24"},{"key":"20_CR26","doi-asserted-by":"publisher","first-page":"105938","DOI":"10.1016\/j.ipl.2020.105938","volume":"158","author":"M Raynal","year":"2020","unstructured":"Raynal, M., Taubenfeld, G.: Mutual exclusion in fully anonymous shared memory systems. Inf. Process. Lett. 158, 105938 (2020)","journal-title":"Inf. Process. Lett."},{"key":"20_CR27","unstructured":"Rashid S., Taubenfeld G., Bar-Joseph, Z.: Genome wide epigenetic modifications as a shared memory consensus problem. In: 6th Workshop on Biological Distributed Algorithms (BDA\u201918), London (2018)"},{"issue":"5","key":"20_CR28","doi-asserted-by":"crossref","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. 29(5), 1449\u20131483 (2000)","journal-title":"SIAM J. Comput."},{"key":"20_CR29","first-page":"423","volume-title":"Synchronization algorithms and concurrent programming","author":"G Taubenfeld","year":"2006","unstructured":"Taubenfeld, G.: Synchronization algorithms and concurrent programming, p. 423. Prentice Hall, Pearson Education (2006). ISBN 0-131-97259-6"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Taubenfeld G.: Coordination without prior agreement. In: Proceeding 36th ACM Symposium on Principles of Distributed Computing (PODC 2017), pp. 325\u2013334. ACM Press (2017)","DOI":"10.1145\/3087801.3087807"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-030-24922-9_20","volume-title":"Structural Information and Communication Complexity","author":"G Taubenfeld","year":"2019","unstructured":"Taubenfeld, G.: Set agreement power is not a precise characterization for oblivious deterministic anonymous objects. In: Censor-Hillel, K., Flammini, M. (eds.) SIROCCO 2019. LNCS, vol. 11639, pp. 293\u2013308. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24922-9_20"},{"issue":"1","key":"20_CR32","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/71.481599","volume":"7","author":"M Yamashita","year":"1996","unstructured":"Yamashita, M., Kameda, T.: Computing on anonymous networks: part I -characterizing the solvable cases. IEEE Trans. Parallel Distrib. Syst. 7(1), 69\u201389 (1996)","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67087-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,16]],"date-time":"2021-01-16T09:04:04Z","timestamp":1610787844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-67087-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030670863","9783030670870"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67087-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Marrakech","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - 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 (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"3.75","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually. Three invited papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}