- Bart Kastermans, Steffen Lempp, “Comparing notions of randomness”, Theoretical Computer Science, 411, no. 3, 2010, 602
- Wolfgang Merkle, Joseph S. Miller, André Nies, Jan Reimann, Frank Stephan, “Kolmogorov–Loveland randomness and stochasticity”, Annals of Pure and Applied Logic, 138, no. 1-3, 2006, 183
- Wolfgang Merkle, “The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences”, J. symb. log., 68, no. 4, 2003, 1362
- Arnaud Carayol, Axel Hadda, Olivier Serre, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, 2011, 13
- P. G. Klyucharev, “On Statistical Testing of Block Ciphers”, Mat. mat. model., no. 5, 2018, 35
- Jason Rute, “When does randomness come from randomness?”, Theoretical Computer Science, 635, 2016, 35
- Bruno Durand, Nikolai Vereshchagin, “Kolmogorov–Loveland stochasticity for finite strings”, Information Processing Letters, 91, no. 6, 2004, 263
- Vladimir A. Uspensky, 6, Complex Systems, 2001, 201
- S. I. Adian, N. N. Andreev, L. D. Beklemishev, S. S. Goncharov, Yu. L. Ershov, Yu. V. Matiyasevich, Yu. S. Osipov, M. R. Pentus, V. A. Plungyan, E. V. Rakhilina, V. A. Sadovnichii, A. L. Semenov, S. G. Tatevosov, V. M. Tikhomirov, A. Kh. Shen, “Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)”, Russ. Math. Surv., 74, no. 4, 2019, 735
- Yasunori Horikoshi, Akimichi Takemura, “Implications of contrarian and one-sided strategies for the fair-coin game”, Stochastic Processes and their Applications, 118, no. 11, 2008, 2125