{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:08Z","timestamp":1750220348910,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2017-05936,RGPIN-2018-03899"],"award-info":[{"award-number":["RGPIN-2017-05936,RGPIN-2018-03899"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1145\/3409964.3461794","type":"proceedings-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T23:07:02Z","timestamp":1625094422000},"page":"265-274","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Four Shades of Deterministic Leader Election in Anonymous Networks"],"prefix":"10.1145","author":[{"given":"Barun","family":"Gorain","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Bhilai, Bhilai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avery","family":"Miller","sequence":"additional","affiliation":[{"name":"University of Manitoba, Winnipeg, MAN, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[{"name":"Universit\u00e9 du Qu\u00e9bec en Outaouais, Gatineau, PQ, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA","author":"Abiteboul S.","year":"2001","unstructured":"S. Abiteboul , H. Kaplan , T. Milo, Compact labeling schemes for ancestor queries , Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001 ), 547--556. S. Abiteboul, H. Kaplan, T. Milo, Compact labeling schemes for ancestor queries, Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), 547--556."},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. 12th Annual ACM Symposium on Theory of Computing (STOC","author":"Angluin D.","year":"1980","unstructured":"D. Angluin , Local and global properties in networks of processors . Proc. 12th Annual ACM Symposium on Theory of Computing (STOC 1980 ), 82--93. D. Angluin, Local and global properties in networks of processors. Proc. 12th Annual ACM Symposium on Theory of Computing (STOC 1980), 82--93."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90002-G"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.48247"},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. 4th Israel Symposium on Theory of Computing and Systems, (ISTCS","author":"Boldi P.","year":"1996","unstructured":"P. Boldi , S. Shammah , S. Vigna , B. Codenotti , P. Gemmell , and J. Simon , Symmetry breaking in anonymous networks: Characterizations . Proc. 4th Israel Symposium on Theory of Computing and Systems, (ISTCS 1996 ), 16--26. P. Boldi, S. Shammah, S. Vigna, B. Codenotti, P. Gemmell, and J. Simon, Symmetry breaking in anonymous networks: Characterizations. Proc. 4th Israel Symposium on Theory of Computing and Systems, (ISTCS 1996), 16--26."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301355"},{"key":"e_1_3_2_1_7_1","volume-title":"A formal model for message passing systems","author":"Burns J.E.","year":"1980","unstructured":"J.E. Burns , A formal model for message passing systems , Tech. Report TR-91, Computer Science Department, Indiana University , Bloomington, September 1980 . J.E. Burns, A formal model for message passing systems, Tech. Report TR-91, Computer Science Department, Indiana University, Bloomington, September 1980."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2011.10.004"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-013-0196-x"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0444-3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2371077.2371079"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.08.007"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2003.11.007"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0076-y"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.07.002"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.07.005"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9280-9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7919"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0237-0"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/3118756.3119007"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2016.01.005"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.05.002"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3039870"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/AICCSA.2008.4493575"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/359024.359029"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.01.004"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571833"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703433912"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0095-3"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.04.003"},{"key":"e_1_3_2_1_31_1","volume-title":"Proc. IFIP Congress","author":"Lann G. Le","year":"1977","unstructured":"G. Le Lann , Distributed systems - Towards a formal approach , Proc. IFIP Congress , 1977 , 155--160, North Holland. G. Le Lann, Distributed systems - Towards a formal approach, Proc. IFIP Congress, 1977, 155--160, North Holland."},{"key":"e_1_3_2_1_32_1","volume-title":"Morgan Kaufmann Publ","author":"Lynch N.L.","year":"1996","unstructured":"N.L. Lynch , Distributed Algorithms , Morgan Kaufmann Publ . Inc., San Francisco, USA , 1996 . N.L. Lynch, Distributed Algorithms, Morgan Kaufmann Publ. Inc., San Francisco, USA, 1996."},{"key":"e_1_3_2_1_33_1","volume-title":"Proc. 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA","author":"Miller A.","year":"2016","unstructured":"A. Miller , A. Pelc , Election vs. selection : How much advice is needed to find the largest node in a graph? , Proc. 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2016 ), 377--386. A. Miller, A. Pelc, Election vs. selection: How much advice is needed to find the largest node in a graph?, Proc. 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2016), 377--386."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2002.1003864"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.08.020"},{"key":"e_1_3_2_1_36_1","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719772","volume-title":"A Locality-Sensitive Approach","author":"Peleg","year":"2000","unstructured":"Peleg , Distributed Computing , A Locality-Sensitive Approach , SIAM Monographs on Discrete Mathematics and Applications , Philadelphia 2000 . Peleg, Distributed Computing, A Locality-Sensitive Approach, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia 2000."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/69622.357194"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215032"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/645946.675009"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.481599"}],"event":{"name":"SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '21"},"container-title":["Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461794","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461794","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:08Z","timestamp":1750191428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":41,"alternative-id":["10.1145\/3409964.3461794","10.1145\/3409964"],"URL":"https:\/\/doi.org\/10.1145\/3409964.3461794","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}