В. В. Вьюгин, “Проблемы устойчивости универсальных схем сжатия информации”, Пробл. передачи информ., 39:1 (2003), 36–52 ; V. V. V'yugin, “Problems of Robustness for Universal Coding Schemes”, Problems Inform. Transmission, 39:1 (2003), 32–46
В. В. Вьюгин, В. П. Маслов, “Об экстремальных соотношениях между аддитивными функциями потерь и колмогоровской сложностью”, Пробл. передачи информ., 39:4 (2003), 71–87 ; 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
An. Muchnik, A. Semenov, M. Ushakov, “Almost periodic sequences”, Theoretical Computer Science, 304:1-3 (2003), 1
Bruno Durand, Vladimir Kanovei, Vladimir A. Uspensky, Nikolai Vereshchagin, “Do stronger definitions of randomness exist?”, Theoretical Computer Science, 290:3 (2003), 1987
Wolfgang Merkle, “The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences”, J. symb. log, 68:04 (2003), 1362
Wolfgang Merkle, Jan Reimann, Lecture Notes in Computer Science, 2747, Mathematical Foundations of Computer Science 2003, 2003, 602
Sérgio B. Volchan, “What Is a Random Sequence?”, The American Mathematical Monthly, 109:1 (2002), 46
Wolfgang Merkle, Lecture Notes in Computer Science, 2380, Automata, Languages and Programming, 2002, 390
Cristian S. Calude, “Incompleteness, Complexity, Randomness and Beyond”, Minds and Machines, 12:4 (2002), 503
В. В. Вьюгин, “О неустойчивости индивидуальной эргодической теоремы”, Пробл. передачи информ., 37:2 (2001), 27–39 ; V. V. V'yugin, “Nonrobustness Property of the Individual Ergodic Theorem”, Problems Inform. Transmission, 37:2 (2001), 108–119