Theory of Computing Systems

Editor’s Note

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