{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T15:32:18Z","timestamp":1774107138000,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T00:00:00Z","timestamp":1529452800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100005304","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["DESCARTES"],"award-info":[{"award-number":["DESCARTES"]}],"id":[{"id":"10.13039\/501100005304","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2015\/17\/B\/ST6\/01897"],"award-info":[{"award-number":["2015\/17\/B\/ST6\/01897"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,20]]},"DOI":"10.1145\/3188745.3188818","type":"proceedings-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T20:15:46Z","timestamp":1529525746000},"page":"87-99","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Universal protocols for information dissemination using emergent signals"],"prefix":"10.1145","author":[{"given":"Bart\u0142omiej","family":"Dudek","sequence":"first","affiliation":[{"name":"University of Wroc\u0142aw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[{"name":"Inria, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Mohammed Amin Abdullah and Moez Draief. 2012.  Mohammed Amin Abdullah and Moez Draief. 2012."},{"key":"e_1_3_2_1_2_1","volume-title":"CoRR abs\/1209.5025","author":"Random Majority Consensus","year":"2012"},{"key":"e_1_3_2_1_3_1","volume-title":"Rivest","author":"Alistarh Dan","year":"2017"},{"key":"e_1_3_2_1_4_1","unstructured":"Dan Alistarh James Aspnes and Rati Gelashvili. 2018.  Dan Alistarh James Aspnes and Rati Gelashvili. 2018."},{"key":"e_1_3_2_1_5_1","unstructured":"Space-Optimal Majority in Population Protocols See  { 16 } 2221\u20132239.   Space-Optimal Majority in Population Protocols See { 16 } 2221\u20132239."},{"key":"e_1_3_2_1_6_1","unstructured":"1\n   .9781611975031.144  1.9781611975031.144"},{"key":"e_1_3_2_1_7_1","volume-title":"DNA (Lecture Notes in Computer Science)","author":"Alistarh Dan"},{"key":"e_1_3_2_1_8_1","unstructured":"Dana Angluin James Aspnes Zo\u00eb Diamadi Michael J. Fischer and Ren\u00e9 Peralta. 2006.  Dana Angluin James Aspnes Zo\u00eb Diamadi Michael J. Fischer and Ren\u00e9 Peralta. 2006."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0138-3"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0067-z"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0059-z"},{"key":"e_1_3_2_1_12_1","unstructured":"Dana Angluin James Aspnes David Eisenstat and Eric Ruppert. 2007.  Dana Angluin James Aspnes David Eisenstat and Eric Ruppert. 2007."},{"key":"e_1_3_2_1_13_1","volume-title":"Distributed Computing 20, 4","author":"The","year":"2007"},{"key":"e_1_3_2_1_14_1","first-page":"98","article-title":"An Introduction to Population Protocols","volume":"93","author":"Aspnes James","year":"2007","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_1_15_1","unstructured":"Luca Becchetti Andrea E. F. Clementi Emanuele Natale Francesco Pasquale Riccardo Silvestri and Luca Trevisan. 2013.  Luca Becchetti Andrea E. F. Clementi Emanuele Natale Francesco Pasquale Riccardo Silvestri and Luca Trevisan. 2013."},{"key":"e_1_3_2_1_16_1","volume-title":"CoRR abs\/1310.2858","author":"Majority Consensus Simple Dynamics","year":"2013"},{"key":"e_1_3_2_1_17_1","unstructured":"Lucas Boczkowski. 2017. Personal communication.  Lucas Boczkowski. 2017. Personal communication."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Lucas Boczkowski Amos Korman and Emanuele Natale. 2017. Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits See { 30 } 2540\u20132559.   Lucas Boczkowski Amos Korman and Emanuele Natale. 2017. Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits See { 30 } 2540\u20132559.","DOI":"10.1137\/1.9781611974782.168"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32589-2_23"},{"key":"e_1_3_2_1_20_1","unstructured":"Colin Cooper Robert Els\u00e4sser and Tomasz Radzik. 2014.  Colin Cooper Robert Els\u00e4sser and Tomasz Radzik. 2014."},{"key":"e_1_3_2_1_21_1","volume-title":"Power of Two Choices in Distributed Voting. In Proc. 41st International Colloquium on Automata, Languages, and Programming, ICALP 2014","volume":"8573","author":"The"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2016.12.002"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018","author":"Ed Artur Czumaj","year":"2018"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47672-7_32"},{"key":"e_1_3_2_1_25_1","unstructured":"Alexander Dobrinevski and Erwin Frey. 2012.  Alexander Dobrinevski and Erwin Frey. 2012."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Extinction in neutrally stable stochastic Lotka-Volterra models. Phys. Rev. E 85 (May 2012) 051903. Issue 5.  Extinction in neutrally stable stochastic Lotka-Volterra models. Phys. Rev. E 85 (May 2012) 051903. Issue 5.","DOI":"10.1103\/PhysRevE.85.051903"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2011.09.050"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634131"},{"key":"e_1_3_2_1_29_1","volume-title":"International Symposium SIGAL \u201990","volume":"450","author":"Feige Uriel","year":"1990"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90059-9"},{"key":"e_1_3_2_1_31_1","unstructured":"Leszek Gasieniec and Grzegorz Stachowiak. 2018.  Leszek Gasieniec and Grzegorz Stachowiak. 2018."},{"key":"e_1_3_2_1_32_1","unstructured":"Fast Space Optimal Leader Election in Population Protocols See  { 16 } 2653\u20132667.  Fast Space Optimal Leader Election in Population Protocols See { 16 } 2653\u20132667."},{"key":"e_1_3_2_1_33_1","unstructured":"9781611975031.169  9781611975031.169"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933117"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature01259"},{"key":"e_1_3_2_1_36_1","volume-title":"Randomized Rumor Spreading. In 41st Annual Symposium on Foundations of Computer Science, FOCS 2000","author":"Karp Richard M.","year":"2000"},{"key":"e_1_3_2_1_37_1","volume-title":"Bohannan","author":"Kerr Benjamin","year":"2002"},{"key":"e_1_3_2_1_38_1","volume-title":"Riley","author":"Kirkup Benjamin C.","year":"2004"},{"key":"e_1_3_2_1_39_1","volume-title":"Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA","author":"Ed Philip N.","year":"2017"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"e_1_3_2_1_41_1","unstructured":"359563  359563"},{"key":"e_1_3_2_1_42_1","unstructured":"Christoph Lenzen Thomas Locher Philipp Sommer and Roger Wattenhofer. 2010.  Christoph Lenzen Thomas Locher Philipp Sommer and Roger Wattenhofer. 2010."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11266-9_5"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.10"},{"key":"e_1_3_2_1_45_1","unstructured":"Alfred J. Lotka. 1909.  Alfred J. Lotka. 1909."},{"key":"e_1_3_2_1_46_1","volume-title":"The Journal of Physical Chemistry 14, 3","author":"Periodic Reactions Contribution","year":"1909"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/800222.806738"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-016-0277-8"},{"key":"e_1_3_2_1_49_1","volume-title":"Spirakis","author":"Michail Othon","year":"2011"},{"key":"e_1_3_2_1_50_1","unstructured":"New Models for Population Protocols. Morgan & Claypool Publishers. S00328ED1V01Y201101DCT006  New Models for Population Protocols. Morgan & Claypool Publishers. S00328ED1V01Y201101DCT006"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0188-x"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.021129"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1137\/0147013"},{"key":"e_1_3_2_1_54_1","unstructured":"V. B. Priezzhev Deepak Dhar Abhishek Dhar and Supriya Krishnamurthy. 1996.  V. B. Priezzhev Deepak Dhar Abhishek Dhar and Supriya Krishnamurthy. 1996."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Eulerian Walkers as a Model of Self-Organized Criticality. Phys. Rev. Lett. 77 (Dec 1996) 5079\u20135082. Issue 25.  Eulerian Walkers as a Model of Self-Organized Criticality. Phys. Rev. Lett. 77 (Dec 1996) 5079\u20135082. Issue 25.","DOI":"10.1103\/PhysRevLett.77.5079"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.051907"},{"key":"e_1_3_2_1_57_1","unstructured":"Thomas Sauerwald. 2010.  Thomas Sauerwald. 2010."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9245-4"}],"event":{"name":"STOC '18: Symposium on Theory of Computing","location":"Los Angeles CA USA","acronym":"STOC '18","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188818","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3188745.3188818","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:09Z","timestamp":1750212429000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3188745.3188818"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,20]]},"references-count":58,"alternative-id":["10.1145\/3188745.3188818","10.1145\/3188745"],"URL":"https:\/\/doi.org\/10.1145\/3188745.3188818","relation":{},"subject":[],"published":{"date-parts":[[2018,6,20]]},"assertion":[{"value":"2018-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}