CSR is an annual international conference held in Russia th at is designed to cover a broad range of topics in Theoretical Computer Science.
\n\nTopics include, but are not limited to: (i) algorithms an d data structures (ii) computational complexity, i ncluding hardness of approximation and parameteriz ed complexity (iii) randomness in computing, appro ximation algorithms, fixed-parameter algorithms (i v) combinatorial optimization, constraint satisfac tion, operations research (v) computational geomet ry (vi) string algorithms (vii) formal languages a nd automata, including applications to computation al linguistics (viii) codes and cryptography (ix) combinatorics in computer science (x) computationa l biology (xi) applications of logic to computer s cience, proof complexity (xii) database theory (xi ii) distributed computing (xiv) fundamentals of ma chine learning, including learning theory, grammat ical inference and neural computing (xv) computati onal social choice (xvi) quantum computing and qua ntum cryptography (xvii) theoretical aspects of bi g data.
\n\nOpening lecture: Tim Roughgard en (Columbia University, USA).
\nAuthors are invited to submit an extended abst ract or a full paper of at most 12 pages in Englis h, not including references, in the LNCS format (L aTeX, as pdf; final version with source).
\n\nProofs and other material omitted due to space constraints are to be put into a clearly marked a ppendix to be read at discretion of the referees. Papers must present original (and not previously p ublished) research. Simultaneous submission to jou rnals or to other conferences with published proce edings is not allowed. The proceedings of the symp osium will be published in Springer's LNCS series.
\n