Creative Commons
| Preface Wolfgang Thomas | ||
| The Complexity of Nash Equilibria in Stochastic Multiplayer Games | ||
| Michael Ummels and Dominik Wojtczak | ||
| A decidable characterization of locally testable tree languages | ||
| Thomas Place and Luc Segoufin | ||
| Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus | ||
| Naoki Kobayashi and C.-H. Luke Ong | ||
| On Constructor Rewrite Systems and the Lambda Calculus | ||
| Ugo Dal Lago and Simone Martini | ||
| Weak Alternating Timed Automata | ||
| Pawel Parys and Igor Walukiewicz | ||
| Forward Analysis for WSTS, Part II: Complete WSTS | ||
| Alain Finkel and Jean Goubault-Larrecq | ||
| Essential Convexity and Complexity of Semi-Algebraic Constraints | ||
| Manuel Bodirsky, Peter Jonsson and Timo von Oertzen | ||
| Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds | ||
| Lars Kuhtz and Bernd Finkbeiner | ||
| Regular Cost Functions, Part I: Logic and Algebra over Words | ||
| Thomas Colcombet | ||