31st International Symposium on Theoretical Aspects of Computer Science
Lyon, France, 05/03/2014–08/03/2014
Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of computer science. Typical areas include (but are not limited to):
- algorithms and data structures, including: parallel, distributed, approximation, and randomized algorithms, computational geometry, cryptography, algorithmic learning theory, analysis of algorithms;
- automata and formal languages, games;
- computational complexity, parameterized complexity, randomness in computation;
- logic in computer science, including: semantics, specification and verification, rewriting and deduction;
- current challenges, for example: natural computing, quantum computing, mobile and net computing.
topics of interest
Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of computer science. Typical areas include (but are not limited to):
- algorithms and data structures, including: parallel, distributed, approximation, and randomized algorithms, computational geometry, cryptography, algorithmic learning theory, analysis of algorithms;
- automata and formal languages, games;
- computational complexity, parameterized complexity, randomness in computation;
- logic in computer science, including: semantics, specification and verification, rewriting and deduction;
- current challenges, for example: natural computing, quantum computing, mobile and net computing.