{"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":1789354222347,"version":"build-2803163510"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540363217","type":"print"},{"value":"9783540363224","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11795490_10","type":"book-chapter","created":{"date-parts":[[2007,1,23]],"date-time":"2007-01-23T07:25:18Z","timestamp":1169537118000},"page":"103-117","source":"Crossref","is-referenced-by-count":36,"title":["Self-stabilizing Population Protocols"],"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":"Michael J.","family":"Fischer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hong","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","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: Twenty-Third ACM Symposium on Principles of Distributed Computing, pp. 290\u2013299 (2004)","DOI":"10.1145\/1011767.1011810"},{"key":"10_CR2","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)"},{"issue":"11","key":"10_CR3","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"Communications of the ACM"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Mayer, A., Ofek, Y., Ostrovsky, R., Yung, M.: Self-stabilizing symmetry breaking in constant-space (extended abstract). In: Proc. 24th ACM Symp. on Theory of Computing, pp. 667\u2013678 (1992)","DOI":"10.1145\/129712.129777"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Itkis, G., Lin, C., Simon, J.: Deterministic, constant space, self-stabilizing leader election on uniform rings. In: Workshop on Distributed Algorithms, pp. 288\u2013302 (1995)","DOI":"10.1007\/BFb0022154"},{"key":"10_CR6","unstructured":"Higham, L., Myers, S.: Self-stabilizing token circulation on anonymous message passing rings. Technical report, University of Calgary (1999)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Johnen, C.: Bounded service time and memory space optimal self-stabilizing token circulation protocol on unidirectional rings. In: Procedings of the 18th International Parallel and Distributed Processing Symposium, p. 52a (2004)","DOI":"10.1109\/IPDPS.2004.1302973"},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0020-0190(90)90107-9","volume":"35","author":"T. Herman","year":"1990","unstructured":"Herman, T.: Probabilistic self-stabilization. Information Processing Letters\u00a035(2), 63\u201367 (1990)","journal-title":"Information Processing Letters"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1109\/71.588622","volume":"8","author":"S. Dolev","year":"1997","unstructured":"Dolev, S., Israeli, A., Moran, S.: Uniform dynamic self-stabilizing leader election. IEEE Transactions on Parallel and Distributed Systems\u00a08, 424\u2013440 (1997)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Beauquier, J., Gradinariu, M., Johnen, C.: Memory space requirements for self-stabilizing leader election protocols. In: Eighteenth ACM Symposium on Principles of Distributed Computing, pp. 199\u2013207 (1999)","DOI":"10.1145\/301308.301358"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1109\/SFCS.1994.365691","volume-title":"Proceeding of 35th Annual Symposium on Foundations of Computer Science","author":"G. Itkis","year":"1994","unstructured":"Itkis, G., Levin, L.A.: Fast and lean self-stabilizing asynchronous protocols. In: Proceeding of 35th Annual Symposium on Foundations of Computer Science, pp. 226\u2013239. IEEE Press, Los Alamitos (1994)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"J.R. Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labeling graphs with a condition at distance two. Journal of Discrete Mathematics\u00a05, 586\u2013595 (1992)","journal-title":"Journal of Discrete Mathematics"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-27820-7_6","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"T. Herman","year":"2004","unstructured":"Herman, T., Tixeuil, S.: A distributed TDMA slot assignment algorithm for wireless sensor networks. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2004. LNCS, vol.\u00a03121, pp. 45\u201358. Springer, Heidelberg (2004)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/3-540-44681-8_67","volume-title":"Euro-Par 2001 Parallel Processing","author":"M. Gradinariu","year":"2001","unstructured":"Gradinariu, M., Johnen, C.: Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler. In: Sakellariou, R., Keane, J.A., Gurd, J.R., Freeman, L. (eds.) Euro-Par 2001. LNCS, vol.\u00a02150, pp. 458\u2013465. Springer, Heidelberg (2001)"},{"key":"10_CR15","first-page":"39","volume-title":"Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures","author":"T. Moscibroda","year":"2005","unstructured":"Moscibroda, T., Wattenhofer, R.: Coloring unstructured radio networks. In: Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures, pp. 39\u201348. ACM Press, New York (2005)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11795490_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T23:23:33Z","timestamp":1552346613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11795490_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540363217","9783540363224"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11795490_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}