Welcomе

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

TBA

OPENING LECTURE

Andrew Yao (Tsinghua University, Beijing, China)

INVITED LECTURES

TBA

ORGANIZERS

Novosibirsk State University and A.P. Ershov Institute of Informatics Systems

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

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 (instructions available here). 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.

The proceedings will be published in Lecture Notes in Computer Science series by Springer. Instructions for formatting camera-ready versions will be communicated to the authors of accepted papers.

At least one of the authors must commit to presenting the paper at the conference.

A selection of extended version of accepted papers will be published in a special issue of the journal "Theory of Computing Systems".

PREVIOUS CSRs

The list of previous CSR webpages can be found here.