Stefan Göller

According to our database1, Stefan Göller authored at least 49 papers between 2003 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
The Complexity of Bisimulation and Simulation on Finite Systems.
CoRR, 2018

2017
On Long Words Avoiding Zimin Patterns.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

On Büchi One-Counter Automata.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

2016
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One.
CoRR, 2016

Games with bound guess actions.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

On the Parallel Complexity of Bisimulation on Finite Systems.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015
The Complexity of Decomposing Modal and First-Order Theories.
ACM Trans. Comput. Log., 2015

Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems.
ACM Trans. Comput. Log., 2014

Bisimulation equivalence and regularity for real-time one-counter automata.
J. Comput. Syst. Sci., 2014

The First-Order Theory of Ground Tree Rewrite Graphs
Logical Methods in Computer Science, 2014

Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete.
CoRR, 2014

2013
Branching-Time Model Checking of One-Counter Processes and Timed Automata.
SIAM J. Comput., 2013

Equivalence of Deterministic One-Counter Automata is NL-complete
CoRR, 2013

Equivalence of deterministic one-counter automata is NL-complete.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Reachability in Register Machines with Polynomial Updates.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Bisimilarity of Pushdown Automata is Nonelementary.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

The Fixed-Parameter Tractability of Model Checking Concurrent Systems.
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012
Bisimilarity of Pushdown Systems is Nonelementary
CoRR, 2012

The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers
CoRR, 2012

Concurrency Makes Simple Theories Hard.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

The Complexity of Decomposing Modal and First-Order Theories.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Branching-Time Model Checking of Parametric One-Counter Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

A Comparison of Succinctly Represented Finite-State Systems.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers.
Proceedings of the Advances in Modal Logic 9, 2012

2011
Fixpoint Logics over Hierarchical Structures.
Theory Comput. Syst., 2011

Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

The Complexity of Verifying Ground Tree Rewrite Systems.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

The First-Order Theory of Ground Tree Rewrite Graphs.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010
Branching-time Model Checking of One-counter Processes.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Model Checking Succinct and Parametric One-Counter Automata.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Bisimilarity of One-Counter Processes Is PSPACE-Complete.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009
PDL with intersection and converse: satisfiability and infinite-state model checking.
J. Symb. Log., 2009

Branching-time model checking of one-counter processes
CoRR, 2009

Branching-time model checking of one-counter processes
CoRR, 2009

On the Computational Complexity of Verifying One-Counter Processes.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

2008
Computational complexity of propositional dynamic logics.
PhD thesis, 2008

A note on an extension of PDL.
J. Applied Logic, 2008

Reachability on prefix-recognizable graphs.
Inf. Process. Lett., 2008

2007
On a Non-Context-Free Extension of PDL
CoRR, 2007

PDL with Intersection and Converse Is 2 EXP-Complete.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

PDL with Intersection and Converse is 2EXP-complete.
Proceedings of the Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007, 2007

On the Complexity of Reasoning About Dynamic Policies.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006
Infinite State Model-Checking of Propositional Dynamic Logics.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005
Fixpoint Logics on Hierarchical Structures.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2003
Composition on Distributed RUBATO by Affine Transformations and Deformations of Musical Structures.
Proceedings of the 2003 International Computer Music Conference, 2003


  Loading...