{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:17:38Z","timestamp":1743110258915,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029295"},{"type":"electronic","value":"9783642029301"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02930-1_30","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T15:05:04Z","timestamp":1246547104000},"page":"363-374","source":"Crossref","is-referenced-by-count":15,"title":["Mediated Population Protocols"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Chatzigiannakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Othon","family":"Michail","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: Proc. Distributed Computing in Sensor Systems: 1st IEEE International Conference, pp. 63\u201374 (2005)","DOI":"10.1007\/11502593_8"},{"key":"30_CR2","first-page":"290","volume-title":"23rd Annual ACM Sympsium on Principles of Distributed Computing (PODC)","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: 23rd Annual ACM Sympsium on Principles of Distributed Computing (PODC), pp. 290\u2013299. ACM Press, New York (2004)"},{"issue":"3","key":"30_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s00446-008-0067-z","volume":"21","author":"D. Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. Distributed Computing\u00a021(3), 183\u2013199 (2008)","journal-title":"Distributed Computing"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: Proc. 25th Annual ACM Symposium on Principles of Distributed Computing, pp. 292\u2013299 (2006)","DOI":"10.1145\/1146381.1146425"},{"key":"30_CR5","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); Mavronicolas, M. (ed.). Columns: Distributed Computing","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Bournez, O., Chassaing, P., Cohen, J., Gerin, L., Koegler, X.: On the convergence of population protocols when population goes to infinity. To appear in Applied Mathematics and Computation (2009)","DOI":"10.1016\/j.amc.2009.04.056"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Experimental verification and performance study of extremely large sized population protocols. FRONTS Technical Report FRONTS-TR-2009-3 (January 2009), http:\/\/fronts.cti.gr\/aigaion\/?TR=61","DOI":"10.1007\/978-3-642-03816-7_6"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Mediated Population Protocols. FRONTS Technical Report FRONTS-TR-2009-8 (February 2009), http:\/\/fronts.cti.gr\/aigaion\/?TR=65","DOI":"10.1007\/978-3-642-02930-1_30"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-540-87779-0_35","volume-title":"Distributed Computing","author":"I. Chatzigiannakis","year":"2008","unstructured":"Chatzigiannakis, I., Spirakis, P.G.: The dynamics of probabilistic population protocols. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 498\u2013499. Springer, Heidelberg (2008)"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-540-73420-8_22","volume-title":"Automata, Languages and Programming","author":"P. Fraigniaud","year":"2007","unstructured":"Fraigniaud, P., Gavoille, C., Ilcinkas, D., Pelc, A.: Distributed computing with advice: Information sensitivity of graph coloring. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 231\u2013242. Springer, Heidelberg (2007)"},{"issue":"5","key":"30_CR11","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0217058","volume":"17","author":"N. Immerman","year":"1988","unstructured":"Immerman, N.: Nondeterministic space is closed under complementation. SIAM J. Comput.\u00a017(5), 935\u2013938 (1988); (see also page 153 C. H. Papadimitriou \u201cComputational Complexity\u201d)","journal-title":"SIAM J. Comput."},{"key":"30_CR12","first-page":"177","volume":"4","author":"W.J. Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationship between nondeterministic and deterministic tape classes. J. CSS\u00a04, 177\u2013192 (1970) (see also page 149-150 C. H. Papadimitriou \u201cComputational Complexity\u201d)","journal-title":"J. CSS"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02930-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T21:38:13Z","timestamp":1685050693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}