76 citations to https://www.mathnet.ru/rus/rm4692
-
Joel Ratsaby, 2009 IEEE International Conference on Computational Cybernetics (ICCC), 2009, 141
-
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