STACS 2011 - The Symposium on Theoretical Aspects of Computer Science (STACS)
Topics/Call fo Papers
The Symposium on Theoretical Aspects of Computer Science (STACS) takes place each year since 1984, alternately in Germany and France.
Typical topics of the conference include:
Algorithms and data structures, including: parallel and distributed algorithms, computational geometry, cryptography, algorithmic learning theory;
Automata and formal languages;
Computational and structural complexity
Logic in computer science, including: semantics, specification, and verification of programs, rewriting and deduction;
Current challenges, for example: biological computing, quantum computing, mobile and net computing.
Location
STACS 2011 will be held at Technische Universität Dortmund in Germany.
Typical topics of the conference include:
Algorithms and data structures, including: parallel and distributed algorithms, computational geometry, cryptography, algorithmic learning theory;
Automata and formal languages;
Computational and structural complexity
Logic in computer science, including: semantics, specification, and verification of programs, rewriting and deduction;
Current challenges, for example: biological computing, quantum computing, mobile and net computing.
Location
STACS 2011 will be held at Technische Universität Dortmund in Germany.
Other CFPs
- The 38th International Colloquium on Automata, Languages and Programming
- 13th Workshop on Hot Topics in Operating Systems (HotOS XIII 2011)
- 23rd ACM Symposium on Operating Systems Principles (SOSP)
- SOCC '12 ACM Symposium on Cloud Computing
- International Workshop on Web, Mobile, and Cloud Services (WMCS)
Last modified: 2010-09-21 20:37:55