International Symposium on Theoretical Aspects of Computer Science

Aperçu

STACS 2026 will consist of two tracks, A and B. Track A focuses on algorithms, data structures, and complexity; while Track B focuses on automata, logic, semantics, and theory of programming. Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of computer science. Topics covered by the tracks include, but are not limited to, the following. Track A : Algorithm Design, Data Structures, and Complexity: Approximation algorithms, Online algorithms, Distributed/parallel algorithms, Parameterized algorithms, Randomized algorithms, Analysis of algorithms, Combinatorics of data structures, Computational geometry, Cryptography, Algorithms for machine learning, Algorithmic game theory, Quantum algorithms, Computational and structural complexity theory, Parameterized complexity, Randomness in computation. Track B : Automata, Logic, Semantics and Theory of Programming: Automata theory, Games and multi-agent systems, Algebraic and categorical methods, Models of computation, Concurrency, Timed systems, Finite model theory, Database theory, Semantics, Type systems, Program analysis, Specification and verification, Rewriting and deduction, Learning theory, Logical aspects of computability and complexity. Submissions should be made through EasyChair. Format of submissions: Authors are invited to submit an extended abstract or a full paper with at most 15 pages; this page limit excludes the title page, the references section, and a possible appendix. In preparation of submissions, the usage of the LIPIcs style file is mandatory. Double-blind reviewing: STACS 2026 will employ a lightweight double-blind reviewing process. Proceedings: Accepted papers will be published in the proceedings of the symposium in the Leibniz International Proceedings in Informatics (LIPIcs) series.

Classement source

Carte