Algorithmic Information Theory and Foundations of Probability Reachability Problems Third International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009, Proceedings Lecture Notes in Computer Science Vol. 5797
Download (106.7 KB)

On the history of martingales in the study of randomness, Journal Elecronique d"Histoire des Probabilites et de la Statistique, ISSN 1773-0074.
Download (413.7 KB)

Algorithmic information theory and martingales. [A historic account] arxiv 0906.2614
Download (436.4 KB)

Algorithmic randomness and splitting of supermartingales, arxiv 0807.3156 Проблемы передачи информации, 2009, 45:1, 60-70. English version: Problems of Information Transmission, 2009, 45:1, 54-64.
Download (341.3 KB)

Limit complexities revisited. Proceedings of STACS 2008 conference, p.73-84, http://drops.dagstuhl.de/opus/volltexte/2008/1335 Theory of Computing Systems, DOI 10.1007/s00224-009-9203-9, 17 March 2009.
Go to publication Download (142.8 KB)

English version: N.Vereshchagin, A.Shen. Computable functions. Published by AMS, 2003. MR 2004b:03002
Download (1.1 MB)

English version: N.Vereshchagin, A.Shen. Basic set theory. Published by AMS, 2002. MR 2003f:03001
Download (897.1 KB)

A simple proof of Miller--Yu theorem. Fundamenta Informaticae, vol. 83, no. 1--2 (2008), p.21-24.
Download (87.2 KB)

Prequential Randomness, Algorithmic Learning Theory, 19th International Conference (ALT 2008), Budapest, Hungary, Oct. 13--16, 2008, p.~154--168.
Download (219.8 KB)

On-line Probability, Complexity and Randomness. Algorithmic Learning Theory, 19th International Conference (ALT 2008), Budapest, Hungary, Oct. 13--16, 2008, Lecture Notes in Computer Science, v.~5254, p.~138--153.
Download (197.8 KB)

Программирование: теоремы и задачи. Третье издание: МЦНМО, 2007. English version: "Algorithms and Programming: Problems and Solutions" published by Birkhauser in 1997. 2nd ed. 2008 (Modern Classics, Birkhauser), 3rd ed. 2009 (Springer).
Download (1.5 MB)

Partitioning multi-dimensional sets in a small number of ``uniform"" parts. ECCC Report, TR05-95, European Journal of Combinatorics, Volume 28, Issue 1, January 2007, p. 134--144. doi:10.1016/j.ejc.2005.08.002 MR2261810
Download (144.3 KB)

A.Muchnik, A.Shen, N.Vereshchagin, M.Vyugin. Non-reducible descriptions for conditional Kolmogorov complexity. ECCC Report, TR04-054, Jun 29, 2004 See also: Theory and Applications of Models of Computation, Lecture Notes in Computer Science, Springer Berlin/Heidelberg, 3959 (2006), p.308-317 (a talk given in Beijing conference, May 2006). MR2277252 Extended version: Andrej Muchnik, Alexander Shen, Mikhail Ustinov, Nikolai Vereshchagin, Michael Vyugin, Non-reducible descriptions for conditional Kolmogorov complexity. Theoretical Computer Science, 2007, 384 (1), 77--86.
Download (186.2 KB)

Multisource information theory ECCC Report, TR06-006. Also published: Dagstuhl seminar 06051, http://drops.dagstuhl.de/opus/volltexte/2006/626 See also: Theory and Applications of Models of Computation, Lecture Notes in Computer Science, Springer Berlin/Heidelberg, 3959 (2006), p. 327-338. (a talk given in Beijing conference, May 2006). MR2277254
Download (136.8 KB)