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

Laboratory of Theoretical Computer Science

2

January 31, 2019

In January, the laboratory of theoretical computer science planned to hold two seminars. Ivan Arzhantsev spoke at the first seminar. At the second seminar, our colleague from Nizhny Novgorod, Dmitry Sirotkin, spoke about his results.

February 12, 2018

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.
Publications
Article
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1‐Sperner hypergraphs

Boros E., Gurvich V., Milanic M.

Journal of Graph Theory. 2020. Vol. 94. No. 3. P. 364-397.

Book chapter
On the Decision Tree Complexity of Threshold Functions

Chistopolskaya A., Podolskii V. V.

In bk.: Computer Science – Theory and Applications 15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, Proceedings. Vol. 12159. Springer, 2020. P. 198-210.

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

Vereshchagin N.

arxiv.org. math. Cornell University, 2020

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.