{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T02:21:30Z","timestamp":1774491690395,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T00:00:00Z","timestamp":1596153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministry of Science and Technology, Taiwan","award":["107-2221-E-002-031-MY3"],"award-info":[{"award-number":["107-2221-E-002-031-MY3"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,31]]},"DOI":"10.1145\/3382734.3405733","type":"proceedings-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T22:33:55Z","timestamp":1596234835000},"page":"210-217","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Self-Stabilizing Leader Election in Regular Graphs"],"prefix":"10.1145","author":[{"given":"Hsueh-Ping","family":"Chen","sequence":"first","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan"}]},{"given":"Ho-Lin","family":"Chen","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan"}]}],"member":"320","published-online":{"date-parts":[[2020,7,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039855"},{"key":"e_1_3_2_1_2_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Alistarh Dan","unstructured":"Dan Alistarh and Rati Gelashvili . 2015. Polylogarithmic-time leader election in population protocols . In International Colloquium on Automata, Languages, and Programming . Springer , 479--491. Dan Alistarh and Rati Gelashvili. 2015. Polylogarithmic-time leader election in population protocols. In International Colloquium on Automata, Languages, and Programming. Springer, 479--491."},{"key":"e_1_3_2_1_3_1","volume-title":"Computation in networks of passively mobile finite-state sensors. Distributed computing 18, 4","author":"Angluin Dana","year":"2006","unstructured":"Dana Angluin , James Aspnes , Zo\u00eb Diamadi , Michael J Fischer , and Ren\u00e9 Peralta . 2006. Computation in networks of passively mobile finite-state sensors. Distributed computing 18, 4 ( 2006 ), 235--253. Dana Angluin, James Aspnes, Zo\u00eb Diamadi, Michael J Fischer, and Ren\u00e9 Peralta. 2006. Computation in networks of passively mobile finite-state sensors. Distributed computing 18, 4 (2006), 235--253."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0067-z"},{"key":"e_1_3_2_1_5_1","first-page":"13","article-title":"Self-stabilizing population protocols","volume":"3","author":"Angluin Dana","year":"2008","unstructured":"Dana Angluin , James Aspnes , Michael J Fischer , and Hong Jiang . 2008 . Self-stabilizing population protocols . ACM Transactions on Autonomous and Adaptive Systems (TAAS) 3 , 4 (2008), 13 . Dana Angluin, James Aspnes, Michael J Fischer, and Hong Jiang. 2008. Self-stabilizing population protocols. ACM Transactions on Autonomous and Adaptive Systems (TAAS) 3, 4 (2008), 13.","journal-title":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03850-6_4"},{"key":"e_1_3_2_1_7_1","volume-title":"1st Symposium on Simplicity in Algorithms (SOSA","author":"Berenbrink Petra","year":"2018","unstructured":"Petra Berenbrink , Dominik Kaaser , Peter Kling , and Lena Otterbach . 2018 . Simple and efficient leader election . In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Petra Berenbrink, Dominik Kaaser, Peter Kling, and Lena Otterbach. 2018. Simple and efficient leader election. In 1st Symposium on Simplicity in Algorithms (SOSA 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_8_1","volume-title":"Efficient self-stabilizing leader election in population protocols. arXiv preprint arXiv:1907.06068","author":"Burman Janna","year":"2019","unstructured":"Janna Burman , David Doty , Thomas Nowak , Eric E Severson , and Chuan Xu. 2019. Efficient self-stabilizing leader election in population protocols. arXiv preprint arXiv:1907.06068 ( 2019 ). Janna Burman, David Doty, Thomas Nowak, Eric E Severson, and Chuan Xu. 2019. Efficient self-stabilizing leader election in population protocols. arXiv preprint arXiv:1907.06068 (2019)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-011-9313-z"},{"key":"e_1_3_2_1_10_1","volume-title":"Deterministic function computation with chemical reaction networks. Natural computing 13, 4","author":"Chen Ho-Lin","year":"2014","unstructured":"Ho-Lin Chen , David Doty , and David Soloveichik . 2014. Deterministic function computation with chemical reaction networks. Natural computing 13, 4 ( 2014 ), 517--534. Ho-Lin Chen, David Doty, and David Soloveichik. 2014. Deterministic function computation with chemical reaction networks. Natural computing 13, 4 (2014), 517--534."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331616"},{"key":"e_1_3_2_1_12_1","volume-title":"Self-stabilizing Systems in Spite of Distributed Control. Communications","author":"Dijkstra Edsger W","year":"1974","unstructured":"Edsger W Dijkstra . 1974. Self-stabilizing Systems in Spite of Distributed Control. Communications ( 1974 ). Edsger W Dijkstra. 1974. Self-stabilizing Systems in Spite of Distributed Control. Communications (1974)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-016-0281-z"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11945529_28"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323178"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.169"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365691"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(69)80011-5"},{"key":"e_1_3_2_1_19_1","unstructured":"Carl Adam Petri. 1966. Communication with automata. (1966).  Carl Adam Petri. 1966. Communication with automata. (1966)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2881125"}],"event":{"name":"PODC '20: ACM Symposium on Principles of Distributed Computing","location":"Virtual Event Italy","acronym":"PODC '20","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 39th Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382734.3405733","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3382734.3405733","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:50Z","timestamp":1750197770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382734.3405733"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,31]]},"references-count":20,"alternative-id":["10.1145\/3382734.3405733","10.1145\/3382734"],"URL":"https:\/\/doi.org\/10.1145\/3382734.3405733","relation":{},"subject":[],"published":{"date-parts":[[2020,7,31]]},"assertion":[{"value":"2020-07-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}