演算法與計算理論學會

Association of Algorithm and Computation Theory

研討會訊息公告

Title
11th INTERNATIONAL COMPUTER SCIENCE SYMPOSIUM IN RUSSIA (CSR 2016), St. Petersburg, Russia, June 9-13, 2016
Important Dates
Deadline for submissions: December 11, 2015
Notification of acceptance: February 11, 2016
Conference dates: June 9-13, 2016
Link
http://logic.pdmi.ras.ru/csr2016/
Information

CSR is an annual conference that intends to reflect the broad scope of international cooperation in computer science. In 2006-2009 the symposium consisted of two tracks:
Theory Track and Applications and Technology Track, and since 2010 it has a single track.
The topics covered vary from year to year, but in general try to cover as much of the contemporary computer science as possible. As has become tradition, there will be ANDEX AWARDs for the best paper and for the best student paper!

 

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

 

OPENING LECTURE:
Christos H. Papadimitriou (University of California at Berkeley, USA)

PROGRAM COMMITTEE:
Gerhard J. Woeginger (Eindhoven University of Technology, Netherlands; Chair)
Eric Allender (Rutgers, the State University of NJ, USA)
Maxim Babenko (Moscow State University, Russia)
Marek Chrobak (University of California, USA)
Volker Diekert (Universität Stuttgart, Germany)
Leah Epstein (University of Haifa, Israel)
Fedor V. Fomin (University of Bergen, Norway)
Lane A. Hemaspaandra (University of Rochester, USA)
Kazuo Iwama (Kyoto University, Japan)
Juhani Karhumäki (University of Turku, Finland)
Piotr Krysta (University of Liverpool, UK)
Andrei Krokhin (Durham University, UK)
Alexander S. Kulikov (St. Petersburg Department of Steklov Institute
of Mathematics, Russia)
Yuri Matiyasevich (St. Petersburg Department of Steklov Institute of
Mathematics, Russia)
Elvira Mayordomo (Universidad de Zaragoza, Spain)
Rolf Niedermeier (Technische Universität Berlin, Germany)
Vladimir Podolskii (Steklov Mathematical Institute of Russian Academy
of Sciences, Russia)
Don Sannella (University of Edinburgh, Scotland)
Miklos Santha (Université Paris Diderot, France)
Thomas Schwentick (Technische Universität Dortmund, Germany)
Tatiana Starikovskaya (University of Bristol, UK)
Wolfgang Thomas (Aachen U., Germany)
Ryan Williams (Stanford University, USA)


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

 

SUBMISSIONS:
AAuthors 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.

Submission server TBA

 

OTHER EVENTS IN ST. PETERSBURG:
A Special Semester on Computational and Proof Complexity, April - June, 2016
http://en.chebyshev.spb.ru/complexity2016/
* Workshop on Proof Complexity, May 17 - 20, 2016
* Workshop on Low-Depth Complexity, May 23 - 25, 2016
International Symposium on Experimental Algorithms (SEA 2016), June 5-8, 2016



FURTHER INFORMATION AND CONTACTS:
Web: http://logic.pdmi.ras.ru/csr2016/
Email: csr2016info@gmail.com