- An. A. Muchnik, A. E. Romashchenko, “Stability of properties of Kolmogorov complexity under relativization”, Probl Inf Transm, 46, № 1, 2010, 38
- An. Muchnik, A. Semenov, M. Ushakov, “Almost periodic sequences”, Theoretical Computer Science, 304, № 1-3, 2003, 1
- S.S. Melnik, O.V. Usatenko, “Entropy of high-order Markov chains beyond the pair correlations”, Physica A: Statistical Mechanics and its Applications, 506, 2018, 208
- Bruno Durand, Alexander Shen, Nikolai Vereshagin, 1563, STACS 99, 1999, 153
- Andrei A. Muchnik, Alexei L. Semenov, Vladimir A. Uspensky, “Mathematical metaphysics of randomness”, Theoretical Computer Science, 207, № 2, 1998, 263
- Verónica Becher, Pablo Ariel Heiber, “A linearly computable measure of string complexity”, Theoretical Computer Science, 438, 2012, 62
- An. Muchnik, N. Vereshchagin, 3967, Computer Science – Theory and Applications, 2006, 281
- A. Khrennikov, S. Yamada, “On the Concept of Random Sequence with Respect to p-Adic Valued Probabilities”, Theory Probab. Appl., 49, № 1, 2005, 65
- Robert Kenny, “Orbit Complexity and Entropy for Group Endomorphisms”, Electronic Notes in Theoretical Computer Science, 120, 2005, 97
- William C. Calhoun, “Degrees of monotone complexity”, J. symb. log., 71, № 4, 2006, 1327