-
V. G. Vovk, G. R. Shafer, “Kolmogorov's Contributions to the Foundations of Probability”, Problems Inform. Transmission, 39:1 (2003), 21–31
-
L. A. Levin, “One-Way Functions”, Problems Inform. Transmission, 39:1 (2003), 92–103
-
An. A. Muchnik, A. L. Semenov, “On the Role of the Law of Large Numbers in the
Theory of Randomness”, Problems Inform. Transmission, 39:1 (2003), 119–147
-
A. E. Romashchenko, “A Criterion of Extractability of the Mutual Information for a Triple
of Strings”, Problems Inform. Transmission, 39:1 (2003), 148–157
-
V. V. V'yugin, V. P. Maslov, “On Extremal Relations between Additive Loss Functions and the Kolmogorov Complexity”, Problems Inform. Transmission, 39:4 (2003), 380–394
-
M. V. V'yugin, “Systems of Strings with Large Mutual Complexity”, Problems Inform. Transmission, 39:4 (2003), 395–399
-
V. P. Maslov, “Nonlinear averaging axioms in financial mathematics
and stock price dynamics”, Theory Probab. Appl., 48:4 (2004), 723–733
-
Puglisi A., Benedetto D., Caglioti E., Loreto V., Vulpiani A., “Data Compression and Learning in Time Sequences Analysis”, Physica D, 180:1-2 (2003), 92–107
-
Loreto V., Puglisi A., “Data Compression Approach to Sequence Analysis”, Modeling of Complex Systems, AIP Conference Proceedings, 661, eds. Garrido P., Marro J., Amer Inst Physics, 2003, 184–187
-
Phys. Usp., 45:11 (2002), 1131–1151
-
O. V. Kukushkina, A. A. Polikarpov, D. V. Khmelev, “Using Literal and Grammatical Statistics for Authorship Attribution”, Problems Inform. Transmission, 37:2 (2001), 172–184
-
An. A. Muchnik, S. E. Positsel'skii, “A class of enumerable sets”, Russian Math. Surveys, 54:3 (1999), 640–641
-
V. K. Bulitko, “Recursively compressible sets”, Math. Notes, 64:1 (1998), 8–14
-
Verdu, S, “Fifty years of Shannon Theory”, IEEE Transactions on Information Theory, 44:6 (1998), 2057
-
V. A. Uspenskii, A. L. Semenov, A. Kh. Shen', “Can an individual sequence of zeros and ones be random?”, Russian Math. Surveys, 45:1 (1990), 121–189
-
P. Vitani, M. Li, “Kolmogorovskaya slozhnost: dvadtsat let spustya”, UMN, 43:6(264) (1988), 129–166
-
R. I. Grigorchuk, “Degrees of growth of finitely generated groups, and the theory of invariant means”, Math. USSR-Izv., 25:2 (1985), 259–300
-
A. N. Kolmogorov, “Combinatorial foundations of information theory and the calculus of probabilities”, Russian Math. Surveys, 38:4 (1983), 29–40
-
A. O. Slisenko, “Complexity problems in computational theory”, Russian Math. Surveys, 36:6 (1981), 23–125
-
A. A. Brudno, “The complexity of the trajectories of a dynamical system”, Russian Math. Surveys, 33:1 (1978), 197–198