| No. |
Title |
Author |
Year |
| 1 |
Reachability in Two-Parametric Timed Automata with One Parameter Is EXPSPACE-Complete |
Göller, Stefan et al. |
2021 |
| 2 |
On Büchi One-Counter Automata |
Böhm, Stanislav et al. |
2017 |
| 3 |
On Long Words Avoiding Zimin Patterns |
Carayol, Arnaud et al. |
2017 |
| 4 |
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One |
Göller, Stefan et al. |
2016 |
| 5 |
On the Parallel Complexity of Bisimulation on Finite Systems |
Ganardi, Moses et al. |
2016 |
| 6 |
The Fixed-Parameter Tractability of Model Checking Concurrent Systems |
Göller, Stefan |
2013 |
| 7 |
Concurrency Makes Simple Theories Hard |
Göller, Stefan et al. |
2012 |
| 8 |
On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two |
Broadbent, Christopher et al. |
2012 |
| 9 |
The First-Order Theory of Ground Tree Rewrite Graphs |
Göller, Stefan et al. |
2011 |
| 10 |
Branching-time Model Checking of One-counter Processes |
Göller, Stefan et al. |
2010 |
| 11 |
PDL with Intersection and Converse is 2EXP-complete |
Göller, Stefan et al. |
2008 |
