73 citations to https://www.mathnet.ru/rus/rm4692
-
В. В. Вьюгин, “Об универсальных алгоритмах адаптивного прогнозирования”, Пробл. передачи информ., 47:2 (2011), 90–116 ; V. V. V'yugin, “On universal algorithms for adaptive forecasting”, Problems Inform. Transmission, 47:2 (2011), 166–189
-
Boris Ryabko, Daniil Ryabko, “Constructing perfect steganographic systems”, Information and Computation, 209:9 (2011), 1223
-
Hayato Takahashi, “Algorithmic randomness and monotone complexity on product space”, Information and Computation, 209:2 (2011), 183
-
Joel Ratsaby, “An empirical study of the complexity and randomness of prediction error sequences”, Communications in Nonlinear Science and Numerical Simulation, 16:7 (2011), 2832
-
Uspensky V.A., V'yugin V.V., “Development of the algorithmic information theory in Russia”, Journal of Communications Technology and Electronics, 56:6 (2011), 739–747
-
Ан. А. Мучник, “Алгоритмическая случайность и разбиение супермартингалов”, Пробл. передачи информ., 45:1 (2009), 60–70 ; An. A. Muchnik, “Algorithmic randomness and splitting of supermartingales”, Problems Inform. Transmission, 45:1 (2009), 54–64
-
Vladimir V. V’yugin, “On calibration error of randomized forecasting algorithms”, Theoretical Computer Science, 410:19 (2009), 1781
-
Fabio Benatti, “Quantum Algorithmic Complexities and Entropy”, Open Syst. Inf. Dyn, 16:01 (2009), 1
-
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