{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:50:44Z","timestamp":1782971444777,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"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":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538447","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"224-234","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Population Protocols for Exact Plurality Consensus"],"prefix":"10.1145","author":[{"given":"Gregor","family":"Bankhamer","sequence":"first","affiliation":[{"name":"University of Salzburg, Salzburg, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Petra","family":"Berenbrink","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Hamburg, Hamburg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Felix","family":"Biermeier","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Hamburg, Hamburg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Els\u00e4sser","sequence":"additional","affiliation":[{"name":"University of Salzburg, Salzburg, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hamed","family":"Hosseinpour","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Hamburg, Hamburg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dominik","family":"Kaaser","sequence":"additional","affiliation":[{"name":"TU Hamburg, Hamburg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Kling","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Hamburg, Hamburg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175449"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767429"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0138-3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0059-z"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0067-z"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0040-2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.135"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405747"},{"key":"e_1_3_2_1_9_1","volume-title":"32nd International Symposium on Distributed Computing, DISC 2018","author":"Berenbrink Petra","year":"2018","unstructured":"Petra Berenbrink , Robert Els\u00e4sser , Tom Friedetzky , Dominik Kaaser , Peter Kling , and Tomasz Radzik . 2018 . A Population Protocol for Exact Majority with O(log5\/3) Stabilization Time and (log) States . In 32nd International Symposium on Distributed Computing, DISC 2018 , 10:1--10:18. doi: 10.423 0\/LIPIcs.DISC.2018.10. Petra Berenbrink, Robert Els\u00e4sser, Tom Friedetzky, Dominik Kaaser, Peter Kling, and Tomasz Radzik. 2018. A Population Protocol for Exact Majority with O(log5\/3) Stabilization Time and (log) States. In 32nd International Symposium on Distributed Computing, DISC 2018, 10:1--10:18. doi: 10.423 0\/LIPIcs.DISC.2018.10."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-020-00385-0"},{"key":"e_1_3_2_1_11_1","volume-title":"Tight & Simple Load Balancing. In 2019 IEEE International Parallel and Distributed Processing Symposium, IPDPS","author":"Berenbrink Petra","year":"2019","unstructured":"Petra Berenbrink , Tom Friedetzky , Dominik Kaaser , and Peter Kling . 2019 . Tight & Simple Load Balancing. In 2019 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2019, 718--726. doi: 10.1109\/IPDPS.2019.00080. 10.1109\/IPDPS.2019.00080 Petra Berenbrink, Tom Friedetzky, Dominik Kaaser, and Peter Kling. 2019. Tight & Simple Load Balancing. In 2019 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2019, 718--726. doi: 10.1109\/IPDPS.2019.00080."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384312"},{"key":"e_1_3_2_1_13_1","volume-title":"Bower and Hamid Bolouri","author":"James","year":"2001","unstructured":"James M. Bower and Hamid Bolouri , (Eds.) 2001 . Computational modeling of genetic and biochemical networks. MIT Press . James M. Bower and Hamid Bolouri, (Eds.) 2001. Computational modeling of genetic and biochemical networks. MIT Press."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-015-0255-6"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-019-09756-4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03160228"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634131"},{"key":"e_1_3_2_1_18_1","volume-title":"62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021","author":"Doty David","year":"2021","unstructured":"David Doty , Mahsa Eftekhari , Leszek Gasieniec , Eric E. Severson , Przemyslaw Uznanski , and Grzegorz Stachowiak . 2021 . A time and space optimal stable population protocol solving exact majority . In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021 , 1044--1055. doi: 10.110 9\/FOCS52979.2021.00104. David Doty, Mahsa Eftekhari, Leszek Gasieniec, Eric E. Severson, Przemyslaw Uznanski, and Grzegorz Stachowiak. 2021. A time and space optimal stable population protocol solving exact majority. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, 1044--1055. doi: 10.110 9\/FOCS52979.2021.00104."},{"key":"e_1_3_2_1_19_1","volume-title":"Deterministic Population Protocols for Exact Majority and Plurality. In 20th International Conference on Principles of Distributed Systems, OPODIS","author":"Gasieniec Leszek","year":"2016","unstructured":"Leszek Gasieniec , David D. Hamilton , Russell Martin , Paul G. Spirakis , and Grzegorz Stachowiak . 2016 . Deterministic Population Protocols for Exact Majority and Plurality. In 20th International Conference on Principles of Distributed Systems, OPODIS 2016, 14:1--14:14. doi: 10.4230\/LIPIcs.OPODIS.2016 .14. 10.4230\/LIPIcs.OPODIS.2016 Leszek Gasieniec, David D. Hamilton, Russell Martin, Paul G. Spirakis, and Grzegorz Stachowiak. 2016. Deterministic Population Protocols for Exact Majority and Plurality. In 20th International Conference on Principles of Distributed Systems, OPODIS 2016, 14:1--14:14. doi: 10.4230\/LIPIcs.OPODIS.2016 .14."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3424659"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212788"},{"key":"e_1_3_2_1_22_1","volume-title":"Markov Chains and Mixing Times","author":"Levin David","unstructured":"David Levin and Yuval Peres . 2017. Markov Chains and Mixing Times . ( 2 nd ed.). American Mathematical Society . David Levin and Yuval Peres. 2017. Markov Chains and Mixing Times. (2nd ed.). American Mathematical Society.","edition":"2"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1017\/jpr.2020.97"},{"key":"e_1_3_2_1_24_1","volume-title":"CIAC","author":"Natale Emanuele","year":"2019","unstructured":"Emanuele Natale and Iliad Ramezani . 2019 . On the Necessary Memory to Compute the Plurality in Multi-agent Systems. In Algorithms and Complexity - 11th International Conference , CIAC 2019, 323--338. doi: 10.1007\/978--3-030--17402--6_27. 10.1007\/978--3-030--17402--6_27 Emanuele Natale and Iliad Ramezani. 2019. On the Necessary Memory to Compute the Plurality in Multi-agent Systems. In Algorithms and Complexity - 11th International Conference, CIAC 2019, 323--338. doi: 10.1007\/978--3-030--17402--6_27."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1093\/icesjms\/3.1.3"}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","location":"Salerno Italy","acronym":"PODC '22","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538447","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538447","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:21Z","timestamp":1750191141000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538447"}},"subtitle":["How a small chance of failure helps to eliminate insignificant opinions"],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":25,"alternative-id":["10.1145\/3519270.3538447","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538447","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}