Election, naming and cellular edge local computations (extended abstract)

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

Volumn 3256, Issue , 2004, Pages 242-256

  Chalopin, Jérémie ^a   Métivier, Yves ^a   Zielonka, Wieslaw ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

ALGORITHMIC PROBLEMS; LOCAL COMPUTATION; RELABELLING SYSTEMS;

ARTIFICIAL INTELLIGENCE;

EID: 33645593401     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30203-2_18     Document Type: Article

References (11)

1. D. Angluin. Local and global properties in networks of processors. In Proceedings of the 12th Symposium on Theory of Computing, pages 82-93, 1980.
2. H. Attiya and J. Welch. Distributed computing: fundamentals, simulations, and advanced topics. McGraw-Hill, 1998.
3. Paolo Boldi, Bruno Codenotti, Peter Gemmell, Sheila Shammah, Janos Simon, and Sebastiano Vigna. Symmetry breaking in anonymous networks: Characterizations. In Proc. 4th Israeli Symposium on Theory of Computing and Systems, pages 16-26. IEEE Press, 1996.
4. J. Chalopin and Y. Métivier. Election and local computations on edges (extended abstract). In Proc. of Foundations of Software Science and Computation Structures, FOSSACS'04, number 2987 in LNCS, pages 90-104, 2004.
5. E. Godard, Y. Métivier, and A. Muscholl. Characterization of Classes of Graphs Recognizable by Local Computations. Theory of Computing Systems, (37):249-293, 2004.
6. G. LeLann. Distributed systems: Towards a formal approach. In B. Gilchrist, editor, Information processing'77, pages 155-160. North-Holland, 1977.
7. N. A. Lynch. Distributed algorithms. Morgan Kaufman, 1996.
8. A. Mazurkiewicz. Distributed enumeration. Inf. Processing Letters, 61:233-239, 1997.
9. B. Szymanski, Y. Shy, and N. Prywes. Terminating iterative solutions of simultaneous equations in distributed message passing systems. In Proc. of the 4th Symposium of Distributed Computing, pages 287-292, 1985.
10. G. Tel. Introduction to distributed algorithms. Cambridge University Press, 2000.
11. M. Yamashita and T. Kameda. Computing on anonymous networks: Part i characterizing the solvable cases. IEEE Transactions on parallel and distributed systems, 7(l):69-89, 1996.