{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T17:43:30Z","timestamp":1782927810033,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Ministry of Education, Singapore","award":["24-1323-A0001"],"award-info":[{"award-number":["24-1323-A0001"]}]},{"name":"French National Research Agency","award":["ANR-25-CE48-4089-01"],"award-info":[{"award-number":["ANR-25-CE48-4089-01"]}]},{"name":"Ministry of University and Research, Italy","award":["PE00000014"],"award-info":[{"award-number":["PE00000014"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,6]]},"DOI":"10.1145\/3796701.3815917","type":"proceedings-article","created":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:40:43Z","timestamp":1782924043000},"page":"224-234","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Counting and Simulation in Content-Oblivious Rings"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2988-8969","authenticated-orcid":false,"given":"J\u00e9r\u00e9mie","family":"Chalopin","sequence":"first","affiliation":[{"name":"CNRS, Aix-Marseille universit\u00e9, Marseille, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0109-2432","authenticated-orcid":false,"given":"Yi-Jun","family":"Chang","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7150-0972","authenticated-orcid":false,"given":"Giuseppe Antonio","family":"Di Luna","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2458-5344","authenticated-orcid":false,"given":"Haoran","family":"Zhou","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0606035"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"D. Angluin. 1980. Local and Global Properties in Networks of Processors (Extended Abstract). In STOC. 82\u201393.","DOI":"10.1145\/800141.804655"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"S. Bitton Y. Emek T. Izumi and S. Kutten. 2019. Message reduction in the LOCAL model is a free lunch. In PODC. 300\u2013302.","DOI":"10.1145\/3293611.3331582"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.02.009"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2018.10.001"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-023-00452-2"},{"key":"e_1_3_2_1_7_1","first-page":"1","article-title":"Brief Announcement","volume":"51","author":"Chalopin J.","year":"2025","unstructured":"J. Chalopin, Y.-J. Chang, L. Chen, G. A. Di Luna, and H. Zhou. 2025. Brief Announcement: Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings. In DISC. 51:1\u201351:7.","journal-title":"Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings. In DISC."},{"key":"e_1_3_2_1_8_1","first-page":"1","article-title":"Content-Oblivious Leader Election in 2-Edge-Connected Networks","volume":"21","author":"Chalopin J.","year":"2025","unstructured":"J. Chalopin, Y.-J. Chang, L. Chen, G. A. Di Luna, and H. Zhou. 2025. Content-Oblivious Leader Election in 2-Edge-Connected Networks. In DISC. 21:1\u201321:22.","journal-title":"DISC."},{"key":"e_1_3_2_1_9_1","unstructured":"J. Chalopin Y.-J. Chang G. A. Di Luna and H. Zhou. 2026. Efficient Counting and Simulation in Content-Oblivious Rings. arXiv preprint arXiv:2603.28260 (2026)."},{"key":"e_1_3_2_1_10_1","first-page":"1","article-title":"Beyond 2-Edge-Connectivity","volume":"36","author":"Chang Y.-J.","year":"2026","unstructured":"Y.-J. Chang, L. Chen, and H. Zhou. 2026. Beyond 2-Edge-Connectivity: Algorithms and Impossibility for Content-Oblivious Leader Election. In ITCS. 36:1\u201336:23.","journal-title":"Algorithms and Impossibility for Content-Oblivious Leader Election. In ITCS."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80023-7"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"A. Cornejo and F. Kuhn. 2010. Deploying Wireless Networks with Beeps. In DISC. 148\u2013162.","DOI":"10.1007\/978-3-642-15763-9_15"},{"key":"e_1_3_2_1_13_1","volume-title":"Computing in Anonymous Dynamic Networks Is Linear. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE","author":"Di Luna G. A.","unstructured":"G. A. Di Luna and G. Viglietta. 2022. Computing in Anonymous Dynamic Networks Is Linear. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, Denver, CO, USA, 1122\u20131133."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-025-00481-z"},{"key":"e_1_3_2_1_15_1","first-page":"1","article-title":"The Message Complexity of Distributed Graph Optimization","volume":"41","author":"Dufoulon F.","year":"2024","unstructured":"F. Dufoulon, S. Pai, G. Pandurangan, S. V. Pemmaraju, and P. Robinson. 2024. The Message Complexity of Distributed Graph Optimization. In ITCS. 41:1\u201341:26.","journal-title":"ITCS."},{"key":"e_1_3_2_1_16_1","first-page":"1","article-title":"The Singular Optimality of Distributed Computation in LOCAL","volume":"26","author":"Dufoulon F.","year":"2025","unstructured":"F. Dufoulon, G. Pandurangan, P. Robinson, and M. Scquizzato. 2025. The Singular Optimality of Distributed Computation in LOCAL. In OPODIS. 26:1\u201326:17.","journal-title":"OPODIS."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3380546"},{"key":"e_1_3_2_1_18_1","first-page":"1","article-title":"Content-Oblivious Leader Election on Rings","volume":"26","author":"Frei F.","year":"2024","unstructured":"F. Frei, R. Gelles, A. Ghazy, and A. Nolin. 2024. Content-Oblivious Leader Election on Rings. In DISC. 26:1\u201326:20.","journal-title":"DISC."},{"key":"e_1_3_2_1_19_1","first-page":"1","article-title":"Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping","volume":"30","author":"Ghaffari M.","year":"2018","unstructured":"M. Ghaffari and F. Kuhn. 2018. Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping. In DISC. 30:1\u201330:12.","journal-title":"DISC."},{"key":"e_1_3_2_1_20_1","first-page":"1","article-title":"Time-Message Trade-Offs in Distributed Algorithms","volume":"32","author":"Gmyr R.","year":"2018","unstructured":"R. Gmyr and G. Pandurangan. 2018. Time-Message Trade-Offs in Distributed Algorithms. In DISC. 32:1\u201332:18.","journal-title":"DISC."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"B. Haeupler D. E. Hershkowitz and D. Wajc. 2018. Round-and message-optimal distributed graph algorithms. In PODC. 119\u2013128.","DOI":"10.1145\/3212734.3212737"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"V. King S. Kutten and M. Thorup. 2015. Construction and impromptu repair of an MST in a distributed network with o (m) communication. In PODC. 71\u201380.","DOI":"10.1145\/2767386.2767405"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing (HPDC-15)","author":"Le Merrer E.","year":"2006","unstructured":"E. Le Merrer, A.-M. Kermarrec, and L. Massouli\u00e9. 2006. Peer to peer size estimation in large and dynamic networks: A comparative study. In Proceedings of the 15th IEEE International Symposium on High Performance Distributed Computing (HPDC-15), Paris, France, June 19-23, 2006. IEEE, 7\u201317."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3365005"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"D. Peleg. 2000. Distributed computing. a locality-sensitive approach. SIAM.","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"R. Vacus and I. Ziccardi. 2025. Minimalist Leader Election Under Weak Communication. In PODC.","DOI":"10.1145\/3732772.3733559"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"R. Xu C. Gong and Z. Xu. 2019. Pulse-laser Based Long-range NLOS Ultraviolet Communication: Pulse Response Position Estimation and Frame Synchronization Optimization. In ICCC. 163\u2013168.","DOI":"10.1109\/ICCChina.2019.8855803"}],"event":{"name":"PODC '26: ACM Symposium on Principles of Distributed Computing","location":"Egham United Kingdom","acronym":"PODC '26","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3796701.3815917","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:44:19Z","timestamp":1782924259000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3796701.3815917"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":28,"alternative-id":["10.1145\/3796701.3815917","10.1145\/3796701"],"URL":"https:\/\/doi.org\/10.1145\/3796701.3815917","relation":{},"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"2026-07-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}