Nikolai Vereshchagin

Cited by

	All	Since 2019
Citations	3277	1204
h-index	28	15
i10-index	62	23

240

120

180

19951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202423 10 14 16 14 12 15 24 54 42 59 82 78 125 97 126 158 132 137 143 171 144 135 185 196 223 222 220 197 145

Co-authors

Paul VitanyiCWI and University of AmsterdamVerified email at cwi.nl
Andrei RomashchenkoLIRMM, CNRS, University of MontpellierVerified email at lirmm.fr
Michal KouckyCharles University, PragueVerified email at iuuk.mff.cuni.cz
Alexey ChernovLecturer in Statistics, University of BrightonVerified email at rhul.ac.uk
Yury MakarychevProfessor of Computer Science, Toyota Technological Institute at ChicagoVerified email at ttic.edu
Ilan NewmanProfessor of Computer Science, University of HaifaVerified email at cs.haifa.ac.il
Konstantin MakarychevNorthwestern UniversityVerified email at northwestern.edu
Ronald de WolfCWI and University of AmsterdamVerified email at cwi.nl
Sanjay JainProfessor of Computer Science, National University of SingaporeVerified email at comp.nus.edu.sg
Lane A. Hemaspaandra (premarriage...Professor of Computer Science, University of RochesterVerified email at cs.rochester.edu
Bruno BauwensNational Research University Higher School of EconomicsVerified email at hse.ru
Marius ZimandProfessor of Computer Science, Towson UniversityVerified email at towson.edu
Philip DawidEmeritus Professor of Statistics, University of CambridgeVerified email at statslab.cam.ac.uk
Hartmut KlauckPrincipal Investigator, Centre for Quantum TechnologiesVerified email at hklauck.com
Matthias ChristandlUniversity of CopenhagenVerified email at math.ku.dk
Zvi LotkerProfessor In Bar Ilan UniversityVerified email at biu.ac.il
Joshua BrodyAssociate Professor, Swarthmore CollegeVerified email at cs.swarthmore.edu
Troy LeeUniversity of Technology SydneyVerified email at uts.edu.au
Noga AlonPrinceton University and Tel Aviv UniversityVerified email at tau.ac.il
Leen TorenvlietILLC University of Amsterdam (retired)Verified email at uva.nl

Nikolai Vereshchagin

Professor of Computer Science, Moscow State University and National Research University Higher

Verified email at lpcs.math.msu.su

Computational complexity Kolmogorov complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Языки и исчисления НК Верещагин, А Шень МЦНМО, 2000	347*	2000
Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface M Abe, K Aoki, G Ateniese, R Avanzi, Z Beerliová, O Billet, A Biryukov, ... Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2006	257*	2006
Kolmogorov's structure functions and model selection NK Vereshchagin, PMB Vitányi IEEE Transactions on Information Theory 50 (12), 3265-3290, 2004	250*	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	240	2000
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	154	2002
Test Martingales, Bayes Factors and p-Values G Shafer, A Shen, N Vereshchagin, V Vovk	152	2011
Kolmogorov complexity and algorithmic randomness A Shen, VA Uspensky, N Vereshchagin American Mathematical Society, 2022	151	2022
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	125	2007
Вводный курс математической логики ВА Успенский, НК Верещагин, ВЕ Плиско Физматлит, 2002	84*	2002
Начала теории множеств НК Верещагин, А Шень Шень М.: МЦНМО, 2000	84	2000
Relativizable and non-relativizable theorems in the polynomial theory of algorithms NK Vereshchagin Izvestija Rossijskoj Akademii Nauk 57 (2), 51-90, 1993	68*	1993
Computable functions NK Vereshchagin, A Shen American Mathematical Soc., 2003	56	2003
Basic set theory A Shen, NK Vereshchagin, A Shen American Mathematical Society, 2002	55*	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	53	1985
Banishing robust Turing completeness LA Hemaspaandra, S Jain, NK Vereshchagin International Journal of Foundations of Computer Science 4 (03), 245-265, 1993	52	1993
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	50	2010
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	50	2002
On the power of PP NK Vereschchagin 1992 Seventh Annual Structure in Complexity Theory Conference, 138,139,140 …, 1992	44	1992
The problem of appearance of a zero in a linear recurrence sequence NK Vereshchagin Mat. Zametki 38 (2), 609-615, 1985	43	1985
Logical operations and Kolmogorov complexity A Shen, N Vereshchagin Theoretical Computer Science 271 (1-2), 125-129, 2002	41	2002

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors