{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:39:20Z","timestamp":1763415560163,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"CNRS","award":["ABIDE"],"award-info":[{"award-number":["ABIDE"]}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1844976"],"award-info":[{"award-number":["1844976"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF","award":["1900931"],"award-info":[{"award-number":["1900931"]}]},{"name":"MOST","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":[[2021,7,21]]},"DOI":"10.1145\/3465084.3467898","type":"proceedings-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T21:09:28Z","timestamp":1627074568000},"page":"33-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Time-Optimal Self-Stabilizing Leader Election in Population Protocols"],"prefix":"10.1145","author":[{"given":"Janna","family":"Burman","sequence":"first","affiliation":[{"name":"Universit\u00e9 Paris-Saclay, CNRS, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ho-Lin","family":"Chen","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsueh-Ping","family":"Chen","sequence":"additional","affiliation":[{"name":"National Taiwan University, Taipei, Taiwan Roc"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Doty","sequence":"additional","affiliation":[{"name":"University of California, Davis, Davis, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Nowak","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris-Saclay, CNRS, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Severson","sequence":"additional","affiliation":[{"name":"University of California, Davis, Davis, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuan","family":"Xu","sequence":"additional","affiliation":[{"name":"Inria Sophia-Antipolis, Nice, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"D. Alistarh J. Aspnes D. Eisenstat R. Gelashvili and R. L. Rivest. 2017. Trade-offs in Population Protocols. In SODA. 2560--2579.  D. Alistarh J. Aspnes D. Eisenstat R. Gelashvili and R. L. Rivest. 2017. Trade-offs in Population Protocols. In SODA. 2560--2579.","DOI":"10.1137\/1.9781611974782.169"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"D. Alistarh J. Aspnes and R. Gelashvili. 2018. Space-Optimal Majority in Population Protocols. In SODA. 2221--2239.  D. Alistarh J. Aspnes and R. Gelashvili. 2018. Space-Optimal Majority in Population Protocols. In SODA. 2221--2239.","DOI":"10.1137\/1.9781611975031.144"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15763-9_9"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611499"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"D. Alistarh B. Dudek A. Kosowski D. Soloveichik and P. Uznanski. 2017. Robust Detection in Leak-Prone Population Protocols. In DNA. 155--171. https:\/\/doi.org\/ 10.1007\/978-3-319-66799-7_11  D. Alistarh B. Dudek A. Kosowski D. Soloveichik and P. Uznanski. 2017. Robust Detection in Leak-Prone Population Protocols. In DNA. 155--171. https:\/\/doi.org\/ 10.1007\/978-3-319-66799-7_11","DOI":"10.1007\/978-3-319-66799-7_11"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289137.3289150"},{"key":"e_1_3_2_2_7_1","volume-title":"DISC 2020: 34th International Symposium on Distributed Computing (Leibniz International Proceedings in Informatics (LIPIcs)","volume":"18","author":"Amir Talley","year":"2020","unstructured":"Talley Amir , James Aspnes , David Doty , Mahsa Eftekhari , and Eric Severson . 2020 . Message complexity of population protocols . In DISC 2020: 34th International Symposium on Distributed Computing (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 179), Hagit Attiya (Ed.). Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 6:1--6: 18 . https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2020.6 Talley Amir, James Aspnes, David Doty, Mahsa Eftekhari, and Eric Severson. 2020. Message complexity of population protocols. In DISC 2020: 34th International Symposium on Distributed Computing (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 179), Hagit Attiya (Ed.). Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 6:1--6:18. https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2020.6"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0138-3"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0067-z"},{"key":"e_1_3_2_2_10_1","volume-title":"Self-stabilizing Population Protocols. In OPODIS","volume":"3974","author":"Angluin D.","unstructured":"D. Angluin , J. Aspnes , M. J. Fischer , and H. Jiang . 2005 . Self-stabilizing Population Protocols. In OPODIS , Vol. 3974 . Springer, 103--117. https:\/\/doi.org\/10.1007\/ 11795490_10 D. Angluin, J. Aspnes, M. J. Fischer, and H. Jiang. 2005. Self-stabilizing Population Protocols. In OPODIS, Vol. 3974. Springer, 103--117. https:\/\/doi.org\/10.1007\/ 11795490_10"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"J. Beauquier P. Blanchard and J. Burman. 2013. Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs. In OPODIS. 38--52.  J. Beauquier P. Blanchard and J. Burman. 2013. Self-stabilizing Leader Election in Population Protocols over Arbitrary Communication Graphs. In OPODIS. 38--52.","DOI":"10.1007\/978-3-319-03850-6_4"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"J. Beauquier J. Clement S. Messika L. Rosaz and B. Rozoy. 2007. Self-Stabilizing Counting in Mobile Sensor Networks with a base station. In DISC. 63--76.  J. Beauquier J. Clement S. Messika L. Rosaz and B. Rozoy. 2007. Self-Stabilizing Counting in Mobile Sensor Networks with a base station. In DISC. 63--76.","DOI":"10.1007\/978-3-540-75142-7_8"},{"key":"e_1_3_2_2_13_1","first-page":"1","article-title":"Hardness of Computing and Approximating Predicates and Functions with Leaderless Population Protocols","volume":"141","author":"Belleville A.","year":"2017","unstructured":"A. Belleville , D. Doty , and D. Soloveichik . 2017 . Hardness of Computing and Approximating Predicates and Functions with Leaderless Population Protocols . In ICALP. 141 : 1 -- 141 :14. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.141 A. Belleville, D. Doty, and D. Soloveichik. 2017. Hardness of Computing and Approximating Predicates and Functions with Leaderless Population Protocols. In ICALP. 141:1--141:14. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.141","journal-title":"ICALP."},{"key":"e_1_3_2_2_14_1","unstructured":"P. Berenbrink G. Giakkoupis and P. Kling. 2020. Optimal time and space leader election in population protocols. In STOC. ACM 119--129. https:\/\/doi.org\/10. 1145\/3357713.3384312  P. Berenbrink G. Giakkoupis and P. Kling. 2020. Optimal time and space leader election in population protocols. In STOC. ACM 119--129. https:\/\/doi.org\/10. 1145\/3357713.3384312"},{"key":"e_1_3_2_2_15_1","first-page":"1","article-title":"Large Flocks of Small Birds: on the Minimal Size of Population Protocols","volume":"16","author":"Blondin M.","year":"2018","unstructured":"M. Blondin , J. Esparza , and S. Jaax . 2018 . Large Flocks of Small Birds: on the Minimal Size of Population Protocols . In STACS. 16 : 1 -- 16 :14. https:\/\/doi.org\/10. 4230\/LIPIcs.STACS.2018.16 M. Blondin, J. Esparza, and S. Jaax. 2018. Large Flocks of Small Birds: on the Minimal Size of Population Protocols. In STACS. 16:1--16:14. https:\/\/doi.org\/10. 4230\/LIPIcs.STACS.2018.16","journal-title":"STACS."},{"key":"e_1_3_2_2_16_1","volume-title":"Playing With Population Protocols. In CSP","author":"Bournez O.","year":"2008","unstructured":"O. Bournez , J. Chalopin , J. Cohen , and X. Koegler . 2008 . Playing With Population Protocols. In CSP 2008 . 3--15. O. Bournez, J. Chalopin, J. Cohen, and X. Koegler. 2008. Playing With Population Protocols. In CSP 2008. 3--15."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/3214123.3214128"},{"key":"e_1_3_2_2_18_1","unstructured":"J. M. Bower and H. Bolouri. 2004. Computational modeling of genetic and biochemical networks. MIT press.  J. M. Bower and H. Bolouri. 2004. Computational modeling of genetic and biochemical networks. MIT press."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.2307\/3213094"},{"key":"e_1_3_2_2_20_1","volume-title":"Space-Optimal Naming in Population Protocols. In DISC'19","volume":"146","author":"Burman J.","year":"2019","unstructured":"J. Burman , J. Beauquier , and D. Sohier . 2019 . Space-Optimal Naming in Population Protocols. In DISC'19 , J. Suomela (Ed.) , Vol. 146 . 9:1--9:16. https:\/\/doi.org\/10.4230\/ LIPIcs.DISC. 2019 .9 J. Burman, J. Beauquier, and D. Sohier. 2019. Space-Optimal Naming in Population Protocols. In DISC'19, J. Suomela (Ed.), Vol. 146. 9:1--9:16. https:\/\/doi.org\/10.4230\/ LIPIcs.DISC.2019.9"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-011-9313-z"},{"key":"e_1_3_2_2_23_1","unstructured":"A. Casteigts M. Raskin M. Renken and V. Zamaraev. 2020. Sharp Thresholds in Random Simple Temporal Graphs. arXiv:2011.03738 [cs.DM]  A. Casteigts M. Raskin M. Renken and V. Zamaraev. 2020. Sharp Thresholds in Random Simple Temporal Graphs. arXiv:2011.03738 [cs.DM]"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2019.2952836"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331616"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405733"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"C. Delporte-Gallet H. Fauconnier R. Guerraoui and E. Ruppert. 2006. When Birds Die: Making Population Protocols Fault-Tolerant. In DCOSS. 51--66.  C. Delporte-Gallet H. Fauconnier R. Guerraoui and E. Ruppert. 2006. When Birds Die: Making Population Protocols Fault-Tolerant. In DCOSS. 51--66.","DOI":"10.1007\/11776178_4"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03160228"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Shlomi Dolev. 2000. Self-stabilization. MIT press.  Shlomi Dolev. 2000. Self-stabilization. MIT press.","DOI":"10.7551\/mitpress\/6156.001.0001"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02278851"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"D. Doty and D. Soloveichik. 2015. Stable Leader Election in Population Protocols Requires Linear Time. In DISC. 602--616.  D. Doty and D. Soloveichik. 2015. Stable Leader Election in Population Protocols Requires Linear Time. In DISC. 602--616.","DOI":"10.1007\/978-3-662-48653-5_40"},{"key":"e_1_3_2_2_33_1","unstructured":"R. Els\u00e4sser and T. Radzik. 2018. Recent Results in Population Protocols for Exact Majority and Leader Election. Bulletin of the EATCS 126 (2018). http: \/\/bulletin.eatcs.org\/index.php\/beatcs\/article\/view\/549\/546  R. Els\u00e4sser and T. Radzik. 2018. Recent Results in Population Protocols for Exact Majority and Leader Election. Bulletin of the EATCS 126 (2018). http: \/\/bulletin.eatcs.org\/index.php\/beatcs\/article\/view\/549\/546"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-016-0272-3"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"M. J. Fischer and H. Jiang. 2006. Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents. In OPODIS. 395--409.  M. J. Fischer and H. Jiang. 2006. Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents. In OPODIS. 395--409.","DOI":"10.1007\/11945529_28"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","unstructured":"L. Gasieniec and G. Stachowiak. 2018. Fast Space Optimal Leader Election in Population Protocols. In SODA. 2653--2667. https:\/\/doi.org\/10.1137\/1.9781611975031. 169  L. Gasieniec and G. Stachowiak. 2018. Fast Space Optimal Leader Election in Population Protocols. In SODA. 2653--2667. https:\/\/doi.org\/10.1137\/1.9781611975031. 169","DOI":"10.1137\/1.9781611975031.169"},{"key":"e_1_3_2_2_37_1","unstructured":"L. Gasieniec G. Stachowiak and P. Uznanski. 2019. Almost Logarithmic-Time Space Optimal Leader Election in Population Protocols. In SPAA. 93--102. https: \/\/doi.org\/10.1145\/3323165.3323178  L. Gasieniec G. Stachowiak and P. Uznanski. 2019. Almost Logarithmic-Time Space Optimal Leader Election in Population Protocols. In SPAA. 93--102. https: \/\/doi.org\/10.1145\/3323165.3323178"},{"key":"e_1_3_2_2_38_1","volume-title":"Exact stochastic simulation of coupled chemical reactions. Journal of Physical Chemistry 81 (25)","author":"Gillespie D. T.","year":"1977","unstructured":"D. T. Gillespie . 1977. Exact stochastic simulation of coupled chemical reactions. Journal of Physical Chemistry 81 (25) ( 1977 ), 2340--2361. D. T. Gillespie. 1977. Exact stochastic simulation of coupled chemical reactions. Journal of Physical Chemistry 81 (25) (1977), 2340--2361."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"R. Guerraoui and E. Ruppert. 2009. Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures. In ICALP (2). 484--495.  R. Guerraoui and E. Ruppert. 2009. Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures. In ICALP (2). 484--495.","DOI":"10.1007\/978-3-642-02930-1_40"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.2307\/3213330"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25258-2_21"},{"key":"e_1_3_2_2_42_1","volume-title":"Mobile Emulab: A Robotic Wireless and Sensor Network Testbed","author":"Johnson D.","year":"2006","unstructured":"D. Johnson , T. Stack , R. Fish , D. Montrallo Flickinger , L. Stoller , R. Ricci , and J. Lepreau . 2006 . Mobile Emulab: A Robotic Wireless and Sensor Network Testbed . In INFOCOM. IEEE. https:\/\/doi.org\/10.1109\/INFOCOM.2006.182 D. Johnson, T. Stack, R. Fish, D. Montrallo Flickinger, L. Stoller, R. Ricci, and J. Lepreau. 2006. Mobile Emulab: A Robotic Wireless and Sensor Network Testbed. In INFOCOM. IEEE. https:\/\/doi.org\/10.1109\/INFOCOM.2006.182"},{"key":"e_1_3_2_2_43_1","volume-title":"Brief Announcement: Population Protocols Are Fast. In PODC. 475--477. https:\/\/dl.acm.org\/citation.cfm?id=3212788","author":"Kosowski A.","year":"2018","unstructured":"A. Kosowski and P. Uznanski . 2018 . Brief Announcement: Population Protocols Are Fast. In PODC. 475--477. https:\/\/dl.acm.org\/citation.cfm?id=3212788 A. Kosowski and P. Uznanski. 2018. Brief Announcement: Population Protocols Are Fast. In PODC. 475--477. https:\/\/dl.acm.org\/citation.cfm?id=3212788"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.09.005"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.2200\/S00328ED1V01Y201101DCT006"},{"key":"e_1_3_2_2_46_1","unstructured":"O. Michail I. Chatzigiannakis and P. G. Spirakis. 2013. Naming and Counting in Anonymous Unknown Dynamic Networks. In SSS. 281--295. https:\/\/doi.org\/10. 1007\/978-3-319-03089-0_20  O. Michail I. Chatzigiannakis and P. G. Spirakis. 2013. Naming and Counting in Anonymous Unknown Dynamic Networks. In SSS. 281--295. https:\/\/doi.org\/10. 1007\/978-3-319-03089-0_20"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-012-0173-9"},{"volume-title":"2016 IEEE 15th International Symposium on Network Computing and Applications (NCA). IEEE, 264--271","author":"Mocquard Y.","key":"e_1_3_2_2_48_1","unstructured":"Y. Mocquard , B. Sericola , S. Robert , and E. Anceaume . 2016. Analysis of the propagation time of a rumour in large-scale distributed systems . In 2016 IEEE 15th International Symposium on Network Computing and Applications (NCA). IEEE, 264--271 . Y. Mocquard, B. Sericola, S. Robert, and E. Anceaume. 2016. Analysis of the propagation time of a rumour in large-scale distributed systems. In 2016 IEEE 15th International Symposium on Network Computing and Applications (NCA). IEEE, 264--271."},{"key":"e_1_3_2_2_49_1","volume-title":"Random exchanges of information. Nieuw Archief voor Wiskunde 20","author":"Moon J. W.","year":"1972","unstructured":"J. W. Moon . 1972. Random exchanges of information. Nieuw Archief voor Wiskunde 20 ( 1972 ), 246--249. J. W. Moon. 1972. Random exchanges of information. Nieuw Archief voor Wiskunde 20 (1972), 246--249."},{"key":"e_1_3_2_2_50_1","unstructured":"J. Polastre J. L. Hill and D. E. Culler. 2004. Versatile low power media access for wireless sensor networks. In SenSys. ACM 95--107. https:\/\/doi.org\/10.1145\/ 1031495.1031508  J. Polastre J. L. Hill and D. E. Culler. 2004. Versatile low power media access for wireless sensor networks. In SenSys. ACM 95--107. https:\/\/doi.org\/10.1145\/ 1031495.1031508"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"crossref","unstructured":"M. Rabie. 2017. Global Versus Local Computations: Fast Computing with Identifiers. In SIROCCO. 90--105. https:\/\/doi.org\/10.1007\/978-3-319-72050-0_6  M. Rabie. 2017. Global Versus Local Computations: Fast Computing with Identifiers. In SIROCCO. 90--105. https:\/\/doi.org\/10.1007\/978-3-319-72050-0_6","DOI":"10.1007\/978-3-319-72050-0_6"},{"key":"e_1_3_2_2_52_1","volume-title":"Composable computation in discrete chemical reaction networks. Distributed Computing","author":"Severson Eric","year":"2020","unstructured":"Eric Severson , David Haley , and David Doty . 2020. Composable computation in discrete chemical reaction networks. Distributed Computing ( 2020 ). to appear. Special issue of invited papers from PODC 2019. Eric Severson, David Haley, and David Doty. 2020. Composable computation in discrete chemical reaction networks. Distributed Computing (2020). to appear. Special issue of invited papers from PODC 2019."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-008-9067-y"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1142\/S012962642050005X"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.2991771"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.09.034"},{"key":"e_1_3_2_2_57_1","volume-title":"The Power of Global Knowledge on Self-stabilizing Population Protocols. In SIROCCO","volume":"12156","author":"Sudo Y.","unstructured":"Y. Sudo , M. Shibata , J. Nakamura , Y. Kim , and T. Masuzawa . 2020 . The Power of Global Knowledge on Self-stabilizing Population Protocols. In SIROCCO , Vol. 12156 . Springer, 237--254. https:\/\/doi.org\/10.1007\/978-3-030-54921-3_14 Y. Sudo, M. Shibata, J. Nakamura, Y. Kim, and T. Masuzawa. 2020. The Power of Global Knowledge on Self-stabilizing Population Protocols. In SIROCCO, Vol. 12156. Springer, 237--254. https:\/\/doi.org\/10.1007\/978-3-030-54921-3_14"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"crossref","unstructured":"X. Xu Y. Yamauchi S. Kijima and M. Yamashita. 2013. Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on k-Interaction. In SSS. 86--97. https:\/\/doi.org\/10.1007\/978-3-319-03089-0_7  X. Xu Y. Yamauchi S. Kijima and M. Yamashita. 2013. Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on k-Interaction. In SSS. 86--97. https:\/\/doi.org\/10.1007\/978-3-319-03089-0_7","DOI":"10.1007\/978-3-319-03089-0_7"},{"key":"e_1_3_2_2_59_1","volume-title":"Constant-Space Population Protocols for Uniform Bipartition. In OPODIS","author":"Yasumi H.","year":"2017","unstructured":"H. Yasumi , F. Ooshita , K. Yamaguchi , and M. Inoue . 2017 . Constant-Space Population Protocols for Uniform Bipartition. In OPODIS 2017 . 19:1--19:17. H. Yasumi, F. Ooshita, K. Yamaguchi, and M. Inoue. 2017. Constant-Space Population Protocols for Uniform Bipartition. In OPODIS 2017. 19:1--19:17."},{"key":"e_1_3_2_2_60_1","volume-title":"Time-Optimal Self-stabilizing Leader Election on Rings in Population Protocols. In SSS","volume":"12514","author":"Yokota D.","unstructured":"D. Yokota , Y. Sudo , and T. Masuzawa . 2020 . Time-Optimal Self-stabilizing Leader Election on Rings in Population Protocols. In SSS , Vol. 12514 . Springer, 301--316. https:\/\/doi.org\/10.1007\/978-3-030-64348-5_24 D. Yokota, Y. Sudo, and T. Masuzawa. 2020. Time-Optimal Self-stabilizing Leader Election on Rings in Population Protocols. In SSS, Vol. 12514. Springer, 301--316. https:\/\/doi.org\/10.1007\/978-3-030-64348-5_24"}],"event":{"name":"PODC '21: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Virtual Event Italy","acronym":"PODC '21"},"container-title":["Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467898","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467898","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:25Z","timestamp":1750191505000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":59,"alternative-id":["10.1145\/3465084.3467898","10.1145\/3465084"],"URL":"https:\/\/doi.org\/10.1145\/3465084.3467898","relation":{},"subject":[],"published":{"date-parts":[[2021,7,21]]},"assertion":[{"value":"2021-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}