Collection
Theoretical Aspects of Computer Science (STACS 2018)
This collection contains eight articles which are based on extended abstracts that were presented at the 35th Symposium on Theoretical Aspects of Computer Science (STACS), which was held at the University of Caen from February 28th to March 3rd, 2018. These extended abstracts were chosen among the top papers of those that were selected for presentation at STACS 2018 in a highly competitive peer-review process (after which only 54 papers out of 186 submissions were accepted). Compared with the original extended abstracts, the articles have been extended with a description of the context, full proofs and additional results. They underwent a further rigorous reviewing process, following the TOCS Journal standards, completely independent from the selection process of STACS 2018. The topics of the chosen papers cover a rich set of areas within Theoretical Computer Science, that is, algorithmic game theory, automata theory, circuit complexity, efficient algorithms, logic and model checking, Markov chains, parameterized complexity, and proof complexity.
Editors
-
Rolf Niedermeier
Rolf Niedermeier is Professor of Theoretical Computer Science at Technical University of Berlin.
-
Brigitte Vallée
Brigitte Vallée is Directrice de Recherche at the French CNRS, at Université de Caen, since 2001 and specialized in computational number theory and analysis of algorithms.
Articles (9 in this collection)
-
-
-
Optimal Dislocation with Persistent Errors in Subquadratic Time
Authors (first, second and last of 4)
-
-
-
-
-
-
