15th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2020)
June 29 – July 03, 2020, Ekaterinburg, Russia
CSR is an annual international conference held in Russia that is designed to cover a broad range of topics in Theoretical Computer Science. The list of previous CSR conferences can be found at https://logic.pdmi.ras.ru/~csr/ . Conference proceedings are published in Springer’s Lecture Notes in Computer Science series. We intend to publish a selection of accepted papers in a special issue of the Springer journal “Theory of Computing Systems”.
CSR 2020 will be combined with workshops and a summer school.
Details will be announced later.
Deadline for submissions: January 10th, 2020
Notification of acceptance: March 15th, 2020
Conference dates: June 29 – July 03, 2020
Béla Bollobás (University of Cambridge, UK)
Béla Bollobás (distinguished keynote speaker, University of Cambridge, UK)
Farid Ablaev (Kazan Federal University, Russia)
Ulrik Brandes (ETH Zürich, Switzerland)
Piotr Faliszewski (AGH University of Science and Technology, Poland)
Meirav Zehavi (Ben Gurion University, Israel)
Mateus de Oliveira Oliveira (University of Bergen, Norway)
Authors are invited to submit papers presenting original research in the conference topics, in electronic form (pdf format) via EasyChair.
Submissions must be unpublished, not under review for publication elsewhere, and provide sufficient information to judge their merits. Submissions must be in English, and not exceed 12 pages, including the title page, in Springer’s LNCS LaTeX style. Additional material, to be read at the discretion of reviewers and PC members, may be provided in a clearly marked appendix or by reference to a manuscript on a web site.
At least one of the authors must commit to presenting the paper at the conference.
Yandex Awards for the best paper and for the best student paper will be given by the PC.
Ekaterinburg is the 4th largest city in Russia and the capital of the Ural region. It is easily accessible either via Moscow or Saint Petersburg, or by a direct flight from Europe (Isanbul, Munich, Paris, Prague, Rome) or Asia (Beijing, Dubai, Harbin, Tel Aviv). The conference will take place at Ural Federal University located in the heart of the picturesque city center.
TOPICS include, but are not limited to:
algorithms and data structures
computational complexity, including hardness of approximation and parameterized complexity
randomness in computing, approximation algorithms, fixed-parameter algorithms
combinatorial optimization, constraint satisfaction, operations research
formal languages and automata, including applications to computational linguistics
codes and cryptography
combinatorics in computer science
applications of logic to computer science, proof complexity
fundamentals of machine learning, including learning theory, grammatical inference and neural computing
computational social choice
quantum computing and quantum cryptography
theoretical aspects of big data