STACS 2012 - Symposium on Theoretical Aspects of Computer Science
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.
http://stacs2012.lip6.fr/
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.
http://stacs2012.lip6.fr/
Other CFPs
- Psychology of Programming Interest Group Annual Conference 2011
- Special Issue on Collaborative Usage and Development of Models and other Visualizations (CollabViz)- International Journal of e-Collaboration
- The World GIS Summit Congress and Exhibition
- First International Online Conference on Computing 2011
- Internation Conference on Interactive Systems 2012
Last modified: 2011-05-20 22:54:00