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

Primes in tuples and Romanoff's theorem

Radomskii A.

Izvestiya. Mathematics. 2025. Vol. 89. No. 1. P. 125-139.

Book chapter

MERA: A Comprehensive LLM Evaluation in Russian

Fenogenova A., Chervyakov, A., Martynov N. et al.

In bk.: Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) 2024. Vol. 1: Long Papers. Bangkok: Association for Computational Linguistics, 2024. P. 9920-9948.

Working paper

Low Sets and Closure Properties of Counting Function Classes

Ivanashev Y.

arxiv.org. Computer Science. Cornell University, 2025

All publications

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.

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.