- D. Angluin, "Local and global properties in networks of processors," in : Proceedings of the 12th Symposium on theory of computing, Pages :82--93, 1980.
- D. Angluin and A. Gardiner, "Finite common coverings of pairs of regular graphs," J. Combin. Theory, Ser. B, 30, 183--187, 1981.
- H. Attiya and J. Welch, "Distributed computing," McGraw-Hill, 1998.
- V. C. Barbosa, "An introduction to distributed algorithms," MIT Press, 1996.
- C. Berge, "Graphes," Gauthier Villars, 1983.
- H. Bergmann, "Ein Planarit\"atskriterium f\"ur endliche graphen," Element. Math., 37, 49--51, 1982.
- H.-L. Bodlaender, "The classification of coverings of processor networks," Journal of parallel and distributed Computing, 6:166--182, 1989.
- H.-L. Bodlaender and J. van Leeuwen, "Simulation of large networks on smaller networks," Information and control,Volume 71 Pages:143--180, 1986.
- 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, 1999.
- P. Boldi and B. Codenotti and P. Gemmel and S. Vigna, "Symmetry breaking in anonymous networks: characterizations," in: Proceedings of the 4th Israeli Symposium on theory of computings and systems, Pages :16--26, 1996.
- A. Bottreau, "Réécritures de graphe et calculs distribués," Universitée Bordeaux I, 1997.
- A. Bottreau and Y. Métivier, "Minor searching, normal forms of graph relabelling : two applications based on enumerations by graph relabelling," Foundations of Software Science and Computation Structures, LNCS Volume 1378 Pages:110--124, 1998.
- A. Bottreau and Y. Métivier, "Some remarks on the kronecker products of graphs," Information processing letters, Volume 68 Pages:55--61, 1998.
- A. Bottreau and Y. Métivier, "The Kronecker product and local computations in graphs," Colloquium on trees in algebra and programming, LNCS Volume 1059 Pages:2--16, 1996.
- A. Brandstadt, Van Bang Le and J. P. Spinrad"Graph classes Asurvey," SIAM, 1999.
- H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D.lugiez, S. Tison and M. Tommasi,"Tree Automata Techniques and Applications," 1999.
- R. Cori and D. Lascar,"Logique mathématique II. Fonctions récursives, théorème de Gödel, théorie des ensembles, théorie des modèles," Masson, 1993.
- B. Courcelle and Y. Métivier, "Coverings and minors : application to local computations in graphs," European journal of combinatorics, Volume 15 Pages:127--138, 1994.
- R. Diestel, "Graph theory," Springer, 1997.
- E.W. Dijkstra, "Self-stabilizing systems in spite of distributed control," CACM, 17(11), 643--644, 1974.
- E.W. Dijkstra and C.S. Sholten, "Termination detection for diffusing computations," Information Processing Letters, Volume 11 Pages:1--4, 1980.
- S. Dolev, "Self-stabilization," MIT Press, 2000.
- J.-R. Fiksel and A. Holliger and P. Rosenstiehl, "Intelligent graphs," Graph theory and computing, Academic Press (New York) Pages :219--265, 1972.
- M. J. Fisher and N. A. Lynch and M. Merrit, "Easy impossibility proofs for distributed consensus problems," Distributed computing, Volume 1 Pages:26--29, 1986.
- A. Gibbons, "Algorithmic graph theory," Cambridge University Press, 1985.
- E. Godard and Y. Métivier, "A characterization of classes of graphs recognizable by local computations with initial knowledge," Proceedings of 8th international conference on structural information and communication complexity, Pages :179--193, Carleton scientific press2001.
- E. Godard and Y. Métivier and A. Muscholl, "The power of local computations in graphs with initial knowledge," Theory and applications of graph transformations, LNCS Volume 1764 Pages:71--84, 2000.
- E. Godard and Y. Métivier, "A characterization of families of graphs in which election is possible," Foundations of Software Science and Computation Structures, LNCS to appear.
- R. Gupta and S. A. Smolka and S. Bhaskar, "On randomization in sequential and distributed algorithms," ACM Compututing sureys,26(1):7--86, 1994.
- A. Hatcher, "Algebraic Topology," http://www.math.cornell.edu/\~{}hatcher, 2001.
- M. Herlihy and N. Shavit, "The topological structure of asynchronous computability," 1999.
- A. Itai and M. Rodeh, "Symmetry breaking in distributive networks," The 13th Symposium on theory of computing, Pages :150--158, 1981.
- R.E. Johnson and F.B. Schneider, "Symmetry and Similarities in distributed systems," Proc. 4th conf. on Principles of Distributed Computing, 13--22, 1985.
- T. Kameda and M. Yamashita, "Computing on anonymous networks: Part i-characterizing the solvable cases," IEEE Transactions on parallel and distributed systems, 7(1) Pages:69--89, 1996.
- T. Kameda and M. Yamashita, "Computing on anonymous networks: Part ii - decision and membership problems," IEEE Transactions on parallel and distributed systems, 7(1) Pages:90--96, 1996.
- L. Lamport and N. Lynch, "Distributed computing: models and methods," Handbook of theoretical computer science, B, 1157--1199, 1990.
- I. Lavalléé and G. Roucairol, "A fully distributed (minimal) spanning tree algorithm," Information Processing Letters, Volume 23 Pages:55--62, 1986.
- I. Lavallée, "Algorithmique parallèle et distribuée," Hermes, 1990.
- G. LeLann, "Distributed systems: towards a formal approach," In B. Gilchrist, editor, Information processing'77, 155--160, 1977.
- Ch. Lavault, "Evaluation des algorithmes distribués," Hermes, 1995.
- F. T. Leighton, "Finite common coverings of graphs," Journal of combinatorial theory, Ser. B, 33:231--238, 1982.
- I. Litovsky and Y. Métivier, "Computing trees with graph rewriting systems with priorities," Tree automata and languages, Pages :115--139, 1992.
- I. Litovsky and Y. Métivier and E. Sopena, "Different local controls for graph relabelling systems," Mathematical systems theory, Volume 28 Pages:41--65, 1995.
- I. Litovsky and Y. Métivier and E. Sopena, "Graph relabelling systems and distributed algorithms," Handbook of graph grammars and computing by graph transformation, Volume 3 Pages:1--56, Worls Scientific 1999.
- N. A. Lynch, "Distributed algorithms," Morgan Kaufman, 1996.
- N. A. Lynch, "A hundred impossibility proofs for distributed computing," in 8th International conference on distributed computing systems, Pages :1--28, 1989.
- W. S. Massey, "A basic course in algebraic topology," Graduate texts in mathematics, Springer-Verlag, 1991.
- A. Mazurkiewicz, "Distributed enumeration," Information processing letters, Volume 61 Pages:233-239, 1997.
- A. Mazurkiewicz, "Solvability of the asynchronous ranking problem," Information processing letters, Volume 28 Pages:221--224, 1988.
- Y. Métivier and A. Muscholl and P.-A. Wacrenier, "About the local detection of termination of local computations in graphs," International Colloquium on structural information and communication complexity, Pages :188-200, Carleton scientific press 1997.
- Y. Métivier and N. Saheb, "Probabilistic analysis of an election algorithm in a tree," Colloquium on trees in algebra and programming, LNCS Volume 787 Pages:234--245, 1994.
- Y. Métivier and N. Saheb and A. Zemmari, "Randomized rendezvous," Mathematics and computer science : Algorithms, trees, combinatorics and probabilities, Pages :183--194, 2000.
- Y. Métivier and G. Tel, "Termination detection and universal graph reconstruction," International colloquium on structural information and communication complexity, Pages :237--251, Carleton scientific press 2000.
- R. Motwani and P. Raghavan, "Randomized algorithms," Cambridge University Press, 1995.
- N. Norris, "Universal covers of graphs: Isomorphism to depth n-1 implies isomorphism to all depths," Discrete Applied Mathematics, 56 Pages:61--74, 1995.
- M. Naor and L. Stockmeyer, "What can be computed locally," SIAM Journal of computing, 24(6)Pages :1259--1277, 2000.
- D. Peleg, "Distributed computing - A locality-sensitive approach," SIAM, 2000.
- M. Raynal, "Networks and distributed computations: concepts, tools and algorithms," MIT Press, 1988.
- K. Reidemeister, "Einfuhrung in die kombinatorishe topologie," Vieweg, Brunswick, 1932.
- K. H. Rosen, "Handbook of discrete and combinatorial mathematics," CRC Press, 2000.
- N. Sakamoto, "Comparison of Initial Conditions for Distributed Algorithms on Anonymous Networks," ACM, Proc. of ISPD'99, 173--179, 1999.
- Shing-Tsaan Huang, "Leader election in uniform rings," ACM Trans. Program. Lang. Syst., 15, 563--573, 1993.
- B. Szymanski and Y. Shy and N. Prywes, "Terminating iterative solutions of simultaneous equations in distributed message passing systems," In Proceedings of the 4th Symposium on Principles of Distributed computing, Pages :287--292, 1985.
- G. Tel, "Introduction to distributed algorithms," Cambridge University Press, 2000.
- GP.M. Weichsel, "The Kronecker Product of Graphs," Proc. Amer. Math. Soc., 8, 47--52, 1962.