Volume 55, Issue 4

November 2014

Theoretical Aspects of Computer Science

Issue Editors:

9 articles in this issue

Preface of STACS 2012 Special Issue
Christoph Dürr
Thomas Wilke
EditorialNotes 08 January 2014 Pages: 637 - 639
\(\frac{13}{9}\)-Approximation for Graphic TSP
Marcin Mucha
OriginalPaper Open access 07 December 2012 Pages: 640 - 657
Playing Mastermind with Constant-Size Memory
Benjamin Doerr
Carola Winzen
OriginalPaper 11 November 2012 Pages: 658 - 684
The Complexity of Compressed Membership Problems for Finite Automata
Artur Jeż
OriginalPaper Open access 18 January 2013 Pages: 685 - 718
Linear-Space Data Structures for Range Mode Query in Arrays
Timothy M. Chan
Stephane Durocher
Bryan T. Wilkinson
OriginalPaper 08 March 2013 Pages: 719 - 741
Efficient Algorithms for Highly Compressed Data: The Word Problem in Generalized Higman Groups Is in P
Jürn Laun
OriginalPaper 10 October 2013 Pages: 742 - 770
On First-Order Logic and CPDA Graphs
Christopher H. Broadbent
OriginalPaper 06 February 2014 Pages: 771 - 832
On the Separation Question for Tree Languages
André Arnold
Henryk Michalewski
Damian Niwiński
OriginalPaper Open access 22 March 2013 Pages: 833 - 855
Model-Theoretic Properties of ω-Automatic Structures
Faried Abu Zaid
Erich Grädel
Wied Pakusa
OriginalPaper 17 October 2013 Pages: 856 - 880

Search