| 2024 | STACS | The AC⁰-Complexity of Visibly Pushdown Languages. | Stefan Gller, Nathan Grosshans |
| 2023 | SODA | Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-Complete. | Stefan Gller, Pawel Parys |
| 2021 | STACS | Reachability in Two-Parametric Timed Automata with One Parameter Is EXPSPACE-Complete. | Stefan Gller, Mathieu Hilaire |
| 2020 | LICS | Bisimulation Finiteness of Pushdown Systems Is Elementary. | Stefan Gller, Pawel Parys |
| 2017 | STACS | On Bchi One-Counter Automata. | Stanislav Bhm, Stefan Gller, Simon Halfon, Piotr Hofman |
| 2017 | STACS | On Long Words Avoiding Zimin Patterns. | Arnaud Carayol, Stefan Gller |
| 2016 | CSL | On the Parallel Complexity of Bisimulation on Finite Systems. | Moses Ganardi, Stefan Gller, Markus Lohrey |
| 2016 | ICALP | A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. | Stefan Gller, Christoph Haase, Ranko Lazic, Patrick Totzke |
| 2016 | LICS | Games with bound guess actions. | Thomas Colcombet, Stefan Gller |
| 2015 | LICS | Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. | Michael Blondin, Alain Finkel, Stefan Gller, Christoph Haase, Pierre McKenzie |
| 2013 | CSL | The Fixed-Parameter Tractability of Model Checking Concurrent Systems. | Stefan Gller |
| 2013 | LICS | Bisimilarity of Pushdown Automata is Nonelementary. | Michael Benedikt, Stefan Gller, Stefan Kiefer, Andrzej S. Murawski |
| 2013 | MFCS | Reachability in Register Machines with Polynomial Updates. | Alain Finkel, Stefan Gller, Christoph Haase |
| 2013 | STOC | Equivalence of deterministic one-counter automata is NL-complete. | Stanislav Bhm, Stefan Gller, Petr Jancar |
| 2012 | AiML | The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. | Stefan Gller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Wei |
| 2012 | CONCUR | A Comparison of Succinctly Represented Finite-State Systems. | Romain Brenguier, Stefan Gller, Ocan Sankur |
| 2012 | FOSSACS | Branching-Time Model Checking of Parametric One-Counter Automata. | Stefan Gller, Christoph Haase, Jol Ouaknine, James Worrell |
| 2012 | LICS | The Complexity of Decomposing Modal and First-Order Theories. | Stefan Gller, Jean Christoph Jung, Markus Lohrey |
| 2012 | STACS | Concurrency Makes Simple Theories Hard. | Stefan Gller, Anthony Widjaja Lin |
| 2011 | CONCUR | Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems. | Stefan Gller, Anthony Widjaja Lin |
| 2011 | LICS | The Complexity of Verifying Ground Tree Rewrite Systems. | Stefan Gller, Anthony Widjaja Lin |
| 2011 | MFCS | Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete. | Stanislav Bhm, Stefan Gller |
| 2010 | CONCUR | Bisimilarity of One-Counter Processes Is PSPACE-Complete. | Stanislav Bhm, Stefan Gller, Petr Jancar |
| 2010 | ICALP | Model Checking Succinct and Parametric One-Counter Automata. | Stefan Gller, Christoph Haase, Jol Ouaknine, James Worrell |
| 2010 | STACS | Branching-time Model Checking of One-counter Processes. | Stefan Gller, Markus Lohrey |
| 2009 | LICS | On the Computational Complexity of Verifying One-Counter Processes. | Stefan Gller, Richard Mayr, Anthony Widjaja To |
| 2007 | CSL | On the Complexity of Reasoning About Dynamic Policies. | Stefan Gller |
| 2007 | FOSSACS | PDL with Intersection and Converse Is 2 EXP-Complete. | Stefan Gller, Markus Lohrey, Carsten Lutz |
| 2006 | CSL | Infinite State Model-Checking of Propositional Dynamic Logics. | Stefan Gller, Markus Lohrey |