1. C. H. Bennett, P. Gács, M. Li, P. M. B. Vitanyi, and W. H. Zurek, “Information Distance,” IEEE Trans. Inf. Theory 44(4), 1407–1423 (1998).
2. H. Chernoff, “A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations,” Ann. Math. Stat. 23, 493–507 (1952).
3. An. Muchnik, A. Romashchenko, A. Shen, and N. Vereshchagin, “Upper Semilattice of Binary Strings with the Relation ‘x Is Simple Conditional to y’,” in Computational Complexity: Proc. 14th Annu. IEEE Conf., Atlanta, May 4–6, 1999 (IEEE Comput. Soc. Press, Los Alamitos, CA, 1999), pp. 114–122.
4. A. Muchnik and N. Vereshchagin, “Logical Operations and Kolmogorov Complexity. II,” in Computational Complexity: Proc. 16th Annu. IEEE Conf., Chicago, June 2001 (IEEE Comput. Soc. Press, Los Alamitos, CA, 2001), pp. 256–265.
5. Lect. Notes Comput. Sci.;An. Muchnik,2006