International Computer Science Symposium in Russia 2016

On June 9-13 Computer Science Symposium in Russia (CSR) 2016 was held in St. Petersburg.

The conference was collocated with Special Semester on Computational and Proof Complexity. The semester started in April and would last till the end of June. The semester was arranged by the staff of the P. L. Chebyshev’s Research Laboratory. The semester also contained several seminars, tutorials and three workshops.

Among the participants of the semester there are a lot of well-known experts in Theoretical Computer Science including Johan Håstad, Jan Krajíček, Pavel Pudlák, Madhu Sudan, Ryan Williams.

The staff of the International Laboratory of Theoretical Computer Science including Nikolai Vereshchagin, Vladimir Podolskii, Michael Vyalyi, Alexander Kozachinsky, Alexei Milovanov and Alexander Rubtsov also participated in the Semester.

Nikolai Vereshchagin, the head of the laboratory, was one of the organizers of the workshop “Algorithms in Communication Complexity, Property Testing and Combinatorics”.

Alexander Kozachinsky, the research assistant of the laboratory, presented the results of his research on CSR and won the Best Student Paper award. Another talk on the CSR was given by Alexei Milovanov.

Associate Professor Vladimir Podolskii gave a talk on the workshop on Low-Depth Complexity.

The conference Computer Science in Russia is one of the largest conferences in Theoretical Computer Science in Russia. Traditionally CSR takes place in different Russian cities. For example, in 2015 the conference was held at Lake Baikal in Listvyanka village. This year it was held in St. Petersburg. The next CSR will be held in Kazan.