{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T17:07:34Z","timestamp":1776964054687,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1219274"],"award-info":[{"award-number":["1219274"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1162589"],"award-info":[{"award-number":["1162589"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1117143"],"award-info":[{"award-number":["1117143"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000057","name":"National Institute of General Medical Sciences","doi-asserted-by":"publisher","award":["P50 GM081879"],"award-info":[{"award-number":["P50 GM081879"]}],"id":[{"id":"10.13039\/100000057","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1618895"],"award-info":[{"award-number":["1618895"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s00446-016-0281-z","type":"journal-article","created":{"date-parts":[[2016,9,2]],"date-time":"2016-09-02T22:50:07Z","timestamp":1472856607000},"page":"257-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["Stable leader election in population protocols requires linear time"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3922-172X","authenticated-orcid":false,"given":"David","family":"Doty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Soloveichik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"key":"281_CR1","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Aspnes, J., Eisenstat, D., Gelashvili, R., Rivest, R.L.: Time-space trade-offs in molecular computation. Technical Report, \n                    arXiv:1602.08032\n                    \n                   (2016)","DOI":"10.1137\/1.9781611974782.169"},{"key":"281_CR2","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Gelashvili, R.: Polylogarithmic-time leader election in population protocols. In: ICALP 2015: Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming, Kyoto, Japan (2015)","DOI":"10.1007\/978-3-662-47666-6_38"},{"key":"281_CR3","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Gelashvili, R., Vojnovi\u0107, M.: Fast and exact majority in population protocols. In: PODC 2015: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pp. 47\u201356. ACM, New York (2015)","DOI":"10.1145\/2767386.2767429"},{"key":"281_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18, 235\u2013253 (2006). Preliminary version appeared in PODC (2004)","journal-title":"Distrib. Comput."},{"key":"281_CR5","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Urn automata. Technical Report YALEU\/DCS\/TR-1280, Yale University, November (2003)"},{"issue":"3","key":"281_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s00446-008-0067-z","volume":"21","author":"D Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. Distrib. Comput. 21(3), 183\u2013199 (2008). Preliminary version appeared in DISC (2006)","journal-title":"Distrib. Comput."},{"issue":"2","key":"281_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00446-008-0059-z","volume":"21","author":"D Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. Distrib. Comput. 21(2), 87\u2013102 (2008)","journal-title":"Distrib. Comput."},{"issue":"4","key":"281_CR8","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00446-007-0040-2","volume":"20","author":"D Angluin","year":"2007","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distrib. Comput. 20(4), 279\u2013304 (2007)","journal-title":"Distrib. Comput."},{"key":"281_CR9","first-page":"103","volume-title":"Lecture Notes in Computer Science","author":"Dana Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) Principles of Distributed Systems, pp. 103\u2013117. Springer, Berlin (2006)"},{"key":"281_CR10","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Beauquier, J., Burman, J., Sohier, D.: Time and space optimal counting in population protocols. \n                    http:\/\/www.cs.yale.edu\/homes\/aspnes\/papers\/one-bit-counting-abstract.html\n                    \n                   (2016)","DOI":"10.1007\/978-3-662-48653-5_42"},{"key":"281_CR11","first-page":"631","volume-title":"Lecture Notes in Computer Science","author":"Joffroy Beauquier","year":"2015","unstructured":"Beauquier, J., Burman, J., Clavi\u00e8re, S., Sohier, D.: Space-optimal counting in population protocols. In: DISC 2015: Proceedings of the 29th International Symposium on Distributed Computing, pp. 631\u2013646 (2015)"},{"key":"281_CR12","volume-title":"Computational Modeling of Genetic and Biochemical Networks","author":"JM Bower","year":"2004","unstructured":"Bower, J.M., Bolouri, H.: Computational Modeling of Genetic and Biochemical Networks. MIT Press, Cambridge (2004)"},{"key":"281_CR13","doi-asserted-by":"crossref","unstructured":"Chen, H.-L., Cummings, R., Doty, D., Soloveichik, D.: Speed faults in computation by chemical reaction networks. In: DISC 2014: Proceedings of the 28th International Symposium on Distributed Computing, Austin, TX, USA, pp. 16\u201330 (2014)","DOI":"10.1007\/978-3-662-45174-8_2"},{"issue":"10","key":"281_CR14","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1038\/nnano.2013.189","volume":"8","author":"Y-J Chen","year":"2013","unstructured":"Chen, Y.-J., Dalchau, N., Srinivas, N., Phillips, A., Cardelli, L., Soloveichik, D., Seelig, G.: Programmable chemical controllers made from DNA. Nat. Nanotechnol. 8(10), 755\u2013762 (2013)","journal-title":"Nat. Nanotechnol."},{"issue":"5","key":"281_CR15","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1111\/j.1600-0854.2009.00905.x","volume":"10","author":"In\u00eas Cunha-Ferreira","year":"2009","unstructured":"Cunha-Ferreira, I., Bento, I., Bettencourt-Dias, M.: From zero to many: control of centriole number in development and disease. Traffic 10(5), 482\u2013498 (2009)","journal-title":"Traffic"},{"issue":"4","key":"281_CR16","doi-asserted-by":"publisher","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"LE Dickson","year":"1913","unstructured":"Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with $$n$$ distinct prime factors. Am. J. Math. 35(4), 413\u2013422 (1913)","journal-title":"Am. J. Math."},{"key":"281_CR17","doi-asserted-by":"crossref","unstructured":"Doty, D.: Timing in chemical reaction networks. In: SODA 2014: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 772\u2013784 (2014)","DOI":"10.1137\/1.9781611973402.57"},{"key":"281_CR18","first-page":"602","volume-title":"Lecture Notes in Computer Science","author":"David Doty","year":"2015","unstructured":"Doty, D., Soloveichik, D.: Stable leader election in population protocols requires linear time. In: DISC 2015: Proceedings of the 29th International Symposium on Distributed Computing. Lecture Notes in Computer Science, pp. 602\u2013616. Springer, Berlin (2015)"},{"issue":"25","key":"281_CR19","doi-asserted-by":"publisher","first-page":"2340","DOI":"10.1021\/j100540a008","volume":"81","author":"DT Gillespie","year":"1977","unstructured":"Gillespie, D.T.: Exact stochastic simulation of coupled chemical reactions. J. Phys. Chem. 81(25), 2340\u20132361 (1977)","journal-title":"J. Phys. Chem."},{"key":"281_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2014.07.028","volume":"552","author":"T Izumi","year":"2014","unstructured":"Izumi, T., Kinpara, K., Izumi, T., Wada, K.: Space-efficient self-stabilizing counting population protocols on mobile sensor networks. Theor. Comput. Sci. 552, 99\u2013108 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"281_CR21","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"key":"281_CR22","unstructured":"Petri, C.A.: Communication with automata. Technical report, DTIC Document (1966)"},{"issue":"12","key":"281_CR23","doi-asserted-by":"publisher","first-page":"5393","DOI":"10.1073\/pnas.0909380107","volume":"107","author":"D Soloveichik","year":"2010","unstructured":"Soloveichik, D., Seelig, G., Winfree, E.: DNA as a universal substrate for chemical kinetics. Proc. Natl. Acad. Sci. 107(12), 5393 (2010). Preliminary version appeared in DNA 2008","journal-title":"Proc. Natl. Acad. Sci."},{"key":"281_CR24","first-page":"31","volume":"2","author":"V Volterra","year":"1926","unstructured":"Volterra, V.: Variazioni e fluttuazioni del numero dindividui in specie animali conviventi. Mem. Acad. Lincei Roma 2, 31\u2013113 (1926)","journal-title":"Mem. Acad. Lincei Roma"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-016-0281-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0281-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0281-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-016-0281-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T14:58:55Z","timestamp":1589641135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-016-0281-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,1]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["281"],"URL":"https:\/\/doi.org\/10.1007\/s00446-016-0281-z","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,1]]},"assertion":[{"value":"2 March 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}