D. Angluin, Local and global properties in networks of processors, Proc. 12th Annual ACM Symposium on Theory of Computing, pp.82-93, 1980.

P. Boldi and S. Vigna, An Effective Characterization of Computability in Anonymous Networks, Proc. 15th International Symposium on Distributed Computing, pp.33-47, 2001.
DOI : 10.1007/3-540-45414-4_3

J. Chalopin, S. Das, and N. Santoro, Groupings and Pairings in Anonymous Networks, Proc. 20th International Symposium on Distributed Computing, 2006.
DOI : 10.1007/11864219_8

URL : https://hal.archives-ouvertes.fr/hal-00308128

A. Czygrinow, M. Ha´n´ckowiakha´n´ha´n´ckowiak, and W. Wawrzyniak, Fast Distributed Approximations in Planar Graphs, Proc. 22nd International Symposium on Distributed Computing, pp.78-92, 2008.
DOI : 10.1007/978-3-540-87779-0_6

K. Diks, E. Kranakis, A. Malinowski, and A. Pelc, Anonymous wireless rings, Theoretical Computer Science, vol.145, issue.1-2, pp.95-10910, 1995.
DOI : 10.1016/0304-3975(94)00178-L

Y. Emek, C. Pfister, J. Seidel, and R. Wattenhofer, Anonymous networks, Proceedings of the 2014 ACM symposium on Principles of distributed computing, PODC '14, pp.96-105, 2014.
DOI : 10.1145/2611462.2611478

Y. Emek, J. Seidel, and R. Wattenhofer, Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs, Proc. 41st International Colloquium on Automata, Languages and Programming (ICALP 2014). LNCS, pp.183-195, 2014.
DOI : 10.1007/978-3-662-43951-7_16

F. Fich and E. Ruppert, Hundreds of impossibility results for distributed computing, Distributed Computing, vol.16, issue.2-3, pp.121-163, 2003.
DOI : 10.1007/s00446-003-0091-y

P. Fraigniaud, C. Gavoille, D. Ilcinkas, and A. Pelc, Distributed Computing with Advice: Information Sensitivity of Graph Coloring, Proc. 34th International Colloquium on Automata, Languages and Programming, pp.231-242, 2007.
DOI : 10.1007/978-3-540-73420-8_22

URL : https://hal.archives-ouvertes.fr/hal-00339878

P. Fraigniaud, M. Göös, A. Korman, and J. Suomela, What can be decided locally without identifiers?, Proceedings of the 2013 ACM symposium on Principles of distributed computing, PODC '13, pp.157-165, 2013.
DOI : 10.1145/2484239.2484264

URL : https://hal.archives-ouvertes.fr/hal-00912527

P. Fraigniaud, M. M. Halldórsson, and A. Korman, On the Impact of Identifiers on Local Decision, Proc. 16th International Conference on Principles of Distributed Systems, pp.224-238, 2012.
DOI : 10.1007/978-3-642-35476-2_16

URL : https://hal.archives-ouvertes.fr/hal-01241093

P. Fraigniaud, A. Korman, and D. Peleg, Local Distributed Decision, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011.
DOI : 10.1109/FOCS.2011.17

URL : https://hal.archives-ouvertes.fr/hal-00912561

P. Fraigniaud, A. Pelc, D. Peleg, and S. Pérennes, Assigning labels in an unknown anonymous network with a leader, Distributed Computing, vol.14, issue.3, pp.163-183, 2001.
DOI : 10.1007/PL00008935

C. Gavoille and D. Peleg, Compact and localized distributed data structures, Distributed Computing, vol.16, issue.2-3, pp.111-120, 2003.
DOI : 10.1007/s00446-002-0073-5

URL : https://hal.archives-ouvertes.fr/hal-00307386

M. Göös, J. Hirvonen, and J. Suomela, Lower bounds for local approximation, Journal of the ACM, vol.60, issue.5, pp.1-23, 2013.
DOI : 10.1145/2528405

H. Hasemann, J. Hirvonen, J. Rybicki, and J. Suomela, Deterministic local algorithms, unique identifiers, and fractional graph colouring, Theoretical Computer Science, 2014.

L. Hella, M. Järvisalo, A. Kuusisto, J. Laurinharju, T. Lempiäinen et al., Weak models of distributed computing, with connections to modal logic, Distributed Computing, vol.10, issue.9, pp.31-53, 2015.
DOI : 10.1007/s00446-013-0202-3

E. Kranakis, Symmetry and computability in anonymous networks: a brief survey, Proc. 3rd Colloquium on Structural Information and Communication Complexity, pp.1-16, 1996.

C. Lenzen and R. Wattenhofer, Leveraging Linial???s Locality Limit, Proc. 22nd International Symposium on Distributed Computing, pp.394-407, 2008.
DOI : 10.1007/978-3-540-87779-0_27

N. Linial, Locality in Distributed Graph Algorithms, SIAM Journal on Computing, vol.21, issue.1, pp.193-201, 1992.
DOI : 10.1137/0221015

A. Mayer, M. Naor, and L. Stockmeyer, Local computations on static and dynamic graphs, Proceedings Third Israel Symposium on the Theory of Computing and Systems, pp.268-278, 1995.
DOI : 10.1109/ISTCS.1995.377023

M. Naor and L. Stockmeyer, What Can be Computed Locally?, SIAM Journal on Computing, vol.24, issue.6, pp.1259-127710, 1995.
DOI : 10.1137/S0097539793254571

N. Norris, Classifying anonymous networks: when can two networks compute the same set of vector-valued functions?, Proc. 1st Colloquium on Structural Information and Communication Complexity, pp.83-98, 1994.

C. H. Papadimitriou, Computational Complexity, 1994.

D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics, 2000.
DOI : 10.1137/1.9780898719772

J. Suomela, Survey of local algorithms, ACM Computing Surveys, vol.45, issue.2, pp.1-40, 2013.
DOI : 10.1145/2431211.2431223

M. Yamashita and T. Kameda, Computing on an anonymous network, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing , PODC '88, pp.69-8910, 1996.
DOI : 10.1145/62546.62568

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, vol.10, issue.9, pp.878-88710, 1999.
DOI : 10.1109/71.798313