Symposium on Theoretical Aspects of Computer Science, Caen, Frankreich

Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of computer science&#046; Typical areas include (but are not limited to):<br>algorithms and data structures,<br>including: design of parallel, distributed, approximation, parameterized and randomized algorithms; analysis of algorithms and combinatorics of data structures; computational geometry, cryptography, algorithmic learning theory, algorithmic game theory;<br>automata and formal languages,<br>including: algebraic and categorical methods, coding theory;<br>complexity and computability,<br>including: computational and structural complexity theory, parameterized complexity, randomness in computation;<br>logic in computer science,<br>including: finite model theory, database theory, semantics, specification verification, rewriting and deduction;<br>current challenges,<br>for example: natural computing, quantum computing, mobile and net computing, computational social choice&#046;<br>