International Symposium on Theoretical Aspects of Computer Science (STACS)

algorithms and data structures,
including: design of parallel, distributed, approximation, and randomized algorithms; analysis of algorithms and combinatorics of data structures; computational geometry, cryptography, algorithmic learning theory, algorithmic game theory;

automata and formal languages,
including: algebraic and categorical methods, coding theory;

complexity and computability,
including: computational and structural complexity theory, parameterized complexity, randomness in computation;

logic in computer science,
including: finite model theory, database theory, semantics, specification verification, rewriting and deduction;

current challenges,
for example: natural computing, quantum computing, mobile and net computing.