Stefan Göller

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 18

Top Venues

CoRR

STACS

LICS

ACM Trans. Comput. Log.

University of Leipzig (PHD)

Education History

University of Leipzig

PHD

Publications

Stefan Göller, Nathan Grosshans
The AC⁰-Complexity of Visibly Pushdown Languages. STACS (2024)
Stefan Göller, Nathan Grosshans
-Complexity Of Visibly Pushdown Languages. CoRR (2023)
Stefan Göller, Pawel Parys
Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-Complete. SODA (2023)
Stefan Göller, Mathieu Hilaire
Reachability in Two-Parametric Timed Automata with One Parameter Is EXPSPACE-Complete. STACS (2021)
Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, Ranko Lazic, Pierre McKenzie, Patrick Totzke
The Reachability Problem for Two-Dimensional Vector Addition Systems with States. J. ACM 68 (5) (2021)
Stefan Göller, Pawel Parys
Bisimulation Finiteness of Pushdown Systems Is Elementary. LICS (2020)
Stefan Göller, Pawel Parys
Bisimulation Finiteness of Pushdown Systems Is Elementary. CoRR (2020)
Stefan Göller, Mathieu Hilaire
Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete. CoRR (2020)
Arnaud Carayol, Stefan Göller
On long words avoiding Zimin patterns. CoRR (2019)
Arnaud Carayol, Stefan Göller
On Long Words Avoiding Zimin Patterns. Theory Comput. Syst. 63 (5) (2019)
Moses Ganardi, Stefan Göller, Markus Lohrey
The Complexity of Bisimulation and Simulation on Finite Systems. Log. Methods Comput. Sci. 14 (4) (2018)
Moses Ganardi, Stefan Göller, Markus Lohrey
The Complexity of Bisimulation and Simulation on Finite Systems. CoRR (2018)
Stanislav Böhm, Stefan Göller, Simon Halfon, Piotr Hofman
On Büchi One-Counter Automata. STACS (2017)
Arnaud Carayol, Stefan Göller
On Long Words Avoiding Zimin Patterns. STACS (2017)
Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. ICALP (2016)
Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. CoRR (2016)
Thomas Colcombet, Stefan Göller
Games with bound guess actions. LICS (2016)
Moses Ganardi, Stefan Göller, Markus Lohrey
On the Parallel Complexity of Bisimulation on Finite Systems. CSL (2016)
Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. LICS (2015)
Stefan Göller, Jean Christoph Jung, Markus Lohrey
The Complexity of Decomposing Modal and First-Order Theories. ACM Trans. Comput. Log. 16 (1) (2015)
Stefan Göller, Anthony Widjaja Lin
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems. ACM Trans. Comput. Log. 15 (4) (2014)
Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie
Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete. CoRR (2014)
Stefan Göller, Markus Lohrey
The First-Order Theory of Ground Tree Rewrite Graphs Log. Methods Comput. Sci. 10 (1) (2014)
Stanislav Böhm, Stefan Göller, Petr Jancar
Bisimulation equivalence and regularity for real-time one-counter automata. J. Comput. Syst. Sci. 80 (4) (2014)
Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski
Bisimilarity of Pushdown Automata is Nonelementary. LICS (2013)
Stanislav Böhm, Stefan Göller, Petr Jancar
Equivalence of deterministic one-counter automata is NL-complete. STOC (2013)
Stefan Göller
The Fixed-Parameter Tractability of Model Checking Concurrent Systems. CSL (2013)
Stanislav Böhm, Stefan Göller, Petr Jancar
Equivalence of Deterministic One-Counter Automata is NL-complete CoRR (2013)
Alain Finkel, Stefan Göller, Christoph Haase
Reachability in Register Machines with Polynomial Updates. MFCS (2013)
Stefan Göller, Markus Lohrey
Branching-Time Model Checking of One-Counter Processes and Timed Automata. SIAM J. Comput. 42 (3) (2013)
Romain Brenguier, Stefan Göller, Ocan Sankur
A Comparison of Succinctly Represented Finite-State Systems. CONCUR (2012)
Stefan Göller, Jean Christoph Jung, Markus Lohrey
The Complexity of Decomposing Modal and First-Order Theories. LICS (2012)
Christopher H. Broadbent, Stefan Göller
On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two. FSTTCS (2012)
Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiss
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers CoRR (2012)
Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski
Bisimilarity of Pushdown Systems is Nonelementary CoRR (2012)
Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell
Branching-Time Model Checking of Parametric One-Counter Automata. FoSSaCS (2012)
Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiß
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. Advances in Modal Logic (2012)
Stefan Göller, Anthony Widjaja Lin
Concurrency Makes Simple Theories Hard. STACS (2012)
Stefan Göller, Anthony Widjaja Lin
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems. CONCUR (2011)
Stefan Göller, Markus Lohrey
The First-Order Theory of Ground Tree Rewrite Graphs. FSTTCS (2011)
Stefan Göller, Markus Lohrey
Fixpoint Logics over Hierarchical Structures. Theory Comput. Syst. 48 (1) (2011)
Stanislav Böhm, Stefan Göller
Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete. MFCS (2011)
Stefan Göller, Anthony Widjaja Lin
The Complexity of Verifying Ground Tree Rewrite Systems. LICS (2011)
Stanislav Böhm, Stefan Göller, Petr Jancar
Bisimilarity of One-Counter Processes Is PSPACE-Complete. CONCUR (2010)
Stefan Göller, Markus Lohrey
Branching-time Model Checking of One-counter Processes. STACS (2010)
Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell
Model Checking Succinct and Parametric One-Counter Automata. ICALP (2) (2010)
Stefan Göller, Markus Lohrey
Branching-time model checking of one-counter processes CoRR (2009)
Stefan Göller, Markus Lohrey, Carsten Lutz
PDL with intersection and converse: satisfiability and infinite-state model checking. J. Symb. Log. 74 (1) (2009)
Stefan Göller, Richard Mayr, Anthony Widjaja To
On the Computational Complexity of Verifying One-Counter Processes. LICS (2009)
Stefan Göller, Markus Lohrey
Branching-time model checking of one-counter processes CoRR (2009)
Stefan Göller, Dirk Nowotka
A note on an extension of PDL. J. Appl. Log. 6 (4) (2008)
Stefan Göller
Reachability on prefix-recognizable graphs. Inf. Process. Lett. 108 (2) (2008)
Stefan Göller, Dirk Nowotka
On a Non-Context-Free Extension of PDL CoRR (2007)
Stefan Göller, Markus Lohrey, Carsten Lutz
PDL with Intersection and Converse is 2EXP-complete. Algorithmic-Logical Theory of Infinite Structures (2007)
Stefan Göller
On the Complexity of Reasoning About Dynamic Policies. CSL (2007)
Stefan Göller, Markus Lohrey, Carsten Lutz
PDL with Intersection and Converse Is 2 EXP-Complete. FoSSaCS (2007)
Stefan Göller, Markus Lohrey
Infinite State Model-Checking of Propositional Dynamic Logics. CSL (2006)
Stefan Göller, Markus Lohrey
Fixpoint Logics on Hierarchical Structures. FSTTCS (2005)
Stefan Göller, Gérard Milmeister
Composition on Distributed RUBATO by Affine Transformations and Deformations of Musical Structures. ICMC (2003)

Stefan Göller.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Stefan Göller