{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T18:19:01Z","timestamp":1773944341287,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T00:00:00Z","timestamp":1563235200000},"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":[[2019,7,16]]},"DOI":"10.1145\/3293611.3331631","type":"proceedings-article","created":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T13:17:21Z","timestamp":1563542241000},"page":"43-52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["On Counting the Population Size"],"prefix":"10.1145","author":[{"given":"Petra","family":"Berenbrink","sequence":"first","affiliation":[{"name":"Universit\u00e4t Hamburg, Hamburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominik","family":"Kaaser","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Hamburg, Hamburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Radzik","sequence":"additional","affiliation":[{"name":"King's College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Alistarh Dan","year":"2017","unstructured":"Dan Alistarh , James Aspnes , David Eisenstat , Rati Gelashvili , and Ronald L. Rivest . 2017. Time-Space Trade-offs in Population Protocols . In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 , Barcelona, Spain, Hotel Porta Fira, January 16--19, Philip N. Klein (Ed.). SIAM, 2560--2579. Dan Alistarh, James Aspnes, David Eisenstat, Rati Gelashvili, and Ronald L. Rivest. 2017. Time-Space Trade-offs in Population Protocols. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16--19, Philip N. Klein (Ed.). SIAM, 2560--2579."},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Alistarh Dan","year":"2018","unstructured":"Dan Alistarh , James Aspnes , and Rati Gelashvili . 2018. Space-Optimal Majority in Population Protocols . In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 , New Orleans, LA , USA, January 7--10, 2018, Artur Czumaj (Ed.). SIAM , 2221--2239. Dan Alistarh, James Aspnes, and Rati Gelashvili. 2018. Space-Optimal Majority in Population Protocols. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7--10, 2018, Artur Czumaj (Ed.). SIAM, 2221--2239."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767429"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011810"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0138-3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0067-z"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0040-2"},{"key":"e_1_3_2_1_8_1","volume-title":"abs\/1805.04586","author":"Berenbrink Petra","year":"2018","unstructured":"Petra Berenbrink , Robert Els\"a sser, Tom Friedetzky , Dominik Kaaser , Peter Kling , and Tomasz Radzik . 2018a. Majority & Stabilization in Population Protocols . Co RR , Vol . abs\/1805.04586 ( 2018 ). arxiv: 1805.04586 https:\/\/arxiv.org\/abs\/1805.04586 Petra Berenbrink, Robert Els\"a sser, Tom Friedetzky, Dominik Kaaser, Peter Kling, and Tomasz Radzik. 2018a. Majority & Stabilization in Population Protocols. CoRR, Vol. abs\/1805.04586 (2018). arxiv: 1805.04586 https:\/\/arxiv.org\/abs\/1805.04586"},{"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\"a sser, Tom Friedetzky , Dominik Kaaser , Peter Kling , and Tomasz Radzik . 2018 b. A Population Protocol for Exact Majority with smash\u00f8peratornameO(\u0142og^5\/3 n) Stabilization Time and \u0398(\u0142og n) States . In 32nd International Symposium on Distributed Computing, DISC 2018 , New Orleans, LA, USA, October 15--19 , 2018 (LIPIcs),, Ulrich Schmid and Josef Widder (Eds.), Vol. 121. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 10:1--10:18. Petra Berenbrink, Robert Els\"a sser, Tom Friedetzky, Dominik Kaaser, Peter Kling, and Tomasz Radzik. 2018b. A Population Protocol for Exact Majority with smash\u00f8peratornameO(\u0142og^5\/3 n) Stabilization Time and \u0398(\u0142og n) States. In 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15--19, 2018 (LIPIcs),, Ulrich Schmid and Josef Widder (Eds.), Vol. 121. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 10:1--10:18."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2019.00080"},{"key":"e_1_3_2_1_11_1","volume-title":"2019 b. On Counting the Population Size. CoRR","author":"Berenbrink Petra","year":"1962","unstructured":"Petra Berenbrink , Dominik Kaaser , and Tomasz Radzik . 2019 b. On Counting the Population Size. CoRR , Vol. abs\/ 1905 .1 1962 (2019). arxiv: 1905.11962 https:\/\/arxiv.org\/abs\/1905.11962 Petra Berenbrink, Dominik Kaaser, and Tomasz Radzik. 2019 b. On Counting the Population Size. CoRR, Vol. abs\/1905.11962 (2019). arxiv: 1905.11962 https:\/\/arxiv.org\/abs\/1905.11962"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087858"},{"key":"e_1_3_2_1_13_1","volume-title":"Efficient size estimation and impossibility of termination in uniform dense population protocols. CoRR","author":"Doty David","year":"2018","unstructured":"David Doty and Mahsa Eftekhari . 2018. Efficient size estimation and impossibility of termination in uniform dense population protocols. CoRR , Vol. abs\/ 1808 .08913 ( 2018 ). arxiv: 1808.08913 https:\/\/arxiv.org\/abs\/1808.08913 David Doty and Mahsa Eftekhari. 2018. Efficient size estimation and impossibility of termination in uniform dense population protocols. CoRR, Vol. abs\/1808.08913 (2018). arxiv: 1808.08913 https:\/\/arxiv.org\/abs\/1808.08913"},{"key":"e_1_3_2_1_14_1","volume-title":"Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time. In 32nd International Symposium on Distributed Computing, DISC 2018","author":"Doty David","year":"2018","unstructured":"David Doty , Mahsa Eftekhari , Othon Michail , Paul G. Spirakis , and Michail Theofilatos . 2018 a. Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time. In 32nd International Symposium on Distributed Computing, DISC 2018 , New Orleans, LA, USA , October 15-19, 2018. 46:1--46:3. David Doty, Mahsa Eftekhari, Othon Michail, Paul G. Spirakis, and Michail Theofilatos. 2018a. Brief Announcement: Exact Size Counting in Uniform Population Protocols in Nearly Logarithmic Time. In 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018. 46:1--46:3."},{"key":"e_1_3_2_1_15_1","volume-title":"Exact size counting in uniform population protocols in nearly logarithmic time. CoRR","author":"Doty David","year":"2018","unstructured":"David Doty , Mahsa Eftekhari , Othon Michail , Paul G. Spirakis , and Michail Theofilatos . 2018b. Exact size counting in uniform population protocols in nearly logarithmic time. CoRR , Vol. abs\/ 1805 .04832 ( 2018 ). arxiv: 1805.04832 https:\/\/arxiv.org\/abs\/1805.04832 David Doty, Mahsa Eftekhari, Othon Michail, Paul G. Spirakis, and Michail Theofilatos. 2018b. Exact size counting in uniform population protocols in nearly logarithmic time. CoRR, Vol. abs\/1805.04832 (2018). arxiv: 1805.04832 https:\/\/arxiv.org\/abs\/1805.04832"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-016-0281-z"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/110823018"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175286"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212788"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-016-0277-8"}],"event":{"name":"PODC '19: ACM Symposium on Principles of Distributed Computing","location":"Toronto ON Canada","acronym":"PODC '19","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293611.3331631","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3293611.3331631","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:26Z","timestamp":1750204466000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293611.3331631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,16]]},"references-count":20,"alternative-id":["10.1145\/3293611.3331631","10.1145\/3293611"],"URL":"https:\/\/doi.org\/10.1145\/3293611.3331631","relation":{},"subject":[],"published":{"date-parts":[[2019,7,16]]},"assertion":[{"value":"2019-07-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}