Symposium on Theoretical Aspects of Computer Science

Lyon, France, 05/03/2014 – 08/03/2014

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: parallel, distributed, approximation, and randomized algorithms, computational geometry, cryptography, algorithmic learning theory, analysis of algorithms;
  • automata and formal languages, games;
  • computational complexity, parameterized complexity, randomness in computation;
  • logic in computer science, including: semantics, specification and verification, rewriting and deduction;
  • current challenges, for example: natural computing, quantum computing, mobile and net computing.
Topics of Interest

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: parallel, distributed, approximation, and randomized algorithms, computational geometry, cryptography, algorithmic learning theory, analysis of algorithms;
  • automata and formal languages, games;
  • computational complexity, parameterized complexity, randomness in computation;
  • logic in computer science, including: semantics, specification and verification, rewriting and deduction;
  • current challenges, for example: natural computing, quantum computing, mobile and net computing.
Tags:

Event

Symposium on Theoretical Aspects of Computer Science

— acronym

STACS

— type

symposium

— series

31st International Symposium on Theoretical Aspects of Computer Science (31st, 2014)

— where

Lyon, France

— when

05/03/2014–08/03/2014

Dates

— paper submission

20/09/2013

— notification

06/12/2013

— camera-ready

08/01/2014

URLs

home page
submission

Partita IVA: 01131710376 - Copyright © 2008-2022 APICe@DISI Research Group - PRIVACY