• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
Language Proficiency
+7 (495) 531-00-00
Address: 11 Pokrovsky Bulvar, Pokrovka Complex, room S832
SPIN-RSCI: 2931-8729
ORCID: 0000-0001-8850-9749
ResearcherID: L-3737-2016
Scopus AuthorID: 56988930900
Google Scholar
N. Vereshchagin
V. V. Podolskii
Printable version


Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!
To be used only for spelling or punctuation mistakes.

Alexander A Rubtsov

  • Alexander A Rubtsov has been at HSE University since 2014.

Education and Degrees

  • 2016

    Candidate of Sciences* (PhD)

  • 2016

    Doctoral programme in Discrete mathematics and mathematical cybernetics
    Moscow Institute of Physics and Technology, Department of control and applied mathematics

  • 2011

    Bachelor's in Applied Mathematics and Physics
    Moscow Institute of Physics and Technology

* Candidate of Sciences
According to the International Standard Classification of Education (ISCED) 2011, Candidate of Sciences belongs to ISCED level 8 - "doctoral or equivalent", together with PhD, DPhil, D.Lit, D.Sc, LL.D, Doctorate or similar. Candidate of Sciences allows its holders to reach the level of the Associate Professor.

Young Faculty Support Program (Group of Young Academic Professionals)
Category "New Researchers" (2017-2018)

Student Term / Thesis Papers

Full list of of student term / thesis papers

Courses (2019/2020)

Courses (2018/2019)

Courses (2017/2018)

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


  • RFBR grant 17–51-10005 (joint project with Royal society)
  • RFBR grant 16–01–00362
  • RFBR grant 14–01–00641 


  • 2018

    The 13th International Computer Science Symposium in Russia (Москва). Presentation: On Emptiness and Membership Problems for Set Automata

  • The 22nd International Conference on Developments in Language Theory (Токио). Presentation: A Structural Lemma for Deterministic Context-Free Languages

  • 2017

    21st International Conference on Developments in Language Theory (Льеж). Presentation: On computational complexity of Set Automata

  • 2015
    Descriptional Complexity of Formal Systems (Waterloo). Presentation: Regular realizability problems and context-free languages



Chapter Rubtsov A. A. A Linear-Time Simulation of Deterministic d-Limited Automata, in: Developments in Language Theory: 25th International Conference, DLT 2021, Porto, Portugal, August 16–20, 2021, Proceedings. Switzerland : Springer, 2021. doi P. 342-354. doi



Chapter Rubtsov A. A., Vyalyi M. On Computational Complexity of Set Automata, in: Developments in Language Theory 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings. Cham : Springer, 2017. doi P. 332-344. doi


Chapter Rubtsov A. A., Vyalyi M. Regular Realizability Problems and Context- Free Languages, in: Descriptional Complexity of Formal Systems Vol. 9118. Switzerland : Springer, 2015. doi P. 256-267.


Chapter Рубцов А. А. Исследование задачи регулярной реализуемости для контекстно-свободных языков. // В кн.: Проблемы теоретической кибернетики. Материалы XVII международной конференции. Каз. : Отечество, 2014. С. 246-248.


Article Вялый М. Н., Рубцов А. А. Алгоритмическая разрешимость задач о поведении автоматов на сверхсловах // Дискретный анализ и исследование операций. 2012

Laboratory of Theoretical Computer Science Researchers Get Grant from RFBR and Royal Society

Researchers from the HSE Laboratory of Theoretical Computer Science have won a competition organized by the Russian Foundation for Basic Research (RFBR) and the Royal Society of London for Improving Natural Knowledge.

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.