Volume 60, Issue 3

April 2017

Special Issue: Theoretical Aspects of Computer Science

Issue Editors:

9 articles in this issue

Editor’s Note

News 16 February 2017 Pages: 377 - 377
Partition Expanders
Dmitry Gavinsky
Pavel Pudlák
OriginalPaper 14 December 2016 Pages: 378 - 395
Genericity of Weakly Computable Objects
Mathieu Hoyrup
OriginalPaper 09 December 2016 Pages: 396 - 420
Higher Randomness and Forcing with Closed Sets
Benoit Monin
OriginalPaper 11 June 2016 Pages: 421 - 437
On Boolean Closed Full Trios and Rational Kripke Frames
Georg Zetzsche
Dietrich Kuske
Markus Lohrey
OriginalPaper 25 July 2016 Pages: 438 - 472
New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings
F. Blanchet-Sadri
Michelle Bodnar
Benjamin De Winkle
OriginalPaper 16 January 2016 Pages: 473 - 497
A Solution to Wiehagen’s Thesis
Timo Kötzing
OriginalPaper 21 April 2016 Pages: 498 - 520
On Symmetric Circuits and Fixed-Point Logics
Matthew Anderson
Anuj Dawar
OriginalPaper Open access 13 July 2016 Pages: 521 - 551
2-Stack Sorting is Polynomial
Adeline Pierrot
Dominique Rossin
OriginalPaper 16 March 2017 Pages: 552 - 579

Search