Logic List Mailing Archive

CSR-2014: Computer Science Symposium in Russia

6-12 June 2014
Moscow, Russia

CSR-2014: First Call for Papers

The 9th International Computer Science Symposium in Russia
June 6-12, 2014, Moscow, Russia
http://logic.pdmi.ras.ru/csr2014

Program Committee Chair:
  Jean-Eric Pin (CNRS and U. Paris-Diderot)

Program Committee:
  Eric Allender (Rutgers)
  Andris Ambainis (U. of Latvia)
  Christel Baier (TU Dresden)
  Petra Berenbrink (Simon Fraser U.)
  Mikolaj Bojanczyk (U. of Warsaw)
  Andrei Bulatov (Simon Fraser U.)
  Victor Dalmau (U. Pompeu Fabra)
  Manfred Droste (U. of Leipzig)
  Zoltan Esik (U. of Szeged)
  Fedor Fomin (U. of Bergen)
  Edward A. Hirsch (Steklov Inst./St.Petersburg)
  Gregory Kucherov (CNRS and U. Marne-la-Vallee)
  Michal Kunc (Masaryk U.)
  Leonid Libkin (U. of Edinburgh)
  Konstantin Makarychev (Microsoft Research)
  Kurt Mehlhorn (Max-Planck Inst.)
  Georg Moser (U. of Innsbruck)
  Alexander Okhotin (U. of Turku)
  Giovanni Pighizzini (U. of Milano)
  Alexander Razborov (U. of Chicago and Steklov Inst./Moscow)
  Michel Rigo (U. of Liege)
  Nicole Schweikardt (U. of Frankfurt)
  Jacobo Toran (U. of Ulm)
  Mikhail Volkov (Ural Federal U.)
  Carsten Witt (TU Denmark)

Distinguished opening lecture:
  Shafi Goldwasser (MIT)

Invited Speakers include:
  Mark Braverman (Princeton)
  Volker Diekert (Stuttgart)
  Martin Grohe (RWTH Aachen)
  Benjamin Rossman (National Institute of Informatics, Tokyo)
  Alexei Semenov (Moscow)
  Igor Walukiewicz (Bordeaux)

Important Dates:
  Submission: December 9, 2013
  Notification: February 12, 2014

Topics: include, but are not limited to:
  algorithms and data structures
  algorithms for concurrent and distributed systems, networks
  computational complexity
  proof complexity
  Kolmogorov complexity
  combinatorial optimization
  constraint solving
  cryptography
  combinatorics in computer science
  automata theory and formal languages
  computational models and concepts
  database theory
  applications of logic to computer science
  proof theory
  model checking
  automated reasoning
  deductive methods

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=csr2014

Yandex Awards
  for the best paper and for the best student paper will be given by the PC.

Conference co-Chairs:
  Nikolay Vereshchagin (Moscow)
  Edward A. Hirsch (St.Petersburg)
  Sergey O. Kuznetsov (Moscow)

Organized by
  Moscow Center for Continuous Mathematical Education,
  Higher School of Economics,
  Steklov Institute of Mathematics at St.Petersburg of Russian Academy of Sciences

Sponsored by
  Yandex
  Russian Foundation for Basic Research

Further information and contacts:
  Web: http://logic.pdmi.ras.ru/csr2014
  Email: csr2014 "at" googlegroups.com