• 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
Generalization of Romanoff's Theorem

A. Radomskii.

Mathematical notes. 2023. Vol. 114. No. 5. P. 903-913.

Book chapter
Dimension-free Structured Covariance Estimation

Puchkin N., Rakhuba M.

In bk.: Proceedings of Machine Learning Research. Volume 247: The Thirty Seventh Annual Conference on Learning Theory, 30-3 July 2023, Edmonton, Canada. PMLR, 2024. P. 4276-4306.

Working paper
Two lower bounds for maximum matching

Kuyanov F.

math. arXiv. Cornell University, 2024

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.