Seminars:
Theoretical Computer Science and Combinatorics
"Theoretical Computer Science and Combinatorics" is a joint seminar of the Faculty of Computer Science of HSE and the Department of Innovation and High Technology of MIPT. The seminar is held 1-2 times per semester. The seminar is intended to enrich scientific collaboration between two departments in the fields of Theoretical Computer Science and Combinatorics. The seminar is hosted by turns by HSE and MIPT.
Kolmogorov seminar on complexity
Kolmogorov seminar on complexity is held by the department of mathematical logic and theory of algorithms in MSU. It is held every Monday from 16:45 to 18:20 in the classroom 16-04.
Seminars’ leaders are: Nikolay Vereshchagin, Michael Vyalyi, Alexey Semenov, Andrey Romashchenko, Alexander Shen.
Description of the seminar on the MSU’s website
Workshops:
Workshop on Theoretical Computer Science 2016
Workshop "Problems in Theoretical Compuer Science 2016"
Complexity of Computation, Communication, Descriptions and Proofs
The 13th International Computer Science Symposium in Russia
Randomness, Information, Complexity
Problems in Theoretical Computer Science 2019
Problems in Theoretical Computer Science 2021
Games, Graphs, Generation, Duality
Workshop "Problems in Theoretical Compuer Science 2016"
Complexity of Computation, Communication, Descriptions and Proofs
The 13th International Computer Science Symposium in Russia
Randomness, Information, Complexity
Problems in Theoretical Computer Science 2019
Problems in Theoretical Computer Science 2021
Games, Graphs, Generation, Duality
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.