Symposium on Theoretical Aspects of Computer Science

The Symposium on Theoretical Aspects of Computer Science (STACS) is one of Europe's premier venues for theoretical computer science research. STACS presents original contributions across the full breadth of theoretical computing, from algorithms and complexity theory to formal language theory, logic, and computational models. The symposium has a distinguished history of showcasing foundational advances that shape the long-term direction of computer science. STACS is jointly organized by the French and German theoretical computer science communities and attracts a strong international program with participants from around the world.

algorithm design data structures and complexity automata, logic, semantics theory of programming

Authors are invited to submit papers on all aspects of theoretical computer science, including algorithms and data structures, computational complexity, automata theory, formal languages, logic in computer science, parallel and distributed computation, quantum computing, algorithmic game theory, and randomized algorithms. Submissions must present original research not published or under review elsewhere and will be evaluated by the program committee for technical correctness and significance.