H. Arfaoui and P. , What can be computed without communications?, ACM SIGACT News, vol.45, issue.3, pp.82-104, 2014.
DOI : 10.1145/2670418.2670440
URL : https://hal.archives-ouvertes.fr/hal-01102110

H. Arfaoui, P. Fraigniaud, D. Ilcinkas, and F. Mathieu, Distributedly Testing Cycle-Freeness, proc. 40th Int. Work. on Graph-Theoretic Concepts in Computer Science (WG), Springer LNCS, pp.15-28, 2014.
DOI : 10.1007/978-3-319-12340-0_2
URL : https://hal.archives-ouvertes.fr/hal-01084297

L. Barenboim and M. , Elkin: Distributed Graph Coloring: Fundamentals and Recent Developments. Synthesis Lectures on Distributed Computing Theory, 2013.

H. T. Chan, M. Dinitz, and A. Gupta, Spanners with Slack, proc. 14th Annual European Symposium on Algorithms (ESA), pp.196-207, 2006.
DOI : 10.1007/11841036_20

K. Chung, S. Pettie, and H. Su, Distributed algorithms for the Lovász local lemma and graph coloring, proc. 33rd ACM Symp. on Principles of Distributed Computing (PODC), pp.134-143, 2014.

A. D. Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai et al., Distributed Verification and Hardness of Distributed Approximation, SIAM Journal on Computing, vol.41, issue.5, pp.1235-1265, 2012.
DOI : 10.1137/11085178X

M. Dinitz, Compact routing with slack, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, pp.81-88, 2007.
DOI : 10.1145/1281100.1281114

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

P. Floréen, J. Kaasinen, P. Kaski, and J. Suomela, An optimal local approximation algorithm for max-min linear programs, Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, SPAA '09, pp.260-269, 2009.
DOI : 10.1145/1583991.1584058

P. Fraigniaud, M. Göös, A. Korman, M. Parter, and D. , Randomized distributed decision, Distributed Computing, vol.20, issue.2, pp.419-434, 2014.
DOI : 10.1007/s00446-014-0211-x
URL : https://hal.archives-ouvertes.fr/hal-01093255

P. Fraigniaud, M. Göös, A. Korman, and J. Suomela, What can be decided locally without identifiers? In proc, 32nd ACM Symp. on Principles of Distributed Computing (PODC), vol.2013, pp.157-165

P. Fraigniaud, A. Korman, and D. , Peleg: Towards a complexity theory for local distributed computing, J. ACM, vol.60, issue.5, p.35, 2013.

P. Fraigniaud, S. Rajsbaum, and C. , Locality and checkability in wait-free computing, Distributed Computing, vol.15, issue.4, pp.223-242, 2013.
DOI : 10.1007/s00446-013-0188-x
URL : https://hal.archives-ouvertes.fr/hal-00992781

P. Fraigniaud, S. Rajsbaum, and C. Travers, On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems, proc. 5th International Conference on Runtime Verification (RV), pp.92-107, 2014.
DOI : 10.1007/978-3-319-11164-3_9
URL : https://hal.archives-ouvertes.fr/hal-01102121

C. Gavoille, A. Kosowski, and M. Markiewicz, What Can Be Observed Locally?, proc. 23rd Int. Symp. on Distributed Computing (DISC), Springer LNCS, pp.243-257, 2009.
DOI : 10.1007/978-3-642-04355-0_26
URL : https://hal.archives-ouvertes.fr/hal-00408727

M. Göös, J. Hirvonen, and J. Suomela, Lower bounds for local approximation, J. ACM, vol.60, issue.5, p.39, 2013.

H. Hasemann, J. Hirvonen, J. Rybicki, and J. Suomela, Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring, proc. 19th Int. Colloquium on Structural Information and Communication Complexity (SIROCCO), Springer LNCS, pp.48-60, 2012.

G. Konjevod, A. W. Richa, D. Xia, and H. Yu, Compact routing with slack in low doubling dimension, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, pp.71-80, 2007.
DOI : 10.1145/1281100.1281113

A. Korman, S. Kutten, and D. , Proof labeling schemes, Distributed Computing, vol.34, issue.2, pp.215-233, 2010.
DOI : 10.1007/s00446-010-0095-3

A. Korman, J. Sereni, and L. , Viennot: Toward more localized local algorithms: removing assumptions concerning global knowledge, Distributed Computing, vol.26, pp.5-6, 2013.

F. Kuhn, T. Moscibroda, and R. Wattenhofer, What cannot be computed locally! In proc, 23rd ACM Symp. on Principles of Distributed Computing (PODC), pp.300-309, 2004.

C. Lenzen, Y. A. Oswald, and R. Wattenhofer, What can be approximated locally?, Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, SPAA '08, pp.46-54, 2008.
DOI : 10.1145/1378533.1378540

C. Lenzen and R. , Wattenhofer: Leveraging Linial's Locality Limit, proc. 22nd Int. Symp. on Distributed Computing (DISC), pp.394-407, 2008.

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

M. Naor, A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring, SIAM Journal on Discrete Mathematics, vol.4, issue.3, pp.409-412, 1991.
DOI : 10.1137/0404036

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

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

J. Suomela, Survey of local algorithms, ACM Computing Surveys, vol.45, issue.2, p.24, 2013.
DOI : 10.1145/2431211.2431223