{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T12:05:58Z","timestamp":1779451558372,"version":"3.53.1"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T00:00:00Z","timestamp":1778198400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.tcs.2026.116010","type":"journal-article","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T23:28:15Z","timestamp":1778282895000},"page":"116010","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The expressive power of population protocols with logarithmic space"],"prefix":"10.1016","volume":"1078","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1786-9592","authenticated-orcid":false,"given":"Philipp","family":"Czerner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-3071-0736","authenticated-orcid":false,"given":"Vincent","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6140-6707","authenticated-orcid":false,"given":"Roland","family":"Guttenberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116010_bib0001","series-title":"PODC 2004","first-page":"290","article-title":"Computation in networks of passively mobile finite-state sensors","author":"Angluin","year":"2004"},{"issue":"4","key":"10.1016\/j.tcs.2026.116010_bib0002","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1007\/s11047-008-9067-y","article-title":"Computation with finite stochastic chemical reaction networks","volume":"7","author":"Soloveichik","year":"2008","journal-title":"Nat. Comput."},{"key":"10.1016\/j.tcs.2026.116010_bib0003","series-title":"DISC","first-page":"61","article-title":"Fast computation by population protocols with a leader","volume":"volume 4167","author":"Angluin","year":"2006"},{"issue":"4","key":"10.1016\/j.tcs.2026.116010_bib0004","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":"Distributed Comput."},{"key":"10.1016\/j.tcs.2026.116010_bib0005","series-title":"DISC","first-page":"602","article-title":"Stable leader election in population protocols requires linear time","volume":"volume 9363","author":"Doty","year":"2015"},{"key":"10.1016\/j.tcs.2026.116010_bib0006","series-title":"ICALP","first-page":"141:1","article-title":"Hardness of computing and approximating predicates and functions with leaderless population protocols","volume":"volume 80","author":"Belleville","year":"2017"},{"key":"10.1016\/j.tcs.2026.116010_bib0007","series-title":"SODA 2017","first-page":"2560","article-title":"Time-space trade-offs in population protocols","author":"Alistarh","year":"2017"},{"key":"10.1016\/j.tcs.2026.116010_bib0008","series-title":"STOC","first-page":"119","article-title":"Optimal time and space leader election in population protocols","author":"Berenbrink","year":"2020"},{"key":"10.1016\/j.tcs.2026.116010_bib0009","series-title":"FOCS","first-page":"1044","article-title":"A time and space optimal stable population protocol solving exact majority","author":"Doty","year":"2021"},{"key":"10.1016\/j.tcs.2026.116010_bib0010","series-title":"PODC","first-page":"47","article-title":"Fast and exact majority in population protocols","author":"Alistarh","year":"2015"},{"issue":"3","key":"10.1016\/j.tcs.2026.116010_bib0011","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/3289137.3289150","article-title":"Recent algorithmic advances in population protocols","volume":"49","author":"Alistarh","year":"2018","journal-title":"SIGACT News"},{"key":"10.1016\/j.tcs.2026.116010_bib0012","article-title":"Recent results in population protocols for exact majority and leader election","volume":"126","author":"Els\u00e4sser","year":"2018","journal-title":"Bull. EATCS"},{"issue":"2","key":"10.1016\/j.tcs.2026.116010_bib0013","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00446-020-00385-0","article-title":"Time-space trade-offs in population protocols for the majority problem","volume":"34","author":"Berenbrink","year":"2021","journal-title":"Distributed Comput."},{"key":"10.1016\/j.tcs.2026.116010_bib0014","series-title":"DISC","first-page":"46:1","article-title":"Brief announcement: exact size counting in uniform population protocols in nearly logarithmic time","volume":"121","author":"Doty","year":"2018"},{"key":"10.1016\/j.tcs.2026.116010_bib0015","series-title":"PODC","first-page":"34","article-title":"Efficient size estimation and impossibility of termination in uniform dense population protocols","author":"Doty","year":"2019"},{"key":"10.1016\/j.tcs.2026.116010_bib0016","series-title":"PODC","first-page":"43","article-title":"On counting the population size","author":"Berenbrink","year":"2019"},{"key":"10.1016\/j.tcs.2026.116010_bib0017","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.tcs.2021.08.038","article-title":"A survey of size counting in population protocols","volume":"894","author":"Doty","year":"2021","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.116010_bib0018","series-title":"SAND","first-page":"13:1","article-title":"Dynamic size counting in population protocols","volume":"volume 221","author":"Doty","year":"2022"},{"issue":"46","key":"10.1016\/j.tcs.2026.116010_bib0019","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":"5","key":"10.1016\/j.tcs.2026.116010_bib0020","doi-asserted-by":"crossref","first-page":"1318","DOI":"10.1007\/s00224-017-9833-2","article-title":"Homonym population protocols","volume":"62","author":"Bournez","year":"2018","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"10.1016\/j.tcs.2026.116010_bib0021","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01694011","article-title":"Counter machines and counter languages","volume":"2","author":"Fischer","year":"1968","journal-title":"Math. Syst. Theory"},{"key":"10.1016\/j.tcs.2026.116010_bib0022","series-title":"Automata, Languages, and Programming","first-page":"479","article-title":"Polylogarithmic-Time leader election in population protocols","author":"Alistarh","year":"2015"},{"key":"10.1016\/j.tcs.2026.116010_bib0023","series-title":"Space-Optimal Majority in Population Protocols","first-page":"2221","author":"Alistarh","year":"2018"},{"key":"10.1016\/j.tcs.2026.116010_bib0024","series-title":"CONCUR","first-page":"31:1","article-title":"Expressive power of broadcast consensus protocols","volume":"volume 140","author":"Blondin","year":"2019"},{"issue":"5","key":"10.1016\/j.tcs.2026.116010_bib0025","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complementation","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.tcs.2026.116010_bib0026","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","article-title":"The method of forced enumeration for nondeterministic automata","volume":"26","author":"Szelepcs\u00e9nyi","year":"1988","journal-title":"Acta Inform."},{"issue":"2","key":"10.1016\/j.tcs.2026.116010_bib0027","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s00236-016-0272-3","article-title":"Verification of population protocols","volume":"54","author":"Esparza","year":"2017","journal-title":"Acta Inform."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002604?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002604?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:13:25Z","timestamp":1779448405000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002604"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":27,"alternative-id":["S0304397526002604"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116010","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The expressive power of population protocols with logarithmic space","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116010","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"116010"}}