The 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) was held online, March 15-18 2022. It was organised by LIS (Aix-Marseille University, CNRS).

The original plan was to organise the conference in a hybrid way, with an on-site presence component in Marseille. However, due to the evolution of the Covid-19 pandemic, and to ensure the best experience to all participants, the organisation committee decided to switch to an online event.

The proceedings of the conference are available online here.

Topics

STACS is a conference on theoretical aspects of computer science. Typical areas include (but are not limited to):

  • Algorithms and data structures, 
    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.
  • 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, computational social choice.

Theoretical Computer Scientists for Future

Sponsors

logo AMU        logo LIS       CNRS-logo      institut-archimede

   

Important dates

Submission deadline

October 1st, 2021, 23:59 (AoE)

Rebuttal period: 

November 23-28, 2021

Notification:

December 20, 2021

Final version:

January 17, 2022

Conference:

March 15-18, 2022

Online user: 1