1. Gacs, P. (1974) On the Symmetry of Algorithmic Information, Soviet Mathematics Doklady, 15, pp. 1477–1480.
2. Gacs, P. and Körner, J. (1973) Common Information is far less than Mutual Information, Problems of Control and Information Theory, 2, pp. 149–162.
3. Hammer, D., Eomashchenko, A., Shen, A. and Vereshchagin, N. (June 1997) Inequalities for Shannon Entropies and Kolmogorov Complexities, Proc. Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, pp. 13–23.
4. Hammer, D. and Shen, A. (1998) A Strange Application of Kolmogorov Complexity, Theory of Computing Systems, 31(1), pp. 1–4.
5. Kolmogorov, A.N. (1963) On Tables of Random Numbers, Sankha, Ser. A, 25, pp. 369–376. Reproduced in [13], pp. 176-183.