N. Alon, L. Babai, and A. Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, Journal of Algorithms, vol.7, issue.4, pp.567-583, 1986.
DOI : 10.1016/0196-6774(86)90019-2

B. Awerbuch, A. Goldberg, M. Luby, and S. Plotkin, Network decomposition and locality in distributed computation, 30th Annual Symposium on Foundations of Computer Science, pp.364-369, 1989.
DOI : 10.1109/SFCS.1989.63504

M. Bellare, O. Goldreich, and M. Sudan, Free Bits, PCPs, and Nonapproximability---Towards Tight Results, SIAM Journal on Computing, vol.27, issue.3, pp.804-915, 1998.
DOI : 10.1137/S0097539796302531

R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, and D. Peleg, Label-Guided Graph Exploration by a Finite Automaton, 32nd Int. Colloquium on Automata, Languages and Programming (ICALP), pp.335-346, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00339772

R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, and D. Peleg, Labeling Schemes for Tree Representation, 7th Int. Workshop on Distributed Computing (IWDC), pp.13-24, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00341573

R. Cole and U. Vishkin, Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms, Proceedings of the eighteenth annual ACM symposium on Theory of computing , STOC '86, pp.206-219, 1986.
DOI : 10.1145/12130.12151

U. Feige and J. Kilian, Zero Knowledge and the Chromatic Number, Journal of Computer and System Sciences, vol.57, issue.2, pp.187-199, 1998.
DOI : 10.1006/jcss.1998.1587

F. Fich and E. Ruppert, Hundreds of impossibility results for distributed computing, Distributed Computing, pp.121-163, 2003.

P. Fraigniaud, D. Ilcinkas, and A. Pelc, Oracle size, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.179-187, 2006.
DOI : 10.1145/1146381.1146410
URL : https://hal.archives-ouvertes.fr/hal-00339854

A. Goldberg and S. Plotkin, Efficient parallel algorithms for (? + 1)-coloring and maximal independent set problems, 19th ACM Symp. on Theory of Computing (STOC), pp.315-324, 1987.

A. Goldberg, S. Plotkin, and G. Shannon, Parallel symmetry-breaking in sparse graphs, 19th ACM Symp. on Theory of Computing (STOC), pp.315-324, 1987.

R. Karp, Reducibility Among Combinatorial Problems, Complexity of Computer Computations, pp.85-103, 1972.

K. Kothapalli, M. Onus, C. Scheideler, and C. Schindelhauer, Distributed coloring in O( ? log n) bit rounds, 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2006.

F. Kuhn, T. Moscibroda, and R. Wattenhofer, What cannot be computed locally!, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.300-309, 2004.
DOI : 10.1145/1011767.1011811

F. Kuhn and R. Wattenhofer, On the complexity of distributed graph coloring, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.7-15, 2006.
DOI : 10.1145/1146381.1146387

M. Luby, A Simple Parallel Algorithm for the Maximal Independent Set Problem, SIAM Journal on Computing, vol.15, issue.4, pp.1036-1053, 1986.
DOI : 10.1137/0215074

N. Lynch, A hundred impossibility proofs for distributed computing, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing , PODC '89, pp.1-28, 1989.
DOI : 10.1145/72981.72982

T. Moscibroda and R. Wattenhofer, Coloring unstructured radio networks, 17th ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp.39-48, 2005.

M. Naor and L. Stockmeyer, What can be computed locally?, 25th ACM Symposium on Theory of Computing (STOC), pp.184-193, 1993.
DOI : 10.1137/s0097539793254571
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.902

A. Panconesi and R. Rizzi, Some simple distributed algorithms for sparse networks, Distributed Computing, vol.14, issue.2, pp.97-100, 2001.
DOI : 10.1007/PL00008932

A. Panconesi and A. Srinivasan, Improved distributed algorithms for coloring and network decomposition problems, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing , STOC '92, pp.581-592, 1992.
DOI : 10.1145/129712.129769

A. Panconesi and A. Srinivasan, On the Complexity of Distributed Network Decomposition, Journal of Algorithms, vol.20, issue.2, pp.356-374, 1996.
DOI : 10.1006/jagm.1996.0017

D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM Monographs on Discrete Mathematics, 2000.
DOI : 10.1137/1.9780898719772