On June 9-13, the international conference ‘Computer Science Symposium in Russia 2016’ was held in St. Petersburg as part of the Special Semester on Computational and Proof Complexity.
The semester started in April and runs through the end of June. In addition to the Computer Science Symposium, it also features a Symposium on Experimental Algorithms 2016, several seminars, tutorials, and three workshops.
The semester is organized by Chebyshev Laboratory (St. Petersburg State University) and respected experts in the field of Computer Science: Johan Håstad, Jan Krajíček, Pavel Pudlák, Madhu Sudan, and Ryan Williams, among others. HSE Laboratory of Theoretical Computer Science staff also took part in the event.
Nikolay Vereshchagin, Head of the Laboratory of Theoretical Computer Science, was one of the organizers of the workshop ‘Algorithms in Communication Complexity, Property Testing and Combinatorics’. During the workshop, Alexander Kozachinskiy, Research Assistant at the laboratory, outlined the results of his research projects.
Vladimir Podolskii, Senior Research Fellow of the laboratory, Associate Professor at the Big Data and Information Retrieval School, presented a report at the Low-Depth Complexity workshop on recent developments in the theory of low-depth circuit complexity.
The international conference on Computer Science in Russia is one of the largest conferences on theoretical computer science in Russia today. Traditionally, the conference is held each year in a different Russian city. This year it was held at the St. Petersburg Department of the Russian Academy of Science’s Steklov Institute of Mathematics.
Laboratory Research Assistants Alexander Kozachinsky and Alexey Milovanov presented their reports at the conference. Alexander Kozachinsky received an award for the ‘Best Student Paper’. Michael Vyalyi, Leading Research Fellow at the laboratory, and Alexander Rubtsov, Research Fellow at the laboratory, also participated in the event.
The next conference will be held in Kazan in 2017.