15th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2020)
June 29 - July 03, 2020, Ekaterinburg, Russia
https://csr2020.sciencesconf.org/
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 will publish a selection of extended versions
of accepted papers in a Special Issue of the Springer journal "Theory of
Computing Systems". A further Special Issue with invited extended versions
of accepted algorithmic papers is planned with the MDPI journal
"Algorithms". Yandex Awards for the best paper and for the best student
paper will be given by the PC.
IMPORTANT DATES (2nd Round)
Deadline for paper submissions: February 13th, 2020, aoe
Notification of acceptance: March 15th, 2020
Conference dates: June 29 - July 03, 2020
VENUE
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 (Munich, Paris, Prague, Rome) or Asia
(Beijing, Dubai, Harbin, Istanbul, Tel Aviv). The conference will take
place at Ural Federal University located in the heart of the picturesque
city center.
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=csr2020
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 website.
At least one of the authors must commit to presenting the paper at the
conference.
DISTINGUISHED OPENING LECTURE
Bela Bollobas (University of Cambridge and University of Memphis, USA)
INVITED SPEAKERS (updated)
Farid Ablaev (Tatarstan Academy of Sciences, Russia), *title TBA*
Ulrik Brandes (ETH Zürich, Switzerland), *title TBA*
Piotr Faliszewski (AGH University of Science and Technology, Krakow,
Poland) *"**Election Isomorphism Problem and Isomorphic Distances Among
Elections"*
Mateus de Oliveira Oliveira (University of Bergen, Norway), *title TBA*
Meirav Zehavi (Ben Gurion University, Israel) *"Parameterized Analysis,
Graph Minors and Planar Disjoint Paths"*
Binhai Zhu (Montana State University, USA) *"Tandem duplications, segmental
**duplications and deletions, and their applications"*
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
-
computational geometry
-
string algorithms
-
formal languages and automata, including applications to computational
linguistics
-
codes and cryptography
-
combinatorics in computer science
-
computational biology
-
applications of logic to computer science, proof complexity
-
database theory
-
distributed computing
-
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
For further information, please visit our conference website.
https://csr2020.sciencesconf.org/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
