{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,14]],"date-time":"2026-09-14T02:50:22Z","timestamp":1789354222336,"version":"build-2803163510"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540446248","type":"print"},{"value":"9783540446279","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11864219_5","type":"book-chapter","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T05:25:39Z","timestamp":1159939539000},"page":"61-75","source":"Crossref","is-referenced-by-count":36,"title":["Fast Computation by Population Protocols with a Leader"],"prefix":"10.1007","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","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/11502593_8","volume-title":"Distributed Computing in Sensor Systems","author":"D. Angluin","year":"2005","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.S., Spirakis, P.G., Welsh, M. (eds.) DCOSS 2005. LNCS, vol.\u00a03560, pp. 63\u201374. Springer, Heidelberg (2005)"},{"key":"5_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":"5_CR3","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1145\/1011767.1011810","volume-title":"PODC 2004: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing","author":"D. Angluin","year":"2004","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: PODC 2004: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, pp. 290\u2013299. ACM Press, New York (2004)"},{"issue":"4","key":"5_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.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing\u00a018(4), 235\u2013253 (2006)","journal-title":"Distributed Computing"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: PODC 2006 (July 2006) (to appear)","DOI":"10.1145\/1146381.1146425"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/11795490_30","volume-title":"Principles of Distributed Systems","author":"D. Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: On the power of anonymous one-way communication. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol.\u00a03974, pp. 396\u2013411. Springer, Heidelberg (2006)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/11795490_10","volume-title":"Principles of Distributed Systems","author":"D. 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.) OPODIS 2005. LNCS, vol.\u00a03974, pp. 103\u2013117. Springer, Heidelberg (2006)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11776178_3","volume-title":"Distributed Computing in Sensor Systems","author":"D. Angluin","year":"2006","unstructured":"Angluin, D., Fischer, M.J., Jiang, H.: Stabilizing consensus in mobile networks. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds.) DCOSS 2006. LNCS, vol.\u00a04026, pp. 37\u201350. Springer, Heidelberg (2006)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/BFb0022438","volume-title":"Distributed Algorithms","author":"A. Arora","year":"1992","unstructured":"Arora, A., Dolev, S., Gouda, M.G.: Maintaining digital clocks in step. In: Toueg, S., Kirousis, L.M., Spirakis, P.G. (eds.) WDAG 1991. LNCS, vol.\u00a0579, pp. 71\u201379. Springer, Heidelberg (1992)"},{"key":"5_CR10","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 and High Wycombe (1975)","edition":"2"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","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.\u00a017(2), 41\u201388 (1999)","journal-title":"ACM Trans. Comput. Syst."},{"key":"5_CR12","doi-asserted-by":"publisher","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. Journal of the Institute of Mathematics and its Applications\u00a01, 42\u201355 (1965)","journal-title":"Journal of the Institute of Mathematics and its Applications"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/3-540-45032-7_3","volume-title":"Self-Stabilizing Systems","author":"A. Daliot","year":"2003","unstructured":"Daliot, A., Dolev, D., Parnas, H.: Self-stabilizing pulse synchronization inspired by biological pacemaker networks. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol.\u00a02704, pp. 32\u201348. Springer, Heidelberg (2003)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11776178_4","volume-title":"Distributed Computing in Sensor Systems","author":"C. Delporte-Gallet","year":"2006","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Ruppert, E.: When birds die: Making population protocols fault-tolerant. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds.) DCOSS 2006. LNCS, vol.\u00a04026. Springer, Heidelberg (2006)"},{"issue":"1\u20132","key":"5_CR15","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/BF03160228","volume":"6","author":"Z. Diamadi","year":"2001","unstructured":"Diamadi, Z., Fischer, M.J.: A simple game for the study of trust in distributed systems. Wuhan University Journal of Natural Sciences\u00a06(1\u20132), 72\u201382 (2001); Also appears as Yale Technical Report TR\u20131207 (January 2001)","journal-title":"Wuhan University Journal of Natural Sciences"},{"issue":"5","key":"5_CR16","doi-asserted-by":"publisher","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. Journal of the ACM\u00a051(5), 780\u2013799 (2004)","journal-title":"Journal of the ACM"},{"key":"5_CR17","doi-asserted-by":"publisher","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. Journal of Physical Chemistry A\u00a0104, 1876\u20131880 (2000)","journal-title":"Journal of Physical Chemistry A"},{"issue":"25","key":"5_CR18","doi-asserted-by":"publisher","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. Journal of Physical Chemistry\u00a081(25), 2340\u20132361 (1977)","journal-title":"Journal of Physical Chemistry"},{"key":"5_CR19","doi-asserted-by":"publisher","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. Physica A\u00a0188, 404\u2013425 (1992)","journal-title":"Physica A"},{"issue":"10","key":"5_CR20","doi-asserted-by":"publisher","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 Transactions on Parallel and Distributed Systems\u00a011(10), 1048\u20131057 (2000)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"5_CR21","doi-asserted-by":"publisher","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 Structures and Algorithms\u00a07, 59\u201380 (1995)","journal-title":"Random Structures and Algorithms"},{"key":"5_CR22","series-title":"Prentice-Hall Series in Automatic Computation","volume-title":"Computation: Finite and Infinite Machines","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 (1967)"},{"key":"5_CR23","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, Warszawa, pp. 92\u2013101 (1929)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11864219_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:21:27Z","timestamp":1619508087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11864219_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540446248","9783540446279"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11864219_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}