• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Laboratory of Theoretical Computer Science

Publications
Book
Special Issue on Computer Science Symposium in Russia

Edited by: Ф. В. Фомин, V. V. Podolskii.

Vol. 64. Iss. 1. Springer, 2020.

Article
Shifting paths to avoidable ones

Gurvich V., Krnc M., Milanič M. et al.

Journal of Graph Theory. 2022. Vol. 100. No. 1. P. 69-83.

Book chapter
Automata Equipped with Auxiliary Data Structures and Regular Realizability Problems

Rubtsov A. A., Vyalyi M.

In bk.: Descriptional Complexity of Formal Systems: 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings. Springer, 2021. P. 150-162.

Working paper
A family of non-periodic tilings of the plane by right golden triangles

Vereshchagin N.

arxiv.org. math. Cornell University, 2020

About the Laboratory

The Laboratory  of Theoretical Computer Science  was founded in December 2015. Structurally, it is a part of Big Data and Information Retrieval School at the Faculty of Computer Science.

The main research directions of the laboratory are computational complexity, algorithmic information theory, algorithmic statistics, combinatorial optimization, algorithmic aspects of game theory.