{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:38:30Z","timestamp":1725619110137},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642245497"},{"type":"electronic","value":"9783642245503"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24550-3_12","type":"book-chapter","created":{"date-parts":[[2011,10,8]],"date-time":"2011-10-08T06:56:37Z","timestamp":1318056997000},"page":"135-147","source":"Crossref","is-referenced-by-count":0,"title":["The Computational Power of Simple Protocols for Self-awareness on Graphs"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Chatzigiannakis","sequence":"first","affiliation":[]},{"given":"Othon","family":"Michail","sequence":"additional","affiliation":[]},{"given":"Stavros","family":"Nikolaou","sequence":"additional","affiliation":[]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"\u00c0lvarez, C., Chatzigiannakis, I., Duch, A., Gabarr\u00f3, J., Michail, O., Maria, S., Spirakis, P.G.: Computational models for networks of tiny artifacts: A survey. Computer Science Review, 5(1) (January 2011)","DOI":"10.1016\/j.cosrev.2010.09.001"},{"key":"12_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)"},{"key":"12_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. Distributed Computing, 235\u2013253 (March 2006)","DOI":"10.1007\/s00446-005-0138-3"},{"issue":"4","key":"12_CR4","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. Distributed Computing\u00a020(4), 279\u2013304 (2007)","journal-title":"Distributed Computing"},{"key":"12_CR5","first-page":"98","volume":"93","author":"J. Aspnes","year":"2007","unstructured":"Aspnes, J., Ruppert, E.: An introduction to population protocols. Bulletin of the EATCS\u00a093, 98\u2013117 (2007)","journal-title":"Bulletin of the EATCS"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-642-15155-2_25","volume-title":"Mathematical Foundations of Computer Science 2010","author":"I. Chatzigiannakis","year":"2010","unstructured":"Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., Spirakis, P.G.: All symmetric predicates in NSPACE(n\n                2) are stably computable by the mediated population protocol model. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 270\u2013281. Springer, Heidelberg (2010)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-02930-1_30","volume-title":"Automata, Languages and Programming","author":"I. Chatzigiannakis","year":"2009","unstructured":"Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Mediated population protocols. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 363\u2013374. Springer, Heidelberg (2009)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-16023-3_21","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"I. Chatzigiannakis","year":"2010","unstructured":"Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Stably decidable graph languages by mediated population protocols. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol.\u00a06366, pp. 252\u2013266. Springer, Heidelberg (2010)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/11945529_28","volume-title":"Principles of Distributed Systems","author":"M. Fischer","year":"2006","unstructured":"Fischer, M., Jiang, H.: Self-stabilizing leader election in networks of finite-state anonymous agents. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 395\u2013409. Springer, Heidelberg (2006)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, presburger formulas, and languages. Pacific Journal of Mathematics\u00a016, 285\u2013296 (1966)","journal-title":"Pacific Journal of Mathematics"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"2434","DOI":"10.1016\/j.tcs.2011.02.003","volume":"412","author":"O. Michail","year":"2011","unstructured":"Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Mediated population protocols. Theor. Comput. Sci.\u00a0412, 2434\u20132450 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Michail, O., Chatzigiannakis, I., Spirakis, P.G.: New Models for Population Protocols. In: Lynch, N.A. (ed.) Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool (2011)","DOI":"10.2200\/S00328ED1V01Y201101DCT006"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24550-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T10:14:05Z","timestamp":1554891245000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24550-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642245497","9783642245503"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24550-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}