{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T18:43:16Z","timestamp":1783536196481,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T00:00:00Z","timestamp":1783296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"NSERC","award":["024-03767"],"award-info":[{"award-number":["024-03767"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,6]]},"DOI":"10.1145\/3816782.3819209","type":"proceedings-article","created":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T17:28:33Z","timestamp":1783531713000},"page":"503-523","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Universal Deterministic Symmetry Breaking Between Anonymous Agents in Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-4608-6905","authenticated-orcid":false,"given":"Bibhuti","family":"Das","sequence":"first","affiliation":[{"name":"D\u00e9partement d\u2019informatique, Universit\u00e9 du Qu\u00e9bec en Outaouais, Canada, Gatineau, Qu\u00e9bec, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0598-1218","authenticated-orcid":false,"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[{"name":"D\u00e9partement d\u2019informatique, Universit\u00e9 du Qu\u00e9bec en Outaouais, Canada, Gatineau, Qu\u00e9bec, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/050645221"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.10011"},{"key":"e_1_3_2_1_3_1","volume-title":"Int. Series in Operations research and Management Science","author":"Alpern S.","year":"2002","unstructured":"S. Alpern and S. Gal, The theory of search games and rendezvous. Int. Series in Operations research and Management Science, Kluwer Academic Publisher, 2002."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1239\/jap\/1032374243"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/276884.276925"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.49.1.107.11191"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.48247"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. 12th Symposium on the Theory of Computing (STOC","author":"Angluin D.","year":"1980","unstructured":"D. Angluin, Local and global properties in networks of processors. Proc. 12th Symposium on the Theory of Computing (STOC 1980), 82\u201393."},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. 24th International Symposium on Distributed Computing (DISC","author":"Bampas E.","year":"2010","unstructured":"E. Bampas, J. Czyzowicz, L. Gasieniec, D. Ilcinkas, A. Labourel, Almost optimal asynchronous rendezvous in infinite multidimensional grids. Proc. 24th International Symposium on Distributed Computing (DISC 2010), 297\u2013311."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012996314130"},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. 36th International Symposium on Distributed Computing (DISC","author":"Bhagat S.","year":"2022","unstructured":"S. Bhagat, A. Pelc, How to meet at a node of any connected graph, Proc. 36th International Symposium on Distributed Computing (DISC 2022), 11:1\u201311:16."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301355"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-016-0276-9"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/100796534"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/060665257"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-011-0141-9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2344422.2344427"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.12.016"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-0074-2"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-9982-0"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/130931990"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.01.001"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.47.6.974"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2025.115395"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25873-2_29"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/850929.851981"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1086"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S036301299427816X"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-11072-7_17"},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA","author":"Pelc A.","year":"2019","unstructured":"A. Pelc, R.N. Yadav, Using time to break symmetry: universal deterministic anonymous rendezvous, Proc. 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2019), 85\u201392."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601068"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.481599"}],"event":{"name":"SPAA '26: 38th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Royal Holloway, University of London London United Kingdom","acronym":"SPAA '26","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","EATCS"]},"container-title":["Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3816782.3819209","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T17:28:59Z","timestamp":1783531739000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3816782.3819209"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,6]]},"references-count":32,"alternative-id":["10.1145\/3816782.3819209","10.1145\/3816782"],"URL":"https:\/\/doi.org\/10.1145\/3816782.3819209","relation":{},"subject":[],"published":{"date-parts":[[2026,7,6]]},"assertion":[{"value":"2026-07-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}