{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T14:29:58Z","timestamp":1777904998785,"version":"3.51.4"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018781","name":"Leverhulme Research Centre for Functional Materials Design","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100018781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/P02002X\/1"],"award-info":[{"award-number":["EP\/P02002X\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1016\/j.ic.2021.104698","type":"journal-article","created":{"date-parts":[[2021,1,11]],"date-time":"2021-01-11T19:04:33Z","timestamp":1610391873000},"page":"104698","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"PA","title":["Simple and fast approximate counting and leader election in populations"],"prefix":"10.1016","volume":"285","author":[{"given":"Othon","family":"Michail","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michail","family":"Theofilatos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ic.2021.104698_br0010","series-title":"Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"2560","article-title":"Time-space trade-offs in population protocols","author":"Alistarh","year":"2017"},{"key":"10.1016\/j.ic.2021.104698_br0020","series-title":"42nd International Colloquium on Automata, Languages, and Programming (ICALP)","first-page":"479","article-title":"Polylogarithmic-time leader election in population protocols","volume":"vol. 9135","author":"Dan","year":"2015"},{"key":"10.1016\/j.ic.2021.104698_br0030","series-title":"Proceedings of the 12th Annual ACM Symposium on Theory of Computing (STOC)","first-page":"82","article-title":"Local and global properties in networks of processors","author":"Angluin","year":"1980"},{"issue":"4","key":"10.1016\/j.ic.2021.104698_br0040","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","article-title":"Computation in networks of passively mobile finite-state sensors","volume":"18","author":"Angluin","year":"2006","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.ic.2021.104698_br0050","series-title":"25th Annual ACM Symposium on Principles of Distributed Computing (PODC)","first-page":"292","article-title":"Stably computable predicates are semilinear","author":"Angluin","year":"2006"},{"issue":"3","key":"10.1016\/j.ic.2021.104698_br0060","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s00446-008-0067-z","article-title":"Fast computation by population protocols with a leader","volume":"21","author":"Angluin","year":"2008","journal-title":"Distrib. Comput."},{"issue":"4","key":"10.1016\/j.ic.2021.104698_br0070","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s00446-007-0040-2","article-title":"The computational power of population protocols","volume":"20","author":"Angluin","year":"2007","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.ic.2021.104698_br0080","series-title":"20th International Conference on Principles of Distributed Systems (OPODIS 2016)","article-title":"Time and space optimal counting in population protocols","volume":"vol. 70","author":"Aspnes","year":"2017"},{"key":"10.1016\/j.ic.2021.104698_br0090","series-title":"Middleware for Network Eccentric and Mobile Applications","first-page":"97","article-title":"An introduction to population protocols","author":"Aspnes","year":"2009"},{"issue":"4","key":"10.1016\/j.ic.2021.104698_br0100","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1145\/48014.48247","article-title":"Computing on an anonymous ring","volume":"35","author":"Attiya","year":"1988","journal-title":"J. ACM (JACM)"},{"key":"10.1016\/j.ic.2021.104698_br0110","series-title":"DISC 2015: International Symposium on Distributed Computing","first-page":"631","article-title":"Space-optimal counting in population protocols","author":"Beauquier","year":"2015"},{"key":"10.1016\/j.ic.2021.104698_br0120","series-title":"Distributed Computing","first-page":"63","article-title":"Self-stabilizing counting in mobile sensor networks with a base station","author":"Beauquier","year":"2007"},{"key":"10.1016\/j.ic.2021.104698_br0130","series-title":"44th International Colloquium on Automata, Languages, and Programming (ICALP)","article-title":"Hardness of computing and approximating predicates and functions with leaderless population protocols","volume":"vol. 80","author":"Belleville","year":"2017"},{"issue":"5","key":"10.1016\/j.ic.2021.104698_br0140","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1080\/17445760.2012.668546","article-title":"Time-varying graphs and dynamic networks","volume":"27","author":"Casteigts","year":"2012","journal-title":"Int. J. Parallel Emerg. Distrib. Syst."},{"issue":"46","key":"10.1016\/j.ic.2021.104698_br0150","doi-asserted-by":"crossref","first-page":"6469","DOI":"10.1016\/j.tcs.2011.07.001","article-title":"Passively mobile communicating machines that use restricted space","volume":"412","author":"Chatzigiannakis","year":"2011","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.ic.2021.104698_br0160","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/s11047-013-9393-6","article-title":"Deterministic function computation with chemical reaction networks","volume":"13","author":"Chen","year":"2014","journal-title":"Nat. Comput."},{"key":"10.1016\/j.ic.2021.104698_br0170","series-title":"International Conference on Theory and Applications of Models of Computation","first-page":"172","article-title":"Mediated population protocols: leader election and applications","author":"Das","year":"2017"},{"key":"10.1016\/j.ic.2021.104698_br0180","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.tcs.2018.09.005","article-title":"Population protocols with faulty interactions: the impact of a leader","volume":"754","author":"Di Luna","year":"2019","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2021.104698_br0190","series-title":"Proc. of the 25th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA)","first-page":"772","article-title":"Timing in chemical reaction networks","author":"Doty","year":"2014"},{"key":"10.1016\/j.ic.2021.104698_br0200","series-title":"32nd International Symposium on Distributed Computing (DISC 2018)","article-title":"Brief announcement: exact size counting in uniform population protocols in nearly logarithmic time","author":"Doty","year":"2018"},{"issue":"4","key":"10.1016\/j.ic.2021.104698_br0210","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s00446-016-0281-z","article-title":"Stable leader election in population protocols requires linear time","volume":"31","author":"Doty","year":"2018","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.ic.2021.104698_br0220","series-title":"OPODIS","article-title":"Self-stabilizing leader election in networks of finite-state anonymous agents","volume":"vol. 4305","author":"Fischer","year":"2006"},{"key":"10.1016\/j.ic.2021.104698_br0230","series-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"2653","article-title":"Fast space optimal leader election in population protocols","author":"Gasieniec","year":"2018"},{"key":"10.1016\/j.ic.2021.104698_br0240","series-title":"International Colloquium on Automata, Languages, and Programming (ICALP)","first-page":"484","article-title":"Names trump malice: tiny mobile agents can tolerate byzantine failures","author":"Guerraoui","year":"2009"},{"key":"10.1016\/j.ic.2021.104698_br0250","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.tcs.2014.07.028","article-title":"Space-efficient self-stabilizing counting population protocols on mobile sensor networks","volume":"552","author":"Izumi","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2021.104698_br0260","series-title":"Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC)","first-page":"513","article-title":"Distributed computation in dynamic networks","author":"Kuhn","year":"2010"},{"key":"10.1016\/j.ic.2021.104698_br0270","series-title":"IEEE 34th International Conference on Distributed Computing Systems (ICDCS)","article-title":"Counting in anonymous dynamic networks under worst-case adversary","author":"Di Luna","year":"2014"},{"issue":"5","key":"10.1016\/j.ic.2021.104698_br0280","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s00446-017-0309-z","article-title":"Terminating distributed construction of shapes and patterns in a fair solution of automata","volume":"31","author":"Othon","year":"2018","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.ic.2021.104698_br0290","series-title":"Synthesis Lectures on Distributed Computing Theory","article-title":"New models for population protocols","author":"Othon","year":"2011"},{"key":"10.1016\/j.ic.2021.104698_br0300","series-title":"15th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","first-page":"281","article-title":"Naming and counting in anonymous unknown dynamic networks","author":"Othon","year":"2013"},{"issue":"3","key":"10.1016\/j.ic.2021.104698_br0310","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s00446-015-0257-4","article-title":"Simple and efficient local codes for distributed stable network construction","volume":"29","author":"Othon","year":"2016","journal-title":"Distrib. Comput."},{"issue":"2","key":"10.1016\/j.ic.2021.104698_br0320","article-title":"Elements of the theory of dynamic networks","volume":"61","author":"Othon","year":"2018","journal-title":"Commun. ACM"},{"key":"10.1016\/j.ic.2021.104698_br0330","series-title":"International Colloquium on Structural Information and Communication Complexity","first-page":"38","article-title":"Brief announcement: fast approximate counting and leader election in populations","author":"Othon","year":"2018"},{"key":"10.1016\/j.ic.2021.104698_br0340","series-title":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","first-page":"154","article-title":"Simple and fast approximate counting and leader election in populations","author":"Othon","year":"2018"},{"issue":"6","key":"10.1016\/j.ic.2021.104698_br0350","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s00446-012-0173-9","article-title":"On space complexity of self-stabilizing leader election in mediated population protocol","volume":"25","author":"Mizoguchi","year":"2012","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.ic.2021.104698_br0360","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1007\/s11047-008-9067-y","article-title":"Computation with finite stochastic chemical reaction networks","author":"Soloveichik","year":"2008","journal-title":"Nat. Comput."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540121000134?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540121000134?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T12:35:56Z","timestamp":1777638956000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540121000134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5]]},"references-count":36,"alternative-id":["S0890540121000134"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2021.104698","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2022,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Simple and fast approximate counting and leader election in populations","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ic.2021.104698","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"104698"}}