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. ,
Common randomness in information theory and cryptography-I: Secret sharing, IEEE Trans. Inform. Theor, vol.39, issue.4, pp.1121-1132, 1993. ,
Secret key agreement by public discussion from common information, IEEE Trans. Inform. Theor, vol.39, issue.3, pp.733-742, 1993. ,
Communication complexity, 1996. ,
Finite analogues of Euclidean space, Journal of Computational and Applied Mathematics, vol.68, issue.1-2, pp.221-238, 1996. ,
The probabilistic method, 2000. ,
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. ,
Pairs of Words with Nonmaterializable Mutual Information. Problems of Information Transmission, vol.36, pp.1-18, 2000. ,
Inequalities for Shannon entropy and Kolmogorov complexity, Journal of Computer and System Sciences, vol.60, issue.2, pp.442-464, 2000. ,
A new class of non-Shannon-type inequalities for entropies. Communications in Information and Systems, vol.2, pp.147-66, 2002. ,
, Conditional Complexity and Codes, vol.271, pp.97-109, 2002.
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. ,
Expander graphs and their applications, Bulletin of the American Mathematical Society, vol.43, issue.4, pp.439-561, 2006. ,
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. ,
Common information and secret key capacity, IEEE Trans. Inform. Theor, vol.59, issue.9, pp.5627-5640, 2013. ,
Mixing properties and the chromatic number of Ramanujan complexes, International Mathematics Research Notices, vol.22, pp.11520-11548, 2015. ,
Common randomness and key generation with limited interaction, Proc. IEEE ISIT, 2016. ,
Kolmogorov Complexity and Algorithmic Randomness, 2017. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01803620
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. ,
Eigenvalues of Cayley graphs, 2018. ,
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
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
Communication for Generating Correlation: A Unifying Survey, IEEE Transactions on Information Theory, vol.66, issue.1, pp.5-37, 2019. ,
An introduction to Kolmogorov complexity and its applications, 2019. ,