{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T08:08:52Z","timestamp":1787645332112,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384312","type":"proceedings-article","created":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T21:48:36Z","timestamp":1624916916000},"page":"119-129","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Optimal time and space leader election in population protocols"],"prefix":"10.1145","author":[{"given":"Petra","family":"Berenbrink","sequence":"first","affiliation":[{"name":"University of Hamburg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8023-4485","authenticated-orcid":false,"given":"George","family":"Giakkoupis","sequence":"additional","affiliation":[{"name":"Inria, France \/ University of Rennes, France \/ CNRS, France \/ IRISA, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Kling","sequence":"additional","affiliation":[{"name":"University of Hamburg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.169"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.144"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47666-6_38"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289137.3289150"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767429"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0138-3"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0067-z"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0059-z"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2018.10"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Petra Berenbrink George Giakkoupis and Peter Kling. 2020. Optimal time and space leader election in population protocols. Research Report. https:\/\/hal.inria.fr\/ hal-02545348  Petra Berenbrink George Giakkoupis and Peter Kling. 2020. Optimal time and space leader election in population protocols. Research Report. https:\/\/hal.inria.fr\/ hal-02545348","DOI":"10.1145\/3357713.3384312"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4230\/OASIcs.SOSA.2018.9"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331631"},{"key":"e_1_3_2_1_13_1","unstructured":"Andreas Bilke Colin Cooper Robert Els\u00e4sser and Tomasz Radzik. 2017. Population protocols for leader election and exact majority with (log2 ) states and (log2 ) convergence time. CoRR abs\/1705.01146 ( 2017 ). arXiv: 1705.01146 http:\/\/arxiv.org\/abs\/1705.01146  Andreas Bilke Colin Cooper Robert Els\u00e4sser and Tomasz Radzik. 2017. Population protocols for leader election and exact majority with (log2 ) states and (log2 ) convergence time. CoRR abs\/1705.01146 ( 2017 ). arXiv: 1705.01146 http:\/\/arxiv.org\/abs\/1705.01146"},{"key":"e_1_3_2_1_14_1","volume-title":"Bower and Hamid Bolouri","author":"James","year":"2001"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Ho-Lin Chen Rachel Cummings David Doty and David Soloveichik. 2017. Speed faults in computation by chemical reaction networks. Distributed Computing 30 5 ( 2017 ) 373-390.  Ho-Lin Chen Rachel Cummings David Doty and David Soloveichik. 2017. Speed faults in computation by chemical reaction networks. Distributed Computing 30 5 ( 2017 ) 373-390.","DOI":"10.1007\/s00446-015-0255-6"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47672-7_32"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.57"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331627"},{"key":"e_1_3_2_1_19_1","volume-title":"Exact size counting in uniform population protocols in nearly logarithmic time. CoRR abs\/","author":"Doty David","year":"1805"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-016-0281-z"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188818"},{"key":"e_1_3_2_1_22_1","unstructured":"Robert Els\u00e4sser and Tomasz 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  Robert Els\u00e4sser and Tomasz 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_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.169"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323178"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212747"},{"key":"e_1_3_2_1_26_1","volume-title":"Population protocols made easy. CoRR abs\/","author":"Kosowski Adrian","year":"1802"},{"key":"e_1_3_2_1_27_1","volume-title":"Leader election requires logarithmic time in population protocols. CoRR abs\/","author":"Sudo Yuichi","year":"1906"},{"key":"e_1_3_2_1_28_1","volume-title":"Logarithmic expected-time leader election in population protocol model. CoRR abs\/","author":"Sudo Yuichi","year":"1812"}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","location":"Chicago IL USA","acronym":"STOC '20","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384312","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384312","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:13Z","timestamp":1750200073000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":28,"alternative-id":["10.1145\/3357713.3384312","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384312","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}