13-17 Jul 2015
CSR-2015: Second Call for Papers
The 10th International Computer Science Symposium in Russia
July 13-17, 2015, Listvyanka (Lake Baikal), Russia
http://logic.pdmi.ras.ru/csr2015
In partnership with European Association for Theoretical Computer Science
Distinguished opening lecture:
Moshe Y. Vardi (Rice U.)
(*NEW*) Invited Speakers include
Samuel R. Buss (UCSD)
Phokion Kolaitis (UCSC and IBM Research/Almaden)
Vladimir Podolskii (Steklov Inst./Moscow)
Program Committee:
Eric Allender (Rutgers)
Sergei Artemov (U. of New York)
Lev Beklemishev (Steklov Inst./Moscow, chair)
Andrei Bulatov (Simon Fraser U.)
Harry Buhrman (U. of Amsterdam)
Nachum Dershowitz (Tel Aviv U.)
Edward A. Hirsch (Steklov Inst./St.Petersburg)
Bahkadyr Khoussainov (U. of Auckland)
Gregory Kucherov (CNRS and U. Marne-la-Vallee)
Sergei O. Kuznetsov (Higher School of Economics/Moscow)
Daniel Leivant (Indiana U.)
Georg Moser (U. of Innsbruck)
Damian Niwinski (U. of Warsaw)
Prakash Panangaden (McGill U.)
Jean-??ric Pin (CNRS and U. Paris-Diderot)
Alexander Razborov (U. of Chicago and Steklov Inst./Moscow)
Andre Scedrov (U. of Pennsylvania)
Alexander Shen (LIRMM/Montpellier and IITP/Moscow)
Wolfgang Thomas (Aachen U.)
Helmut Veith (TU Vienna)
Nikolai K. Vereshchagin (Moscow State U., Yandex, Higher School of Economics/Moscow)
Mikhail Volkov (Ural Federal U.)
Michael Zakharyaschev (U. of London)
Important Dates:
Submission: December 14, 2014
Notification: February 12, 2015
Topics: include, but are not limited to:
algorithms and data structures
algorithms for concurrent and distributed systems, networks
automata theory and formal languages
automated reasoning
automatic structures and applications
computational complexity
proof complexity
Kolmogorov complexity
combinatorial optimization
constraint solving
cryptography
combinatorics in computer science
computational models and concepts
database theory
description logics
formal concept analysis
games and program synthesis
modal logic
model checking
proof theory
quantum computation
reasoning about security and privacy
term rewriting
verification
Submission:
Authors are invited to submit original (and not previously published)
research. Submissions consist of two parts: the main paper and an appendix
(which might be empty). The main paper must be at most 14 pages in length,
including references. All proofs omitted from the main paper due to space
constraints should be given in the appendix or made accessible through a
reliable link to a freely available electronic preprint. The papers must
be submitted in English, in the LNCS format (LaTeX, as pdf; final version
with source) with page numbering turned on using the \pagestyle{plain}
command; instructions are here:
http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0
Simultaneous submission to journals or to other conferences with published
proceedings is not allowed. The proceedings of the symposium will be
published in Springer's LNCS series. Accepted papers MUST be presented
at the symposium.
Submissions should be uploaded to the EasyChair Conference system:
http://www.easychair.org/conferences/?conf=csr2015
Yandex Awards
for the best paper and for the best student paper will be given by the PC.
Conference Chair:
Daniil Musatov (Moscow Institute of Physics and Technology)
Organized by
Irkutsk State University
Moscow Center for Continuous Mathematical Education
Further information and contacts:
Web: http://logic.pdmi.ras.ru/csr2015
Email: csr2015 "at" googlegroups.com