{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T18:02:47Z","timestamp":1791309767215,"version":"4.3.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,7,19]],"date-time":"2008-07-19T00:00:00Z","timestamp":1216425600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s00446-008-0067-z","type":"journal-article","created":{"date-parts":[[2008,7,18]],"date-time":"2008-07-18T07:11:46Z","timestamp":1216365106000},"page":"183-199","source":"Crossref","is-referenced-by-count":135,"title":["Fast computation by population protocols with a leader"],"prefix":"10.1007","volume":"21","author":[{"given":"Dana","family":"Angluin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James","family":"Aspnes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Eisenstat","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,7,19]]},"reference":[{"key":"67_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: Prasanna, V.K., Iyengar, S., Spirakis, P., Welsh, M. (eds.) Distributed Computing in Sensor Systems: First IEEE International Conference, DCOSS 2005, Marina del Rey, CA, USA, June\/July, 2005, Proceedings, vol. 3560 of Lecture Notes in Computer Science, pp. 63\u201374. Springer-Verlag, June 2005","DOI":"10.1007\/11502593_8"},{"key":"67_CR2","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Urn automata. Technical Report YALEU\/DCS\/TR-1280, Yale University Department of Computer Science, November (2003)"},{"key":"67_CR3","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: PODC \u201904: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, pp. 290\u2013299. ACM Press (2004)","DOI":"10.1145\/1011767.1011810"},{"issue":"4","key":"67_CR4","doi-asserted-by":"crossref","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.J., Peralta R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235\u2013253 (2006)","journal-title":"Distrib. Comput."},{"key":"67_CR5","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. In: Distributed Computing: 20th International Symposium, DISC 2006: Stockholm, Sweden, September 2006: Proceedings, pp. 61\u201375 (2006)","DOI":"10.1007\/11864219_5"},{"key":"67_CR6","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: Proceedings of the 25th ACM Symposium on Principles of Distributed Computing, pp. 292\u2013299, July (2006)","DOI":"10.1145\/1146381.1146425"},{"key":"67_CR7","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. In: Pelc, A. (ed.) Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, vol. 4731 of Lecture Notes in Computer Science, pp. 20\u201332. Springer (2007)","DOI":"10.1007\/978-3-540-75142-7_5"},{"key":"67_CR8","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. Distrib. Comput. (2008, submitted)","DOI":"10.1007\/s00446-008-0059-z"},{"key":"67_CR9","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: On the power of anonymous one-way communication. In: Ninth International Conference on Principles of Distributed Systems, pp. 307\u2013318, December 2005","DOI":"10.1007\/11795490_30"},{"issue":"4","key":"67_CR10","doi-asserted-by":"crossref","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":"67_CR11","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. In: Ninth International Conference on Principles of Distributed Systems, pp. 79\u201390, December 2005","DOI":"10.1007\/11795490_10"},{"key":"67_CR12","doi-asserted-by":"crossref","unstructured":"Angluin, D., Fischer, M.J., Jiang, H.: Stabilizing consensus in mobile networks. In: Proceedings of the Second IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS \u201906), pp. 37\u201350 (2006)","DOI":"10.1007\/11776178_3"},{"key":"67_CR13","doi-asserted-by":"crossref","unstructured":"Arora, A., Dolev, S., Gouda, M.G.: Maintaining digital clocks in step. In: Toueg, S., Spirakis, P.G., Kirousis, L.M. (eds.) Distributed Algorithms, 5th International Workshop, vol. 579 of Lecture Notes in Computer Science, pp. 71\u201379, Delphi, Greece. Springer-Verlag (1991)","DOI":"10.1142\/S0129626491000161"},{"key":"67_CR14","volume-title":"The Mathematical Theory of Infectious Diseases","author":"N.T.J. Bailey","year":"1975","unstructured":"Bailey N.T.J.: The Mathematical Theory of Infectious Diseases, 2nd edn. Charles Griffin & Co., London (1975)","edition":"2"},{"issue":"2","key":"67_CR15","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/312203.312207","volume":"17","author":"K.P. Birman","year":"1999","unstructured":"Birman K.P., Hayden M., Ozkasap O., Xiao Z., Budiu M., Minsky Y.: Bimodal multicast. ACM Trans. Comput. Syst. 17(2), 41\u201388 (1999)","journal-title":"ACM Trans. Comput. Syst."},{"key":"67_CR16","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1093\/imamat\/1.1.42","volume":"1","author":"D.J. Daley","year":"1965","unstructured":"Daley D.J., Kendall D.G.: Stochastic rumours. J. Inst. Math. Appl. 1, 42\u201355 (1965)","journal-title":"J. Inst. Math. Appl."},{"key":"67_CR17","doi-asserted-by":"crossref","unstructured":"Daliot, A., Dolev, D., Parnas, H.: Self-stabilizing pulse synchronization inspired by biological pacemaker networks. In: Huang, S.-T., Herman, T. (eds.) Self-Stabilizing Systems, vol. 2704 of Lecture Notes in Computer Science, pp. 32\u201348. Springer (2003)","DOI":"10.1007\/3-540-45032-7_3"},{"key":"67_CR18","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Ruppert, E.: When birds die: Making population protocols fault-tolerant. In: Proceedings of the Second IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS \u201906), pp. 51\u201366 (2006)","DOI":"10.1007\/11776178_4"},{"key":"67_CR19","doi-asserted-by":"crossref","unstructured":"Diamadi, Z., Fischer, M.J.: A simple game for the study of trust in distributed systems. Wuhan University J. Nat. Sci. 6(1\u20132): 72\u201382, March 2001. Also appears as Yale Technical Report TR\u20131207, January 2001","DOI":"10.1007\/BF03160228"},{"issue":"5","key":"67_CR20","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1145\/1017460.1017463","volume":"51","author":"S. Dolev","year":"2004","unstructured":"Dolev S., Welch J.L.: Self-stabilizing clock synchronization in the presence of Byzantine faults. J. ACM 51(5), 780\u2013799 (2004)","journal-title":"J. ACM"},{"key":"67_CR21","doi-asserted-by":"crossref","first-page":"1876","DOI":"10.1021\/jp993732q","volume":"104","author":"M.A. Gibson","year":"2000","unstructured":"Gibson M.A., Bruck J.: Efficient exact stochastic simulation of chemical systems with many species and many channels. J. Phys. Chem. A 104, 1876\u20131880 (2000)","journal-title":"J. Phys. Chem. A"},{"issue":"25","key":"67_CR22","doi-asserted-by":"crossref","first-page":"2340","DOI":"10.1021\/j100540a008","volume":"81","author":"D.T. 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":"67_CR23","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1016\/0378-4371(92)90283-V","volume":"188","author":"D.T. Gillespie","year":"1992","unstructured":"Gillespie D.T.: A rigorous derivation of the chemical master equation. Phys. A 188, 404\u2013425 (1992)","journal-title":"Phys. A"},{"key":"67_CR24","unstructured":"Guerraoui, R., Ruppert, E.: Even small birds are unique: Population protocols with identifiers. Technical Report CSE-2007-04, Department of Computer Science and Engineering, York University, (2007)"},{"issue":"10","key":"67_CR25","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1109\/71.888644","volume":"11","author":"T. Herman","year":"2000","unstructured":"Herman T.: Phase clocks for transient fault repair. IEEE Trans. Parallel Distrib. Syst. 11(10), 1048\u20131057 (2000)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"67_CR26","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/rsa.3240070105","volume":"7","author":"A.P. Kamath","year":"1995","unstructured":"Kamath A.P., Motwani R., Palem K., Spirakis P.: Tail bounds for occupancy and the satisfiability threshold conjecture. Random Struct. Algorithms 7, 59\u201380 (1995)","journal-title":"Random Struct. Algorithms"},{"key":"67_CR27","volume-title":"Computation: Finite and Infinite Machines. Prentice-Hall Series in Automatic Computation","author":"M.L. Minsky","year":"1967","unstructured":"Minsky M.L.: Computation: Finite and Infinite Machines. Prentice-Hall Series in Automatic Computation. Prentice-Hall, Inc., Englewood Cliffs, NJ (1967)"},{"key":"67_CR28","unstructured":"Presburger, M.: \u00dcber die Vollst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Comptes-Rendus du I Congr\u00e8s de Math\u00e9maticiens des Pays Slaves, pp. 92\u2013101, Warszawa (1929)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0067-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-008-0067-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0067-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T06:47:26Z","timestamp":1684478846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-008-0067-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,19]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["67"],"URL":"https:\/\/doi.org\/10.1007\/s00446-008-0067-z","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,19]]}}}