STACS 2022: 39th International Symposium on Theoretical Aspects of Computer Science

Beschreibung

Authors are invited to submit papers presenting original and unpublished research 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.