CSR 2014 - 9th International Computer Science Symposium
Topics/Call fo Papers
CSR 2014 intends to reflect the broad scope of international cooperation in computer science. It is the 9th 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), CSR 2010 in Kazan (see LNCS 6072), CSR 2011 in St.Petersburg (see LNCS 6651), CSR 2012 in Nizhny Novgorod (see LNCS 7353), and CSR 2013 in Ekaterinburg (see LNCS 7913).
Poster
IMPORTANT DATES
Deadline for submissions December 9, 2013
Notification of acceptance February 12, 2014
Conference dates June 7-11, 2014, with workshops on June 5, 6 and 12 (tentatively)
As usual, there will be Yandex awards for the best paper and for the best student paper.
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
OPENING LECTURE
Shafi Goldwasser (MIT, USA)
INVITED SPEAKERS include
Mark Braverman (Princeton University, USA)
Volker Diekert (Universität Stuttgart, Germany)
Martin Grohe (RWTH Aachen, Germany)
Benjamin Rossman (National Institute of Informatics, Tokyo, USA)
Alexei Semenov (Moscow State University, Russia)
Igor Walukiewicz (Université Bordeaux-1, France)
Poster
IMPORTANT DATES
Deadline for submissions December 9, 2013
Notification of acceptance February 12, 2014
Conference dates June 7-11, 2014, with workshops on June 5, 6 and 12 (tentatively)
As usual, there will be Yandex awards for the best paper and for the best student paper.
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
OPENING LECTURE
Shafi Goldwasser (MIT, USA)
INVITED SPEAKERS include
Mark Braverman (Princeton University, USA)
Volker Diekert (Universität Stuttgart, Germany)
Martin Grohe (RWTH Aachen, Germany)
Benjamin Rossman (National Institute of Informatics, Tokyo, USA)
Alexei Semenov (Moscow State University, Russia)
Igor Walukiewicz (Université Bordeaux-1, France)
Other CFPs
- 2nd workshop on Activity Monitoring by Multiple Distributed Sensing
- 3rd International Workshop on Multimodal Pattern Recognition for Social Signal Processing in Human Computer Interaction
- 8th International Workshop on Pattern Recognition in Remote Sensing
- 1st International Workshop on Face and Facial Expression Recognition from Real World Videos
- 2nd International Workshop on Pattern Recognition for Healthcare Analytics
Last modified: 2013-10-31 00:18:22