Fast computation by population protocols with a leader

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

Volumn 4167 LNCS, Issue , 2006, Pages 61-75

  Angluin, Dana ^a   Aspnes, James ^a   Eisenstat, David ^b  

^a YALE UNIVERSITY   (United States)

^b Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; MATHEMATICAL MODELS; PROBABILITY;

FAST ALGORITHMS; FINITE-STATE AGENTS; POPULATION PROTOCOL MODEL; VIRTUAL REGISTER MACHINE;

COMPUTER SCIENCE;

EID: 33845222685     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11864219_5     Document Type: Conference Paper

References (24)

1. Dana Angluin, James Aspnes, Melody Chan, Michael J. Fischer, Hong Jiang, and René Peralta. Stably computable properties of network graphs. In Viktor K. Prasanna, Sitharama lyengar, Paul Spirakis, and Matt Welsh, editors, Distributed Computing in Sensor Systems: First IEEE International Conference, DCOSS 2005, Marina del Key, CA, USA, June/July, 2005, Proceedings, volume 3560 of Lecture Notes in Computer Science, pages 63-74. Springer-Verlag, June 2005.
2. Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, and René Peralta. Urn automata. Technical Report YALEU/DCS/TR-1280, Yale University Department of Computer Science, November 2003.
3. Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, and René Peralta. Computation in networks of passively mobile finite-state sensors. In PODC '04: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, pages 290-299. ACM Press, 2004.
4. Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, and René Peralta. Computation in networks of passively mobile finite-state sensors. Distributed Computing, 18(4):235-253, March 2006.
5. Dana Angluin, James Aspnes, and David Eisenstat. Stably computable predicates are semilinear. To appear, PODC 2006, July 2006.
6. Dana Angluin, James Aspnes, David Eisenstat, and Eric Ruppert. On the power of anonymous one-way communication. In Ninth International Conference on Principles of Distributed Systems, pages 307-318, December 2005.
7. Dana Angluin, James Aspnes, Michael J. Fischer, and Hong Jiang. Self-stabilizing population protocols. In Ninth International Conference on Principles of Distributed Systems, pages 79-90, December 2005.
8. Dana Angluin, Michael J. Fischer, and Hong Jiang. Stabilizing consensus in mobile networks. To appear in Proc. International Conference on Distributed Computing in Sensor Systems (DCOSS06), June 2006.
9. Anish Arora, Shlomi Dolev, and Mohamed G. Gouda. Maintaining digital clocks in step. In Sam Toueg, Paul G. Spirakis, and Lefteris M. Kirousis, editors, Distributed Algorithms, 5th International Workshop, volume 579 of Lecture Notes in Computer Science, pages 71-79, Delphi, Greece, 1991. Springer-Verlag.
10. Norman T. J. Bailey. The Mathematical Theory of Infectious Diseases, Second Edition. Charles Griffin & Co., London and High Wycombe, 1975.
11. Kenneth P. Birman, Mark Hayden, Oznur Ozkasap, Zhen Xiao, Mihai Budiu, and Yaron Minsky. Bimodal multicast. ACM Trans. Comput. Syst., 17(2):41-88, 1999.
12. D. J. Daley and D. G. Kendall. Stochastic rumours. Journal of the Institute of Mathematics and its Applications, 1:42-55, 1965.
13. Ariel Daliot, Danny Dolev, and Hanna Parnas. Self-stabilizing pulse synchronization inspired by biological pacemaker networks. In Shing-Tsaan Huang and Ted Herman, editors, Self-Stabilizing Systems, volume 2704 of Lecture Notes in Computer Science, pages 32-48. Springer, 2003.
14. Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, and Eric Ruppert. When birds die: Making population protocols fault-tolerant. To appear in Proc. International Conference on Distributed Computing in Sensor Systems (DCOSS06), June 2006.
15. Zoë Diamadi and Michael J. Fischer. A simple game for the study of trust in distributed systems. Wuhan University Journal of Natural Sciences, 6(1-2):72-82, March 2001.
16. Also appears as Yale Technical Report TR-1207, January 2001.
17. Shlomi Dolev and Jennifer L. Welch. Self-stabilizing clock synchronization in the presence of Byzantine faults. Journal of the ACM, 51(5):780-799, 2004.
18. Michael A. Gibson and Jehoshua Bruck. Efficient exact stochastic simulation of chemical systems with many species and many channels. Journal of Physical Chemistry A, 104:1876-1880,2000.
19. Daniel T. Gillespie. Exact stochastic simulation of coupled chemical reactions. Journal of Physical Chemistry, 81(25):2340-2361, 1977.
20. Daniel T. Gillespie. A rigorous derivation of the chemical master equation. Physica A, 188:404-425, 1992.
21. Ted Herman. Phase clocks for transient fault repair. IEEE Transactions on Parallel and Distributed Systems, 11(10):1048-1057, 2000.
22. A. P. Kamath, R. Motwani, K. Palem, and P. Spirakis. Tail bounds for occupancy and the satisfiability threshold conjecture. Random Structures and Algorithms, 7:59-80, 1995.
23. M. L. Minsky. Computation: Finite and Infinite Machines. Prentice-Hall Series in Automatic Computation. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1967.
24. Mojzesz Presburger. Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In Comptes-Rendus du 1 Congrès de Mathématiciens des Pays Slaves, pages 92-101, Warszawa, 1929.