Mediated population protocols

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5556 LNCS, Issue PART 2, 2009, Pages 363-374

  Chatzigiannakis, Ioannis ^a,b   Michail, Othon ^b   Spirakis, Paul G ^a,b  

^a Univ of Patras   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION GRAPHS; DIRECTED GRAPHS; EXTENDED MODEL; GRAPH PROPERTIES; MAXIMAL MATCHINGS; POPULATION SIZES; PROTOCOL MODEL; PROTOCOL SPECIFICATIONS; SEMILINEAR; TRANSITIVE CLOSURE;

GRAPH THEORY; LINGUISTICS; MOBILE AGENTS; POPULATION STATISTICS; THEOREM PROVING; TRANSLATION (LANGUAGES);

WIRELESS NETWORKS;

EID: 70449131082     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02930-1_30     Document Type: Conference Paper

References (14)

1. 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-74 (2005)
2. 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-299. ACM Press, New York (2004)
3. Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. Distributed Computing 21(3), 183-199 (2008)
4. Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: Proc. 25th Annual ACM Symposium on Principles of Distributed Computing, pp. 292-299 (2006)
5. Aspnes, J., Ruppert, E.: An introduction to population protocols. Bulletin of the European Association for Theoretical Computer Science 93, 98-117 (2007); Mavronicolas, M. (ed.). Columns: Distributed Computing
6. 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)
7. 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
8. 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
9. Chatzigiannakis, I., Spirakis, P.G.: The dynamics of probabilistic population protocols. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 498-499. Springer, Heidelberg (2008)
10. Fraigniaud, P., Gavoille, C., Ilcinkas, D., Pelc, A.: Distributed computing with advice: Information sensitivity of graph coloring. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 231-242. Springer, Heidelberg (2007)
11. Immerman, N.: Nondeterministic space is closed under complementation. SIAM J. Comput. 17(5), 935-938 (1988);
12. (see also page 153 C. H. Papadimitriou "Computational Complexity")
13. Savitch, W.J.: Relationship between nondeterministic and deterministic tape classes. J. CSS 4, 177-192 (1970)
14. (see also page 149-150 C. H. Papadimitriou "Computational Complexity")