Follow
Nikolai Vereshchagin
Nikolai Vereshchagin
Professor of Computer Science, Moscow State University and National Research University Higher
Verified email at lpcs.math.msu.su
Title
Cited by
Cited by
Year
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface
F Wang, D Shen, P Yan, K Suzuki
367*2012
Языки и исчисления
НК Верещагин, А Шень
МЦНМО, 2000
342*2000
Kolmogorov's structure functions and model selection
NK Vereshchagin, PMB Vitányi
IEEE Transactions on Information Theory 50 (12), 3265-3290, 2004
249*2004
Inequalities for Shannon entropy and Kolmogorov complexity
D Hammer, A Romashchenko, A Shen, N Vereshchagin
Journal of Computer and System Sciences 60 (2), 442-464, 2000
2332000
A new class of non-Shannon-type inequalities for entropies
K Makarychev, Y Makarychev, A Romashchenko, N Vereshchagin
Communications in Information and Systems 2 (2), 147-166, 2002
1542002
Kolmogorov complexity and algorithmic randomness
A Shen, VA Uspensky, N Vereshchagin
American Mathematical Society, 2022
1422022
Test Martingales, Bayes Factors and p-Values
G Shafer, A Shen, N Vereshchagin, V Vovk
1382011
On computation and communication with small bias
H Buhrman, N Vereshchagin, R de Wolf
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 24-32, 2007
1232007
Начала теории множеств
НК Верещагин, А Шень
М.: МЦНМО, 1999
841999
Вводный курс математической логики
ВА Успенский, НК Верещагин, ВЕ Плиско
Физматлит, 2002
82*2002
Relativizable and non-relativizable theorems in the polynomial theory of algorithms
NK Vereshchagin
Izvestija Rossijskoj Akademii Nauk 57 (2), 51-90, 1993
68*1993
Basic set theory
A Shen, NK Vereshchagin, A Shen
American Mathematical Society, 2002
54*2002
Occurrence of zero in a linear recursive sequence
NK Vereshchagin
Mathematical notes of the Academy of Sciences of the USSR 38, 609-615, 1985
521985
Banishing robust Turing completeness
LA Hemaspaandra, S Jain, NK Vereshchagin
International Journal of Foundations of Computer Science 4 (03), 245-265, 1993
511993
Computable functions
NK Vereshchagin, A Shen
American Mathematical Soc., 2003
502003
Rate distortion and denoising of individual data using Kolmogorov complexity
NK Vereshchagin, PMB Vitányi
IEEE Transactions on Information Theory 56 (7), 3438-3454, 2010
482010
Upper semi-lattice of binary strings with the relation “x is simple conditional to y”
A Chernov, A Muchnik, A Romashchenko, A Shen, N Vereshchagin
Theoretical Computer Science 271 (1-2), 69-95, 2002
462002
On the power of PP
NK Vereschchagin
1992 Seventh Annual Structure in Complexity Theory Conference, 138,139,140 …, 1992
441992
Logical operations and Kolmogorov complexity
A Shen, N Vereshchagin
Theoretical Computer Science 271 (1-2), 125-129, 2002
412002
Independent minimum length programs to translate between given strings
NK Vereshchagin, MV Vyugin
Theoretical Computer Science 271 (1-2), 131-143, 2002
402002
The system can't perform the operation now. Try again later.
Articles 1–20