Theory of Computing Systems gratefully acknowledges the editorial work of the following scholars on this special issue “Theoretical Aspects of Computer Science” (STACS 2014):
Natacha Portier, Université de Lyon
Ernst Mayr, Technische Universität München
Laurent Doyen, Université Grenoble Alpes
The eight papers in this issue are:
-
Partition Expanders, Dmitry Gavinsky, Pavel Pudlák
-
Genericity of Weakly Computable Objects, Mathieu Hoyrup
-
Higher Randomness and Forcing with Closed Sets, Benoit Monin
-
On Boolean Closed Full Trios and Rational Kripke Frames, Georg Zetzsche, Dietrich Kuske, Markus Lohrey
-
New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings, F. Blanchet-Sadri, Michelle Bodnar, Benjamin De Winkle
-
A Solution to Wiehagen’s Thesis, Timo Kötzing
-
On Symmetric Circuits and Fixed-Point Logics, Matthew Anderson, Anuj Dawar
-
2-Stack Sorting is polynomial, Adeline Pierrot, Dominique Rossin
Change history
28 December 2017
The Publisher regrets the following error in Guest Editor affiliation where it states Laurent Doyen, Université Grenoble Alpes it should read Laurent Doyen, CNRS & LSV, ENS Paris-Saclay.
Rights and permissions
About this article
Cite this article
Editor’s Note. Theory Comput Syst 60, 377 (2017). https://doi.org/10.1007/s00224-017-9750-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-017-9750-4