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

Laboratory of Theoretical Computer Science

2

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.

October 02, 2017

Guilhem Gamard, research fellow of the international laboratory of theoretical computer science, took part in the workshop in Lyon, France.
Publications
Article
Recognizing Read-Once Functions from Depth-Three Formulas
In press

Kozachinskiy A.

Theory of Computing Systems. 2019.

Book chapter
Plain stopping time and conditional complexities revisited

Posobin G. I., Shen A., Andreev M.

In bk.: 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Vol. 117. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. P. 1-24.

Working paper
Stochasticity in Algorithmic Statistics for Polynomial Time

Vereshchagin N., Milovanov A.

Electronic Colloquium on Computational Complexity. Technical report . Weizmann Institute of Science, 2017. No. TR17-043.

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.