{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:40:46Z","timestamp":1782970846724,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3743642.3743652","type":"proceedings-article","created":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T09:05:16Z","timestamp":1751533516000},"page":"16-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Invited paper: Full Anonymity in Read\/Write and Read\/Modify\/Write Distributed Computing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3355-8719","authenticated-orcid":false,"given":"Michel","family":"Raynal","sequence":"first","affiliation":[{"name":"Univ Rennes (IRISA, CNRS, Inria), Rennes, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3070-5370","authenticated-orcid":false,"given":"Gadi","family":"Taubenfeld","sequence":"additional","affiliation":[{"name":"Reichman University, Herliya, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,7,3]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"82","volume-title":"Proc. 12th Symposium on Theory of Computing (STOC'80)","author":"Angluin D.","year":"1980","unstructured":"Angluin D., Local and global properties in networks of processes. Proc. 12th Symposium on Theory of Computing (STOC'80), ACM Press, pp. 82--93, (1980)"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2015.05.007"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3119"},{"key":"e_1_3_2_1_4_1","volume-title":"The price of anonymity: optimal consensus despite asynchrony, crash and anonymity. ACM Transactions on Autonomous and Adaptive Systems (TAAS), 6(4):Article 23, 28","author":"Bonnet F.","year":"2011","unstructured":"Bonnet F. and Raynal M., The price of anonymity: optimal consensus despite asynchrony, crash and anonymity. ACM Transactions on Autonomous and Adaptive Systems (TAAS), 6(4):Article 23, 28 pages (2011)"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-012-0169-5"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-017-0301-7"},{"key":"e_1_3_2_1_7_1","unstructured":"Buhr P.A. and Golab W. Private email exchanges (2021)"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-20002-1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.07.027"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405727"},{"key":"e_1_3_2_1_11_1","first-page":"174","article-title":"Election in fully anonymous shared memory systems: tight space bounds and algorithms. Proc. 29th Int'l Colloquium on Structural Information and Communication Complexity (SIROCCO'22)","volume":"13298","author":"Imbs D.","year":"2022","unstructured":"Imbs D., Raynal M. and Taubenfeld G., Election in fully anonymous shared memory systems: tight space bounds and algorithms. Proc. 29th Int'l Colloquium on Structural Information and Communication Complexity (SIROCCO'22), Springer LNCS 13298, pp. 174--190 (2022)","journal-title":"Springer LNCS"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0042-0"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288965"},{"key":"e_1_3_2_1_14_1","first-page":"44","article-title":"a personal view. Proc. 30th Int'l Colloquium on Structural Information and Communication Complexity (SIROCCO'23)","volume":"13892","author":"Raynal M.","year":"2023","unstructured":"Raynal M., About informatics, distributed Computing, and our Job: a personal view. Proc. 30th Int'l Colloquium on Structural Information and Communication Complexity (SIROCCO'23), Springer LNCS 13892, pp. 44--56 (2023)","journal-title":"Springer LNCS"},{"key":"e_1_3_2_1_15_1","volume-title":"Mutual exclusion vs consensus: both sides of the same coin? Bulletin of the European Association of Theoretical Computer Science (EATCS)","author":"Raynal M.","year":"2023","unstructured":"Raynal M., Mutual exclusion vs consensus: both sides of the same coin? Bulletin of the European Association of Theoretical Computer Science (EATCS), Vol.140, 14 pages (2023)"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05529-5_9"},{"key":"e_1_3_2_1_17_1","article-title":"Mutual exclusion in fully anonymous shared memory systems","volume":"158","author":"Raynal M.","unstructured":"Raynal M. and Taubenfeld G., Mutual exclusion in fully anonymous shared memory systems. Information Processing Letters, Vol. 158, 7 pages (2020)","journal-title":"Information Processing Letters"},{"key":"e_1_3_2_1_18_1","article-title":"Corrigendum to \"Mutual exclusion in fully anonymous shared memory systems","volume":"158","author":"Raynal M.","unstructured":"Raynal M. and Taubenfeld G., Corrigendum to \"Mutual exclusion in fully anonymous shared memory systems\". Information Processing Letters, Vol. 158, 7 pages (2020) Corrigendum in Information Processing Letters Vol. 179, 4 pages (2023)","journal-title":"Information Processing Letters"},{"key":"e_1_3_2_1_19_1","first-page":"314","volume-title":"Proc. 8th Int'l Conference on Networked Systems (NETYS'20)","author":"Raynal M.","year":"2020","unstructured":"Raynal M. and Taubenfeld G., Fully anonymous consensus and set agreement algorithms. Proc. 8th Int'l Conference on Networked Systems (NETYS'20), Springer LNCS 12129, pp. 314--328 (2020)"},{"key":"e_1_3_2_1_20_1","volume-title":"Symmetry and anonymity in shared memory concurrent systems","author":"Raynal M.","year":"2022","unstructured":"Raynal M. and Taubenfeld G., Symmetry and anonymity in shared memory concurrent systems. Electronic Bulletin of EATCS (European Association of Theoretical Computer Science), Vol.136, 17 pages (February 2022)"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/72981.72993"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087807"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3529752"},{"key":"e_1_3_2_1_24_1","first-page":"1","volume-title":"Proc. 37th Symposium on Distributed Computing (DISC 2023","volume":"281","author":"Taubenfeld G.","year":"2023","unstructured":"Taubenfeld G., Memory-anonymous starvation free mutual exclusion: possibility and impossibility results. Proc. 37th Symposium on Distributed Computing (DISC 2023), LIPIcs, Vol. 281, pages 33:1--33:17 (2023)"}],"event":{"name":"PODC '25: ACM Symposium on Principles of Distributed Computing","location":"Huatulco Mexico","acronym":"PODC '25","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the Advanced tools programming languages and PLatforms for Implementing and Evaluating algorithms for Distributed systems on ZZZ"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3743642.3743652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T12:46:16Z","timestamp":1756212376000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3743642.3743652"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,16]]},"references-count":24,"alternative-id":["10.1145\/3743642.3743652","10.1145\/3743642"],"URL":"https:\/\/doi.org\/10.1145\/3743642.3743652","relation":{},"subject":[],"published":{"date-parts":[[2025,6,16]]},"assertion":[{"value":"2025-07-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}