• 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
Growing Trees and Amoebas’ Replications.

Gurvich V., Krnc M., Vyalyi M.

Results in Mathematics. 2025. Vol. 80.

Book chapter
Disjunctive Complexity

Rubtsov A. A., Vyalyi M., Ivanov N.

In bk.: Descriptional Complexity of Formal Systems. 26th IFIP WG 1.02 International Conference, DCFS 2025 Loughborough, UK, July 22–24, 2025. Proceedings. Springer, 2025. P. 137-150.

Working paper
Low Sets and Closure Properties of Counting Function Classes

Ivanashev Y.

arxiv.org. Computer Science. Cornell University, 2025

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.