Cristian S. Calude, Texts in Theoretical Computer Science An EATCS Series, Information and Randomness, 2002, 147
Wolfgang Merkle, Lecture Notes in Computer Science, 2380, Automata, Languages and Programming, 2002, 390
В. В. Вьюгин, “О неустойчивости индивидуальной эргодической теоремы”, Пробл. передачи информ., 37:2 (2001), 27–39 ; V. V. V'yugin, “Nonrobustness Property of the Individual Ergodic Theorem”, Problems Inform. Transmission, 37:2 (2001), 108–119
N. H. Bingham, Probability Theory, 2001, 15
P. Gacs, J.T. Tromp, P.M.B. Vitanyi, “Algorithmic statistics”, IEEE Trans. Inform. Theory, 47:6 (2001), 2443
Peter Gács, John Tromp, Paul Vitányi, Lecture Notes in Computer Science, 1968, Algorithmic Learning Theory, 2000, 41
Sangit Chatterjee, Mustafa R. Yilmaz, Mohamed Habibuliah, Matthew Laudato, “An approximate entropy test for randomness”, Communications in Statistics - Theory and Methods, 29:3 (2000), 655
P.M.B. Vitanyi, Ming Li, “Minimum description length induction, Bayesianism, and Kolmogorov complexity”, IEEE Trans. Inform. Theory, 46:2 (2000), 446
Peter A. van der Helm, “Simplicity versus likelihood in visual perception: From surprisals to precisals.”, Psychological Bulletin, 126:5 (2000), 770
D.J Downing, V.V Fedorov, W.F Lawkins, M.D Morris, G Ostrouchov, “Large data series: modeling the usual to identify the unusual”, Computational Statistics & Data Analysis, 32:3-4 (2000), 245