Collection
Theoretical Aspects of Computer Science (STACS 2016)
This collection contains five articles which are based on extended abstracts presented at the 33rd Symposium on Theoretical Aspects of Computer Science (STACS). The conference was organized by the Laboratoire d'Informatique Fondamentale d'Orléans, France, from February 17-20, 2016. The extended abstracts were chosen among the top papers of those which were selected for presentation in a highly competitive peer-review process.
Editors
-
Christoph Dürr
Christoph Dürr, researcher at CNRS LIP6, Sorbonne University, Paris, France.
-
Heribert Vollmer
Heribert Vollmer is a Professor of Theoretical Computer Science and Managing Director of the Institute for Theoretical Computer Science at the Leibniz Universität Hannover, Germany.
Articles (7 in this collection)
-
-
-
-
-
Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes
Authors (first, second and last of 5)
-
-
