| |
| 2003 | ||
|---|---|---|
| 7 | Bruno Durand, Vladimir Kanovei, Vladimir A. Uspensky, Nikolai K. Vereshchagin: Do stronger definitions of randomness exist? Theor. Comput. Sci. 290(3): 1987-1996 (2003) | |
| 1998 | ||
| 6 | EE | Andrei A. Muchnik, Alexei L. Semenov, Vladimir A. Uspensky: Mathematical Metaphysics of Randomness. Theor. Comput. Sci. 207(2): 263-317 (1998) |
| 1996 | ||
| 5 | Vladimir A. Uspensky: Kolmogorov Complexity: Recent Research in Moscow. MFCS 1996: 156-166 | |
| 4 | Vladimir A. Uspensky, A. Shen: Relations Between Varieties of Kolmogorov Complexities. Mathematical Systems Theory 29(3): 271-292 (1996) | |
| 1994 | ||
| 3 | Vladimir A. Uspensky: Gödel's Incompleteness Theorem. Theor. Comput. Sci. 130(2): 239-319 (1994) | |
| 1992 | ||
| 2 | Vladimir A. Uspensky: Kolmogorov and Mathematical Logic. J. Symb. Log. 57(2): 385-412 (1992) | |
| 1979 | ||
| 1 | Vladimir A. Uspensky, Alexei L. Semenov: What are the gains of the theory of algorithms: Basis developments connected with the concept of algorithm and with its application in mathematics. Algorithms in Modern Mathematics and Computer Science 1979: 100-234 | |
| 1 | Bruno Durand | [7] |
| 2 | Vladimir Kanovei | [7] |
| 3 | Andrej Muchnik (Andrei A. Muchnik) | [6] |
| 4 | Alexei L. Semenov | [1] [6] |
| 5 | A. Shen | [4] |
| 6 | Nikolai K. Vereshchagin | [7] |