R. Ahlswede, P. Gács, and J. Körner, Bounds on conditional probabilities with applications in multi-user communication. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, vol.34, pp.157-177, 1976.

H. Buhrman, L. Fortnow, I. Newman, and N. K. Vereshchagin, Increasing Kolmogorov Complexity, p.22, 2005.

, Annual Symposium on Theoretical Aspects of Computer Science, vol.3404, pp.412-421, 2005.

G. Rodney, D. R. Downey, and . Hirschfeldt, Algorithmic Randomness and Complexity. Theory and Applications of Computability, 2010.

P. Frankl and Z. Füredi, A short proof for a theorem of Harper about Hamming-spheres, Discrete Mathematics, vol.34, issue.3, pp.311-313, 1981.

N. Greenberg, J. S. Miller, A. Shen, and L. B. Westrick, Dimension 1 sequences are close to randoms, Theoretical Computer Science, vol.705, pp.99-112, 2018.
URL : https://hal.archives-ouvertes.fr/lirmm-01803444

W. Hoeffding, Probability inequalities for sums of bounded random variables, Journal of the American statistical association, vol.58, issue.301, pp.13-30, 1963.

A. N. Kolmogorov, Three approaches to the quantitative definition of information. Problems of Information Transmission, vol.1, pp.3-11, 1965.

M. Li, M. B. Paul, and . Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, Third Edition. Texts in Computer Science, 2008.

A. Grigory and . Margulis, Probabilistic properties of highly connected graphs. Problems of Information Transmission, vol.10, pp.174-179, 1974.

K. Marton, A simple proof of the blowing-up lemma, IEEE Transactions on Information Theory, vol.32, issue.3, pp.445-446, 1986.

C. Mcdiarmid, On the method of bounded differences, London Mathematical Society Lecture Note Series, pp.148-188, 1989.

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

N. K. Vereshchagin and A. Shen, Algorithmic statistics: forty years later, Computability and Complexity. Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday. Lecture Notes in Computer Science, v. 10010, pp.669-737, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01480627

N. K. Vereshchagin, M. B. Paul, and . Vitányi, Rate Distortion and Denoising of Individual Data Using Kolmogorov Complexity, IEEE Transactions on Information Theory, vol.56, issue.7, pp.3438-3454, 2010.

A. D. Wyner and J. Ziv, A Theorem on the Entropy of Certain Binary Sequences and Applications: Part I, IEEE Transactions on Information Theory, vol.19, issue.6, pp.769-772, 1973.