Boris Ryabko, Daniil Ryabko, 2009 IEEE International Symposium on Information Theory, 2009, 2733
Alexander Shen, Lecture Notes in Computer Science, 5797, Reachability Problems, 2009, 26
Hayato Takahashi, “On a definition of random sequences with respect to conditional probability”, Information and Computation, 206:12 (2008), 1375
Ludwig Staiger, “On Oscillation-free ε-random Sequences”, Electronic Notes in Theoretical Computer Science, 221 (2008), 287
DANIEL OSHERSON, SCOTT WEINSTEIN, “RECOGNIZING STRONG RANDOM REALS”, Rev. symb. logic, 1:1 (2008), 56
Alexey Chernov, Alexander Shen, Nikolai Vereshchagin, Vladimir Vovk, Lecture Notes in Computer Science, 5254, Algorithmic Learning Theory, 2008, 138
Fabio Benatti, “Entropy and algorithmic complexity in quantum information theory”, Nat Comput, 6:2 (2007), 133
К. Ю. Горбунов, “Оценка числа элементов покрытия произвольного теста на случайность частотными тестами”, Пробл. передачи информ., 43:1 (2007), 56–66 ; K. Yu. Gorbunov, “Estimation of the Number of Elements in a Covering of an Arbitrary Randomness Test by Frequency Tests”, Problems Inform. Transmission, 43:1 (2007), 48–56
Б. Я. Рябко, “Применение методов сжатия данных для непараметрического оценивания характеристик случайных процессов с дискретным временем”, Пробл. передачи информ., 43:4 (2007), 109–123 ; B. Ya. Ryabko, “Application of Data Compression Methods to Nonparametric Estimation of Characteristics of Discrete-Time Stochastic Processes”, Problems Inform. Transmission, 43:4 (2007), 367–379
Vladimir V. V'yugin, Lecture Notes in Computer Science, 4754, Algorithmic Learning Theory, 2007, 388
Bruno Durand, Alexander Zvonkin, Kolmogorov's Heritage in Mathematics, 2007, 281
В. В. Вьюгин, В. П. Маслов, “Распределение инвестиций на фондовом рынке, информационные типы и алгоритмическая сложность”, Пробл. передачи информ., 42:3 (2006), 97–108 ; V. V. V'yugin, V. P. Maslov, “Distribution of Investments in the Stock Market, Information Types, and Algorithmic Complexity”, Problems Inform. Transmission, 42:3 (2006), 251–261
Boris Ryabko, Jaakko Astola, Alex Gammerman, “Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series”, Theoretical Computer Science, 359:1-3 (2006), 440
Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan, “Kolmogorov–Loveland randomness and stochasticity”, Annals of Pure and Applied Logic, 138:1-3 (2006), 183
Hayato Takahashi, 2006 IEEE International Symposium on Information Theory, 2006, 2180
В. В. Вьюгин, В. П. Маслов, “Теоремы о концентрации для энтропии и свободной энергии”, Пробл. передачи информ., 41:2 (2005), 72–88 ; V. V. V'yugin, V. P. Maslov, “Theorems on Concentration for the Entropy of Free Energy”, Problems Inform. Transmission, 41:2 (2005), 134–149
Wolfgang Merkle, Joseph Miller, André Nies, Jan Reimann, Frank Stephan, Lecture Notes in Computer Science, 3404, STACS 2005, 2005, 422
H. Takahashi, IEEE Information Theory Workshop, 2005., 2005, 4 pp.
A.B. Nobel, “Some Stochastic Properties of Memoryless Individual Sequences”, IEEE Trans Inform Theory, 50:7 (2004), 1497
В. В. Вьюгин, “Проблемы устойчивости универсальных схем сжатия информации”, Пробл. передачи информ., 39:1 (2003), 36–52 ; V. V. V'yugin, “Problems of Robustness for Universal Coding Schemes”, Problems Inform. Transmission, 39:1 (2003), 32–46