Election and local computations on edges (extended abstract)

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

Volumn 2987, Issue , 2004, Pages 90-104

  Chalopin, Jérémie ^a   Métivier, Yves ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EXTENDED ABSTRACTS; LOCAL COMPUTATION;

ARTIFICIAL INTELLIGENCE;

EID: 33645596856     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24727-2_8     Document Type: Article

References (23)

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. P. Boldi, B. Codenotti, P. Gemmell, S. Shamrnah, J. Simon, and S. 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. P. Boldi and S. Vigna. Computing anonymously with arbitrary knowledge. In Proceedings of the 18th ACM Symposium on principles of distributed computing, pages 181-188. ACM Press, 1999.
5. P. Boldi and S. Vigna. An effective characterization of computability in anonymous networks. In Jennifer L. Welch, editor, Distributed Computing. 15th International Conference, DISC 2001, volume 2180 of Lecture Notes in Computer Science, pages 33-47. Springer-Verlag, 2001.
6. P. Boldi and S. Vigna. Fibrations of graphs. Discrete Math., 243:21-66, 2002.
7. E. Godard and Y. Métivier. A characterization of families of graphs in which election is possible (ext. abstract). In M. Nielsen and U. Engberg, editors, Proc. of Foundations of Software Science and Computation Structures, FOSSACS'02, number 2303 in LNCS, pages 159-171. Springer-Verlag, 2002.
8. E. Godard, Y. Métivier, and A. Muscholl. Characterization of Classes of Graphs Recognizable by Local Computations. Theory of Computing Systems, to appear.
9. E. Godard, Y. Métivier, and G. Tel. Election, termination and graph cartography, in preparation.
10. G. LeLann. Distributed systems: Towards a formal approach. In B. Gilchrist, editor, Information processing'77, pages 155-160. North-Holland, 1977.
11. L. Lamport and N. Lynch. Distributed computing: models and methods. Handbook of theoretical computer science, B:l 157-1199, 1990.
12. N. A. Lynch. Distributed algorithms. Morgan Kaufman, 1996.
13. W. S. Massey. A basic course in algebraic topology. Springer-Verlag, 1991. Graduate texts in mathematics.
14. A. Mazurkiewicz. Trace theory. In W. Brauer et al., editor, Petri nets, applications and relationship to other models of concurrency, volume 255 of Lecture notes in computer science, pages 279-324. Spinger-Verlag, 1987.
15. A. Mazurkiewicz. Distributed enumeration. Inf. Processing Letters, 61:233-239, 1997.
16. Y. Métivier and G. Tel. Termination detection and universal graph reconstruction. In SIROCCO 00 - 7th International Colloquium on Structural Information & Communication Complexity, pages 237-251, 2000.
17. K. Reidemeister. Einführung in die Kombinatorische Topologie. Vieweg, Brunswick, 1932.
18. K. H. Rosen, editor. Handbook of discrete and combinatorial mathematics. CRC Press, 2000.
19. G. Tel. Introduction to distributed algorithms. Cambridge University Press, 2000.
20. M. Yamashita and T. Karneda. Computing functions on asynchronous anonymous networks. Math. Systems Theory, 29:331-356, 199G.
21. 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.
22. M. Yamashita and T. Kameda. Computing on anonymous networks: Part ii decision and membership problems. IEEE Transactions on parallel and distributed systems, 7(l):90-96, 1996.
23. M. Yamashita and T. Kameda. Leader election problem on networks in which processor identity numbers are not distinct. IEEE Transactions on parallel and distributed systems, 10(9):878-887, 1999.