A. Zvonkin and L. Levin, The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms, Russian Math. Surv, vol.25, issue.6, pp.83-124, 1970.

R. Ahlswede and I. Csiszár, Common randomness in information theory and cryptography-I: Secret sharing, IEEE Trans. Inform. Theor, vol.39, issue.4, pp.1121-1132, 1993.

M. Ueli and . Maurer, Secret key agreement by public discussion from common information, IEEE Trans. Inform. Theor, vol.39, issue.3, pp.733-742, 1993.

E. Kushilevitz and N. Nisan, Communication complexity, 1996.

A. Medrano, P. Myers, P. , H. Stark, and A. Terras, Finite analogues of Euclidean space, Journal of Computational and Applied Mathematics, vol.68, issue.1-2, pp.221-238, 1996.

N. Alon and J. H. Spencer, The probabilistic method, 2000.

O. Reingold, S. Vadhan, and A. Wigderson, Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors, Proceedings 41st Annual Symposium on Foundations of Computer Science (FOCS), pp.3-13, 2000.

A. Romashchenko, Pairs of Words with Nonmaterializable Mutual Information. Problems of Information Transmission, vol.36, pp.1-18, 2000.

D. Hammer, A. Romashchenko, A. Shen, and N. Vereshchagin, Inequalities for Shannon entropy and Kolmogorov complexity, Journal of Computer and System Sciences, vol.60, issue.2, pp.442-464, 2000.

K. Makarychev, Y. Makarychev, A. Romashchenko, and N. Vereshchagin, A new class of non-Shannon-type inequalities for entropies. Communications in Information and Systems, vol.2, pp.147-66, 2002.

A. A. Muchnik, Conditional Complexity and Codes, vol.271, pp.97-109, 2002.

A. Chernov, A. Muchnik, A. Romashchenko, A. Shen, and N. Vereshchagin, Upper semi-lattice of binary strings with the relation x is simple conditional to, Theor. Comput. Sci, vol.271, issue.1-2, pp.69-95, 2002.

S. Hoory, N. Linial, and A. Wigderson, Expander graphs and their applications, Bulletin of the American Mathematical Society, vol.43, issue.4, pp.439-561, 2006.

A. Le and . Vinh, The Szemerédi-Trotter type theorem and the sum-product estimate in finite fields, European Journal of Combinatorics, vol.32, issue.8, pp.1177-1181, 2011.

H. Tyagi, Common information and secret key capacity, IEEE Trans. Inform. Theor, vol.59, issue.9, pp.5627-5640, 2013.

S. Evra, K. Golubev, and A. Lubotzky, Mixing properties and the chromatic number of Ramanujan complexes, International Mathematics Research Notices, vol.22, pp.11520-11548, 2015.

J. Liu, P. Cuff, and S. Verdá, Common randomness and key generation with limited interaction, Proc. IEEE ISIT, 2016.

A. Shen, V. Uspensky, and N. Vereshchagin, Kolmogorov Complexity and Algorithmic Randomness, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-01803620

A. E. Brouwer, S. M. Cioab?, F. Ihringer, and M. Mcginnis, The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters, J. Combin. Theory Ser. B, vol.133, pp.88-121, 2018.

X. Liu and S. Zhou, Eigenvalues of Cayley graphs, 2018.

T. Kaced, A. Romashchenko, and N. Vereshchagin, A conditional information inequality and its combinatorial applications, IEEE Transactions on Information Theory, vol.64, issue.5, pp.3610-3615, 2018.
URL : https://hal.archives-ouvertes.fr/lirmm-01793775

A. Romashchenko and M. Zimand, An operational characterization of mutual information in algorithmic information theory, Journal of the ACM (JACM), vol.66, issue.5, p.42, 2019.
URL : https://hal.archives-ouvertes.fr/lirmm-01618559

M. Sudan, H. Tyagi, and S. Watanabe, Communication for Generating Correlation: A Unifying Survey, IEEE Transactions on Information Theory, vol.66, issue.1, pp.5-37, 2019.

M. Li and P. Vitányi, An introduction to Kolmogorov complexity and its applications, 2019.