6th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2011) June 14-18, 2011, St. Petersburg, Russia http://logic.pdmi.ras.ru/csr2011/ CSR 2011 intends to reflect the broad scope of international cooperation in computer science. It is the sixth conference in a series of regular events started with CSR 2006 in St. Petersburg (see LNCS 3967), CSR 2007 in Ekaterinburg (see LNCS 4649), CSR 2008 in Moscow (see LNCS 5010), CSR 2009 in Novosibirsk (see LNCS 5675), and CSR 2010 in Kazan (see LNCS 6072).

Poster

As usual, there will be YANDEX AWARDs for the best paper and for the best student paper.

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

computational models and concepts

algorithms for concurrent and distributed systems, networks

proof theory and applications of logic to computer science

model checking

automated reasoning

deductive methods

Dima Grigoriev (Institut des Mathematiques de Lille, France)

Manindra Agrawal (Indian Institute of Technology Kanpur, India)

Andrei Bulatov (Simon Fraser University, Canada)

Jarkko Kari (University of Turku, Finland)

Alexander Shen (LIF Marseille, France)

Amir Shpilka (Technion, Israel)

Madhu Sudan (MIT & Microsoft Research, USA)

Sergey Yekhanin (Microsoft Research, USA)

The full list of invited speakers TBA.

Nikolai K. Vereshchagin (Moscow State University, Russia; Chair)

Farid Ablayev (Kazan State University, Russia)

Maxim Babenko (Moscow State University, Russia)

Olivier Carton (Universite Paris Diderot, France)

Bruno Durand (Universite de Provence, Marseille)

Anna Frid (Sobolev Institute of Mathematics, Russia)

Valentine Kabanets (Simon Fraser University, Canada)

Juhani Karhumaki (University of Turku, Finland)

Michal Koucky (Institute of Mathematics, Czech Republic)

Meena Mahajan (Institute of Mathematical Sciences, India)

Yuri Matiyasevich (Steklov Institute of Mathematics at St. Petersburg, Russia)

Pierre McKenzie (Universite de Montreal, Canada)

Ilya Mironov (Microsoft Research, USA)

Ilan Newman (Haifa University, Israel)

Alexander Razborov (University of Chicago, USA and Steklov Mathematical Institute, Russia)

Miklos Santha (Universite Paris-Sud, France)

Nitin Saxena (Hausdorff Center for Mathematics, Germany)

Valentin Shehtman (Institute for the Information Transmission Problems, Russia)

Alexander Sherstov (Microsoft Research, USA)

Thomas Thierauf (Aalen University, Germany)

Oleg Verbitsky (Institute for Applied Problems of Mechanics and Mathematics, Ukraine)

Mikhail Volkov (Ural State University, Russia)

Igor Walukiewicz (Universite de Bordeaux, France)

Steklov Institute of Mathematics at St. Petersburg of the Russian Academy of Sciences

St. Petersburg Academic University of the Russian Academy of Sciences

Alexander S. Kulikov (Steklov Institute of Mathematics at St. Petersburg, Russia)

Authors are invited to submit an extended abstract or a full paper of at most 12 pages, not including references, in the LNCS format (LaTeX, as pdf; final version with source); instructions are here:

http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0

Proofs and other material omitted due to space constraints are to be put into a clearly marked appendix to be read at discretion of the referees. Papers must present original (and not previously published) research. 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.

Submissions should be uploaded to the EasyChair Conference system:

http://www.easychair.org/conferences/?conf=csr2011

Web: http://logic.pdmi.ras.ru/csr2011/

Email: csr2011()logic.pdmi.ras.ru