CSR is an annual international conference held in Russia that intends to cover a broad range of topics in Theoretical Computer Science.

These include, but are not limited to:

• algorithms and data structures
• computational complexity
• randomness in computing, approximation algorithms
• combinatorial optimizaiton, constraint satisfaction
• computational geometry
• formal languages and automata
• codes and cryptography
• combinatorics in computer science
• applications of logic to computer science, proof complexity
• fundamentals of machine learning
• theoretical aspects of big data

IMPORTANT DATES

Deadline for submissions: December 23, 2018 January 3, 2019

Notification of acceptance: February 13, 2019 February 25, 2019

Camera-ready papers due: March 18, 2019

Conference dates: July 1–5, 2019

OPENING LECTURE

Andrew Yao (Tsinghua University, Beijing, China)

INVITED LECTURES

Michael Fellows (U Bergen, Norway)

Eric Fusy (École Polytechnique, France)

Giuseppe Italiano (LUISS U, Italy)

Meena Mahajan (Institute of Mathematical Sciences, India)

Petros Petrosyan (Yerevan State U, Armenia)

David Woodruff (Carnegie Mellon U, USA)

Dmitry Zhuk (Moscow U, Russia)

ORGANIZERS

Novosibirsk State University, Ershov Institute of Informatics Systems, and Sobolev Institute of Mathematics

SUBMISSIONS

Authors are invited to submit papers presenting original research in the conference topics, in electronic form (pdf format) via EasyChair at

https://easychair.org/conferences/?conf=csr19

All information for authors can be found in the call for papers.

PREVIOUS CSRs

The list of previous CSR webpages can be found here.