Recent Advances in Population Protocols

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

Volumn 5734 LNCS, Issue , 2009, Pages 56-76

  Chatzigiannakis, Ioannis ^a,b   Michail, Othon ^a,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; COMMUNICATION LINKS; FINITE-STATE; NEW PROTOCOL; PROTOCOL MODEL; SIMPLIFIED MODELS;

COMPUTER SCIENCE; GRAPH THEORY; MOBILE AGENTS; PUMPING PLANTS; SENSOR NETWORKS;

WIRELESS NETWORKS;

EID: 70349329519     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03816-7_6     Document Type: Conference Paper

References (16)

1. 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-74. Springer, Heidelberg (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, New York (2004)
3. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing 18(4), 235-253 (2006)
4. Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. Distributed Computing 21(3), 183-199 (2008)
5. 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)
6. Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distributed Computing 20(4), 279-304 (2007)
7. 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
8. Beauquier, J., Clement, J., Messika, S., Rosaz, L., Rozoy, B.: Self-stabilizing counting in mobile sensor networks. Technical Report 1470, LRI, Université Paris-Sud 11 (2007)
9. 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)
10. 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)
11. Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Decidable Graph Languages by Mediated Population Protocols. FRONTS Technical Report FRONTS-TR-2009-2016 ( May 2009, http://fronts.cti.gr/aigaion/?TR=80
12. Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Experimental veri.cation and performance study of extremely large sized population protocols. FRONTS Technical Report FRONTS-TR-2009-2013 (January 2009, http://fronts.cti. gr/aigaion/?TR=61
13. 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, To appear in 36th International Colloquium on Automata, Languages and Programming (ICALP), Rhodes, Greece, July 5-12 (2009)
14. 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-66. Springer, Heidelberg (2006)
15. Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics 16, 285-296 (1966)
16. Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)