{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:00:36Z","timestamp":1742943636862,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319268491"},{"type":"electronic","value":"9783319268507"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-26850-7_9","type":"book-chapter","created":{"date-parts":[[2016,2,20]],"date-time":"2016-02-20T04:14:46Z","timestamp":1455941686000},"page":"125-139","source":"Crossref","is-referenced-by-count":4,"title":["Homonym Population Protocols"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Bournez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johanne","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mika\u00ebl","family":"Rabie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,23]]},"reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","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":"9_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. 3560, pp. 63\u201374. Springer, Heidelberg (2005)"},{"key":"9_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: Twenty-Third ACM Symposium on Principles of Distributed Computing, pp. 290\u2013299. ACM Press (2004)","DOI":"10.1145\/1011767.1011810"},{"key":"9_CR4","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. 3974, pp. 103\u2013117. Springer, Heidelberg (2006)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Ar\u00e9valo, S., Fern\u00e1ndez Anta, A., Imbs, D., Jim\u00e9nez, E., Raynal, M.: Failure detectors in homonymous distributed systems (with an application to consensus). In: 2012 IEEE 32nd International Conference on Distributed Computing Systems (ICDCS), pp. 275\u2013284 (2012)","DOI":"10.1109\/ICDCS.2012.13"},{"key":"9_CR6","unstructured":"Aspnes, J., Ruppert, E.: An introduction to population protocols. In: Bulletin of the EATCS, vol. 93, pp. 106\u2013125 (2007)"},{"issue":"46","key":"9_CR7","doi-asserted-by":"publisher","first-page":"6469","DOI":"10.1016\/j.tcs.2011.07.001","volume":"412","author":"I Chatzigiannakis","year":"2011","unstructured":"Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., Spirakis, P.G.: Passively mobile communicating machines that use restricted space. Theoret. Comput. Sci. 412(46), 6469\u20136483 (2011). please check and confirm inserted volume number and page range is correct in Ref. [7]","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-16023-3_19","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"I Chatzigiannakis","year":"2010","unstructured":"Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Algorithmic verification of population protocols. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol. 6366, pp. 221\u2013235. Springer, Heidelberg (2010)"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kermarrec, A., Ruppert, E., Tran-The, H.: Byzantine agreement with homonyms. In: 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2011, pp. 21\u201330 (2011)","DOI":"10.1145\/1993806.1993810"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","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. 4026, pp. 51\u201366. Springer, Heidelberg (2006)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-31104-8_15","volume-title":"Structural Information and Communication Complexity","author":"C Delporte-Gallet","year":"2012","unstructured":"Delporte-Gallet, C., Fauconnier, H., Tran-The, H.: Homonyms with forgeable identifiers. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 171\u2013182. Springer, Heidelberg (2012)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-03089-0_22","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"GA Luna Di","year":"2013","unstructured":"Di Luna, G.A., Baldoni, R., Bonomi, S., Chatzigiannakis, I.: Counting the number of homonyms in dynamic networks. In: Higashino, T., Katayama, Y., Masuzawa, T., Potop-Butucaru, M., Yamashita, M. (eds.) SSS 2013. LNCS, vol. 8255, pp. 311\u2013325. Springer, Heidelberg (2013)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-642-02930-1_40","volume-title":"Automata, Languages and Programming","author":"R Guerraoui","year":"2009","unstructured":"Guerraoui, R., Ruppert, E.: Names trump malice: tiny mobile agents can tolerate byzantine failures. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 484\u2013495. Springer, Heidelberg (2009)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Immerman, N.: Nondeterministic space is closed under complementation. In: Structure in Complexity Theory Conference, Third Annual, pp. 112\u2013115. IEEE (1988)","DOI":"10.1109\/SCT.1988.5270"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1137\/0209036","volume":"9","author":"A Sch\u00f6nhage","year":"1980","unstructured":"Sch\u00f6nhage, A.: Storage modification machines. SIAM J. Comput. 9(3), 490\u2013508 (1980)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF00299636","volume":"26","author":"R Szelepcs\u00e9nyi","year":"1988","unstructured":"Szelepcs\u00e9nyi, R.: The method of forced enumeration for nondeterministic automata. Acta Inf. 26(3), 279\u2013284 (1988)","journal-title":"Acta Inf."}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26850-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:21:48Z","timestamp":1559388108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26850-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319268491","9783319268507"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26850-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}