Search the dblp DataBase
Vladimir A. Uspensky: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- 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. [Citation Graph (0, 0)][DBLP]
Algorithms in Modern Mathematics and Computer Science, 1979, pp:100-234 [Conf] - Vladimir A. Uspensky
Kolmogorov Complexity: Recent Research in Moscow. [Citation Graph (0, 0)][DBLP]
MFCS, 1996, pp:156-166 [Conf] - Vladimir A. Uspensky
Kolmogorov and Mathematical Logic. [Citation Graph (0, 0)][DBLP]
J. Symb. Log., 1992, v:57, n:2, pp:385-412 [Journal] - Vladimir A. Uspensky, A. Shen
Relations Between Varieties of Kolmogorov Complexities. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1996, v:29, n:3, pp:271-292 [Journal] - Bruno Durand, Vladimir Kanovei, Vladimir A. Uspensky, Nikolai K. Vereshchagin
Do stronger definitions of randomness exist? [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2003, v:290, n:3, pp:1987-1996 [Journal] - Andrei A. Muchnik, Alexei L. Semenov, Vladimir A. Uspensky
Mathematical Metaphysics of Randomness. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1998, v:207, n:2, pp:263-317 [Journal] - Vladimir A. Uspensky
Gödel's Incompleteness Theorem. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1994, v:130, n:2, pp:239-319 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002