[Proof Complexity] CSR 2018: Call for Papers

Vladimir Podolskii podolskii-vv at yandex.ru
Mon Sep 25 01:30:24 CEST 2017


=============

Сall for Papers
The 13th International Computer Science Symposium in Russia, CSR-2018
Moscow, Russia
June 6-10, 2018


---------------------------------
CSR is an annual conference that intends to reflect the broad scope of 
international cooperation in computer science. The topics covered vary 
from year to year, but in general try to cover as much of the 
contemporary computer science as possible.



TOPICS

include, but are not limited to:

algorithms and data structures
combinatorial optimization
constraint solving
computational complexity
cryptography
combinatorics in computer science
formal languages and automata
algorithms for concurrent and distributed systems, networks
proof theory and applications of logic to computer science


---------------------------------
Important dates

Deadline for submissions: December 16, 2017 (23:59 anywhere on Earth).
Notification of acceptance: February 11, 2018.
Final Version: February 26 2018
Conference dates: June 6-10, 2018.



---------------------------------
Opening lecture
Noga Alon (Tel Aviv University, Israel)

Invited lectures

TBA
---------------------------------
Submission and publication

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

Submission server: https://easychair.org/conferences/?conf=csr2018

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.

Accepted papers will be published in an LNCS volume 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.

---------------------------------
Program Committee

Maxim Babenko (HSE and Yandex, Russia)
René van Bevern (Novosibirsk State University, Russia)
Mikołaj Bojańczyk (University of Warsaw, Poland)
Holger Dell (Saarland University, Germany)
Edith Elkind (Oxford, UK)
Fedor V. Fomin (University of Bergen, Norway), chair
Fabrizio Grandoni (IDSIA, Switzerland)
Dmitry Itsykson (St. Petersburg Department of Steklov Institute of 
Mathematics, Russia)
Mikko Koivisto (University of Helsinki, Finland)
Antonina Kolokolova (Memorial University of Newfoundland, Canada)
Alexander S. Kulikov (St. Petersburg Department of Steklov Institute of 
Mathematics, Russia)
Jakob Nordström (KTH Royal Institute of Technology, Sweden)
Alexander Okhotin  (St. Petersburg State University, Russia)
Vladimir V. Podolskii (Steklov Mathematical Institute and HSE, Russia)
Ilya Razenshteyn (Columbia University, USA)
Saket Saurabh (IMSC, India and University of Bergen, Norway)
Alexander Shen (LIRMM, France and IITP, Russia)
Arseny Shur (Ural Federal University, Russia)
Dirk Oliver Theis (University of Tartu, Estonia)
Meirav Zehavi (Ben-Gurion University of the Negev, Israel)

—————————————

Organizers

Vladimir V. Podolskii (Steklov Mathematical Institute and HSE, Russia), 
conference chair
Alexey Milovanov (HSE, Russia)
Alexander Rubtsov (HSE, Russia)


---------------------------------
Steering Committee for the CSR series

Edward A. Hirsch (St.Petersburg, RU)
Juhani Karhumaki (Turku, FI)
Alexander S. Kulikov (St. Petersburg, RU)
Ernst W. Mayr (Munich, DE)
Alexander Razborov (Chicago, US and Moscow, RU)
Mikhail Volkov (Ekaterinburg, RU)

---------------------------------
Previous CSR conferences


The list of previous CSR webpages can be found at
http://logic.pdmi.ras.ru/~csr/




More information about the Proof-Complexity mailing list