• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
Language Proficiency
+7(495) 772-9590 доб. 44421
Address: Vavilova 7, room 203
Download CV
SPIN-RSCI: 6953-5427
ORCID: 0000-0002-7386-979X
ResearcherID: L-9806-2016
Scopus AuthorID: 7005187259
Google Scholar
I. Arzhantsev
Printable version


Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!

Nikolay Vereshchagin

  • Nikolay Vereshchagin has been at HSE since 2013.

Education, Degrees and Academic Titles

  • 2014
    Member of the Academy of Europe
  • 1997
  • 1996

    Doctor of Sciences* in Mathematical Logic, Algebra and Number Theory
    Lomonosov Moscow State University

  • 1981

    Lomonosov Moscow State University

* Doctor of Sciences
A post-doctoral degree called Doctor of Sciences is given to reflect second advanced research qualifications or higher doctorates in ISCED 2011.

Student Term / Thesis Papers

Full list of of student term / thesis papers

Courses (2017/2018)

Courses (2016/2017)

Discrete Mathematics 2 (Bachelor’s programme; Faculty of Computer Science; 2 year, 1, 2 module)Rus

Courses (2015/2016)

Courses (2014/2015)

Courses (2013/2014)


  • 2017
    32nd Computational Complexity Conference (Рига). Presentation: Stochasticity in Algorithmic Statistics for Polynomial Time
  • 2013
    8th International Computer Science Symposium in Russia (Санкт-Петербург). Presentation: An improving on Gutfreund, Shaltiel, and Ta-Shma's paper ``If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances''
  • Eighth International Conference on Computability, Complexity and Randomness (Москва). Presentation: Total and plain conditional complexities



Article Vereshchagin N., Bauwens B. F., Makhlin A., Zimand M. Short lists with short programs in short time // Computational Complexity. 2018. Vol. 27. No. 1. P. 31-61. doi




Chapter Vereshchagin N., Shen A. Algorithmic Statistics Revisited, in: Measures of Complexity. Festschrift for Alexey Chervonenkis.. Springer, 2015. doi P. 235-252.






Book Vereshchagin N., Shen A. Basic Set Theory. Providence : AMS, 2002.

Main affiliation

Moscow State University, Dept. of Mathematical Logic and Theory of Algorithms, Professor

Personal home page on the website of Moscow University

Timetable for today

Full timetable

HSE and University of London: Joint BA Programme in Applied Data Analysis

In 2018, the Higher School of Economics will launch an English-taught double degree programme in partnership with the University of London in Applied Data Analysis. Graduates will be awarded an undergraduate degree from HSE in Applied Mathematics and Information Science and a Bachelor of Science in Data Science and Business Analytics from the University of London. International applicants are invited to apply online starting November 15, 2017.

Computer Science Faculty Staff Attend Symposium in Russia

On June 9-13, the international conference ‘Computer Science Symposium in Russia 2016’ was held in St. Petersburg as part of the Special Semester on Computational and Proof Complexity.

Faculty of Computer Science to Launch New Theoretical Computer Science Lab

This year, the HSE Faculty of Computer Science is opening an international theoretical computer science laboratory, which will be the new research division of the Big Data and Information Retrieval School. One of the lab’s main objectives is to help bring the Russian school of theoretical computer science to the world stage.

10th International Computer Science Symposium in Russia

On July 13th-17th 2015, the 10th International Computer Science Symposium in Russia took place. The largest conference on theoretical informatics in Russia was organized by Irkutsk State University, the Higher School of Economics and Yandex. Vladimir Podolskii, Associate Professor at the Big Data and Information Retrieval School took part in the event as guest speaker. Maxim Babenko, Head of the Joint Department with Yandex also delivered a report during the event.