Composition on Distributed RUBATO by Affine Transformations and Deformations of Musical Structures. - Stefan Göller; Gérard Milmeister (ICMC, 2003)

Fixpoint Logics on Hierarchical Structures. - Stefan Göller; Markus Lohrey (FSTTCS, 2005)

Infinite State Model-Checking of Propositional Dynamic Logics. - Stefan Göller; Markus Lohrey (CSL, 2006)

On the Complexity of Reasoning About Dynamic Policies. - Stefan Göller (CSL, 2007)

PDL with Intersection and Converse is 2EXP-complete. - Stefan Göller; Markus Lohrey; Carsten Lutz (Algorithmic-Logical Theory of Infinite Structures, 2007)

PDL with Intersection and Converse Is 2 EXP-Complete. - Stefan Göller; Markus Lohrey; Carsten Lutz (FoSSaCS, 2007)

On a Non-Context-Free Extension of PDL - Stefan Göller; Dirk Nowotka (CoRR, 2007)

Reachability on prefix-recognizable graphs. - Stefan Göller (Inf. Process. Lett., 2008)

A note on an extension of PDL. - Stefan Göller; Dirk Nowotka (J. Appl. Log., 2008)

Computational complexity of propositional dynamic logics. - Stefan Göller (2008)

On the Computational Complexity of Verifying One-Counter Processes. - Stefan Göller; Richard Mayr; Anthony Widjaja To (LICS, 2009)

PDL with intersection and converse: satisfiability and infinite-state model checking. - Stefan Göller; Markus Lohrey; Carsten Lutz (J. Symb. Log., 2009)

Bisimilarity of One-Counter Processes Is PSPACE-Complete. - Stanislav Böhm; Stefan Göller; Petr Jancar (CONCUR, 2010)

Model Checking Succinct and Parametric One-Counter Automata. - Stefan Göller; Christoph Haase; Joël Ouaknine; James Worrell 001 (ICALP (2), 2010)

Branching-time Model Checking of One-counter Processes. - Stefan Göller; Markus Lohrey (STACS, 2010)

The Complexity of Verifying Ground Tree Rewrite Systems. - Stefan Göller; Anthony Widjaja Lin (LICS, 2011)

Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete. - Stanislav Böhm; Stefan Göller (MFCS, 2011)

Fixpoint Logics over Hierarchical Structures. - Stefan Göller; Markus Lohrey (Theory Comput. Syst., 2011)

The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. - Stefan Göller; Arne Meier; Martin Mundhenk; Thomas Schneider 002; Michael Thomas 001; Felix Weiß (Advances in Modal Logic, 2012)

A Comparison of Succinctly Represented Finite-State Systems. - Romain Brenguier; Stefan Göller; Ocan Sankur (CONCUR, 2012)

Branching-Time Model Checking of Parametric One-Counter Automata. - Stefan Göller; Christoph Haase; Joël Ouaknine; James Worrell 001 (FoSSaCS, 2012)

On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two. - Christopher H. Broadbent; Stefan Göller (FSTTCS, 2012)

Concurrency Makes Simple Theories Hard. - Stefan Göller; Anthony Widjaja Lin (STACS, 2012)

Bisimilarity of Pushdown Systems is Nonelementary - Michael Benedikt; Stefan Göller; Stefan Kiefer; Andrzej S. Murawski (CoRR, 2012)

The Fixed-Parameter Tractability of Model Checking Concurrent Systems. - Stefan Göller (CSL, 2013)

Bisimilarity of Pushdown Automata is Nonelementary. - Michael Benedikt; Stefan Göller; Stefan Kiefer; Andrzej S. Murawski (LICS, 2013)

Reachability in Register Machines with Polynomial Updates. - Alain Finkel; Stefan Göller; Christoph Haase (MFCS, 2013)

Equivalence of deterministic one-counter automata is NL-complete. - Stanislav Böhm; Stefan Göller; Petr Jancar (STOC, 2013)

Branching-Time Model Checking of One-Counter Processes and Timed Automata. - Stefan Göller; Markus Lohrey (SIAM J. Comput., 2013)

The First-Order Theory of Ground Tree Rewrite Graphs - Stefan Göller; Markus Lohrey (Log. Methods Comput. Sci., 2014)

Bisimulation equivalence and regularity for real-time one-counter automata. - Stanislav Böhm; Stefan Göller; Petr Jancar (J. Comput. Syst. Sci., 2014)

Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems. - Stefan Göller; Anthony Widjaja Lin (ACM Trans. Comput. Log., 2014)

Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. - Michael Blondin; Alain Finkel; Stefan Göller; Christoph Haase; Pierre McKenzie (LICS, 2015)

The Complexity of Decomposing Modal and First-Order Theories. - Stefan Göller; Jean Christoph Jung; Markus Lohrey (ACM Trans. Comput. Log., 2015)

On the Parallel Complexity of Bisimulation on Finite Systems. - Moses Ganardi; Stefan Göller; Markus Lohrey (CSL, 2016)

A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. - Stefan Göller; Christoph Haase; Ranko Lazic 001; Patrick Totzke (ICALP, 2016)

Games with bound guess actions. - Thomas Colcombet; Stefan Göller (LICS, 2016)

On Büchi One-Counter Automata. - Stanislav Böhm; Stefan Göller; Simon Halfon; Piotr Hofman (STACS, 2017)

The Complexity of Bisimulation and Simulation on Finite Systems. - Moses Ganardi; Stefan Göller; Markus Lohrey (Log. Methods Comput. Sci., 2018)

On Long Words Avoiding Zimin Patterns. - Arnaud Carayol; Stefan Göller (Theory Comput. Syst., 2019)

Bisimulation Finiteness of Pushdown Systems Is Elementary. - Stefan Göller; Pawel Parys (LICS, 2020)

The Reachability Problem for Two-Dimensional Vector Addition Systems with States. - Michael Blondin; Matthias Englert; Alain Finkel; Stefan Göller; Christoph Haase; Ranko Lazic 001; Pierre McKenzie; Patrick Totzke (J. ACM, 2021)

Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-Complete. - Stefan Göller; Pawel Parys (SODA, 2023)

The AC0-Complexity Of Visibly Pushdown Languages. - Stefan Göller; Nathan Grosshans (CoRR, 2023)

The AC⁰-Complexity of Visibly Pushdown Languages. - Stefan Göller; Nathan Grosshans (STACS, 2024)

Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete. - Stefan Göller; Mathieu Hilaire (Theory Comput. Syst., 2024)