What are the gains of the theory of algorithms: Basis developments connected with the concept of algorithm and with its application in mathematics. - Vladimir A. Uspensky; Alexei L. Semenov (Algorithms in Modern Mathematics and Computer Science, 1979)

Kolmogorov and Mathematical Logic. - Vladimir A. Uspensky (J. Symb. Log., 1992)

Gödel's Incompleteness Theorem. - Vladimir A. Uspensky (Theor. Comput. Sci., 1994)

Kolmogorov Complexity: Recent Research in Moscow. - Vladimir A. Uspensky (MFCS, 1996)

Relations Between Varieties of Kolmogorov Complexities. - Vladimir A. Uspensky; Alexander Shen 001 (Math. Syst. Theory, 1996)

Mathematical Metaphysics of Randomness. - Andrei A. Muchnik; Alexei L. Semenov; Vladimir A. Uspensky (Theor. Comput. Sci., 1998)

Do stronger definitions of randomness exist? - Bruno Durand 001; Vladimir Kanovei; Vladimir A. Uspensky; Nikolai K. Vereshchagin (Theor. Comput. Sci., 2003)

The Lattice of Definability. Origins, Recent Developments, and Further Directions. - Alexei L. Semenov; Sergey Soprunov; Vladimir A. Uspensky (CSR, 2014)