D. Gonçalves, M. Montassier, and A. Pinlou, Entropy compression method applied to graph colorings

J. Miller, Two notes on subshifts, Proceedings of the AMS, pp.1617-1622, 2012.
DOI : 10.1090/S0002-9939-2011-11000-1

R. Moser, A constructive proof of the Lov??sz local lemma, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09
DOI : 10.1145/1536414.1536462

R. Moser and G. Tardos, A constructive proof of the general lov??sz local lemma, Journal of the ACM, vol.57, issue.2, pp.11-12, 2010.
DOI : 10.1145/1667053.1667060

P. Ochem and A. Pinlou, Application of Entropy Compression in Pattern Avoidance, The Electronic Journal of Combinatorics, vol.21, issue.2, pp.2-7, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-01233448

A. Rumyantsev and A. Shen, Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma, Fundamenta Informaticae, vol.132, pp.1-14, 2013.

A. Rumyantsev and M. Ushakov, Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences, STACS 2006 Proceedings, pp.396-407
DOI : 10.1007/11672142_32

URL : http://arxiv.org/abs/1009.4455

A. Shen, V. A. Uspensky, and N. Vereshchagin, Kolmogorov complexity and algorithmic randomness
URL : https://hal.archives-ouvertes.fr/lirmm-00786255