{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T21:34:58Z","timestamp":1762032898544},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151545"},{"type":"electronic","value":"9783642151552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_25","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T20:17:45Z","timestamp":1281730665000},"page":"270-281","source":"Crossref","is-referenced-by-count":7,"title":["All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model"],"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":"Andreas","family":"Pavlogiannis","sequence":"additional","affiliation":[]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_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. Distributed Computing, 235\u2013253 (March 2006)","DOI":"10.1007\/s00446-005-0138-3"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1145\/1146381.1146425","volume-title":"PODC 2006: Proceedings of the 25th annual ACM Symposium on Principles of Distributed Computing","author":"D. Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: PODC 2006: Proceedings of the 25th annual ACM Symposium on Principles of Distributed Computing, pp. 292\u2013299. ACM Press, New York (2006)"},{"key":"25_CR3","first-page":"98","volume":"93","author":"J. Aspnes","year":"2007","unstructured":"Aspnes, J., Ruppert, E.: An introduction to population protocols. Bulletin of the European Association for Theoretical Computer Science\u00a093, 98\u2013117 (2007)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"25_CR4","unstructured":"Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., Spirakis, P.G.: All symmetric predicates in NSPACE(n2) are stably computable by the mediated population protocol model. Technical Report FRONTS-TR-2010-17, RACTI (2010), \n                  \n                    http:\/\/fronts.cti.gr\/aigaion\/?TR=155"},{"key":"25_CR5","unstructured":"Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A., Spirakis, P.G.: Passively mobile communicating logarithmic space machines. Technical Report FRONTS-TR-2010-16, RACTI (2010), \n                  \n                    http:\/\/fronts.cti.gr\/aigaion\/?TR=154\n                  \n                  \n                , CoRR. \n                  \n                    http:\/\/arxiv.org\/abs\/1004.3395"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-04355-0_24","volume-title":"Distributed Computing","author":"I. Chatzigiannakis","year":"2009","unstructured":"Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Brief announcement: Decidable graph languages by mediated population protocols. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 239\u2013240. Springer, Heidelberg (2009)"},{"key":"25_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":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-642-03816-7_6","volume-title":"Mathematical Foundations of Computer Science 2009","author":"I. Chatzigiannakis","year":"2009","unstructured":"Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Recent advances in population protocols. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 56\u201376. Springer, Heidelberg (2009)"},{"key":"25_CR9","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.\u00a04026, pp. 51\u201366. Springer, Heidelberg (2006)"},{"key":"25_CR10","doi-asserted-by":"crossref","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":"25_CR11","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.\u00a05556, pp. 484\u2013495. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:01:37Z","timestamp":1606186897000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}