default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Göller
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Stefan Göller
, Mathieu Hilaire:
Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete. Theory Comput. Syst. 68(4): 900-985 (2024)- [c33]Stefan Göller, Nathan Grosshans:
The AC⁰-Complexity of Visibly Pushdown Languages. STACS 2024: 38:1-38:18 - 2023
- [c32]Stefan Göller, Pawel Parys:
Weak Bisimulation Finiteness of Pushdown Systems With Deterministic ε-Transitions Is 2-EXPTIME-Complete. SODA 2023: 2777-2815 - [i14]Stefan Göller, Nathan Grosshans:
The AC0-Complexity Of Visibly Pushdown Languages. CoRR abs/2302.13116 (2023) - 2021
- [j12]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): 34:1-34:43 (2021) - [c31]Stefan Göller, Mathieu Hilaire:
Reachability in Two-Parametric Timed Automata with One Parameter Is EXPSPACE-Complete. STACS 2021: 36:1-36:18 - 2020
- [c30]Stefan Göller, Pawel Parys:
Bisimulation Finiteness of Pushdown Systems Is Elementary. LICS 2020: 521-534 - [i13]Stefan Göller, Pawel Parys:
Bisimulation Finiteness of Pushdown Systems Is Elementary. CoRR abs/2005.06285 (2020) - [i12]Stefan Göller, Mathieu Hilaire:
Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete. CoRR abs/2011.07091 (2020)
2010 – 2019
- 2019
- [j11]Arnaud Carayol, Stefan Göller:
On Long Words Avoiding Zimin Patterns. Theory Comput. Syst. 63(5): 926-955 (2019) - [i11]Arnaud Carayol, Stefan Göller:
On long words avoiding Zimin patterns. CoRR abs/1902.05540 (2019) - 2018
- [j10]Moses Ganardi, Stefan Göller, Markus Lohrey:
The Complexity of Bisimulation and Simulation on Finite Systems. Log. Methods Comput. Sci. 14(4) (2018) - [i10]Moses Ganardi, Stefan Göller, Markus Lohrey:
The Complexity of Bisimulation and Simulation on Finite Systems. CoRR abs/1806.00256 (2018) - 2017
- [c29]Stanislav Böhm, Stefan Göller, Simon Halfon, Piotr Hofman:
On Büchi One-Counter Automata. STACS 2017: 14:1-14:13 - [c28]Arnaud Carayol, Stefan Göller:
On Long Words Avoiding Zimin Patterns. STACS 2017: 19:1-19:13 - 2016
- [c27]Moses Ganardi, Stefan Göller, Markus Lohrey:
On the Parallel Complexity of Bisimulation on Finite Systems. CSL 2016: 12:1-12:17 - [c26]Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke:
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. ICALP 2016: 105:1-105:13 - [c25]Thomas Colcombet, Stefan Göller:
Games with bound guess actions. LICS 2016: 257-266 - [i9]Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke:
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. CoRR abs/1602.05547 (2016) - 2015
- [j9]Stefan Göller, Jean Christoph Jung, Markus Lohrey:
The Complexity of Decomposing Modal and First-Order Theories. ACM Trans. Comput. Log. 16(1): 9:1-9:43 (2015) - [c24]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: 32-43 - 2014
- [j8]Stefan Göller, Markus Lohrey:
The First-Order Theory of Ground Tree Rewrite Graphs. Log. Methods Comput. Sci. 10(1) (2014) - [j7]Stanislav Böhm, Stefan Göller, Petr Jancar:
Bisimulation equivalence and regularity for real-time one-counter automata. J. Comput. Syst. Sci. 80(4): 720-743 (2014) - [j6]Stefan Göller, Anthony Widjaja Lin:
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems. ACM Trans. Comput. Log. 15(4): 26:1-26:28 (2014) - [i8]Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie:
Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete. CoRR abs/1412.4259 (2014) - 2013
- [j5]Stefan Göller, Markus Lohrey:
Branching-Time Model Checking of One-Counter Processes and Timed Automata. SIAM J. Comput. 42(3): 884-923 (2013) - [c23]Stefan Göller:
The Fixed-Parameter Tractability of Model Checking Concurrent Systems. CSL 2013: 332-347 - [c22]Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski:
Bisimilarity of Pushdown Automata is Nonelementary. LICS 2013: 488-498 - [c21]Alain Finkel, Stefan Göller, Christoph Haase:
Reachability in Register Machines with Polynomial Updates. MFCS 2013: 409-420 - [c20]Stanislav Böhm, Stefan Göller, Petr Jancar:
Equivalence of deterministic one-counter automata is NL-complete. STOC 2013: 131-140 - [i7]Stanislav Böhm, Stefan Göller, Petr Jancar:
Equivalence of Deterministic One-Counter Automata is NL-complete. CoRR abs/1301.2181 (2013) - 2012
- [c19]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: 261-278 - [c18]Romain Brenguier, Stefan Göller, Ocan Sankur:
A Comparison of Succinctly Represented Finite-State Systems. CONCUR 2012: 147-161 - [c17]Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell:
Branching-Time Model Checking of Parametric One-Counter Automata. FoSSaCS 2012: 406-420 - [c16]Christopher H. Broadbent, Stefan Göller:
On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two. FSTTCS 2012: 160-172 - [c15]Stefan Göller, Jean Christoph Jung, Markus Lohrey:
The Complexity of Decomposing Modal and First-Order Theories. LICS 2012: 325-334 - [c14]Stefan Göller, Anthony Widjaja Lin:
Concurrency Makes Simple Theories Hard. STACS 2012: 148-159 - [i6]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 abs/1204.1196 (2012) - [i5]Michael Benedikt, Stefan Göller, Stefan Kiefer, Andrzej S. Murawski:
Bisimilarity of Pushdown Systems is Nonelementary. CoRR abs/1210.7686 (2012) - 2011
- [j4]Stefan Göller, Markus Lohrey:
Fixpoint Logics over Hierarchical Structures. Theory Comput. Syst. 48(1): 93-131 (2011) - [c13]Stefan Göller, Anthony Widjaja Lin:
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems. CONCUR 2011: 543-558 - [c12]Stefan Göller, Markus Lohrey:
The First-Order Theory of Ground Tree Rewrite Graphs. FSTTCS 2011: 276-287 - [c11]Stefan Göller, Anthony Widjaja Lin:
The Complexity of Verifying Ground Tree Rewrite Systems. LICS 2011: 279-288 - [c10]Stanislav Böhm, Stefan Göller:
Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete. MFCS 2011: 194-205 - 2010
- [c9]Stanislav Böhm, Stefan Göller, Petr Jancar:
Bisimilarity of One-Counter Processes Is PSPACE-Complete. CONCUR 2010: 177-191 - [c8]Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell:
Model Checking Succinct and Parametric One-Counter Automata. ICALP (2) 2010: 575-586 - [c7]Stefan Göller, Markus Lohrey:
Branching-time Model Checking of One-counter Processes. STACS 2010: 405-416
2000 – 2009
- 2009
- [j3]Stefan Göller, Markus Lohrey, Carsten Lutz:
PDL with intersection and converse: satisfiability and infinite-state model checking. J. Symb. Log. 74(1): 279-314 (2009) - [c6]Stefan Göller, Richard Mayr, Anthony Widjaja To:
On the Computational Complexity of Verifying One-Counter Processes. LICS 2009: 235-244 - [i4]Stefan Göller, Markus Lohrey:
Branching-time model checking of one-counter processes. CoRR abs/0909.1102 (2009) - [i3]Stefan Göller, Markus Lohrey:
Branching-time model checking of one-counter processes. CoRR abs/0912.4117 (2009) - 2008
- [b1]Stefan Göller:
Computational complexity of propositional dynamic logics. University of Leipzig, 2008, pp. 1-147 - [j2]Stefan Göller:
Reachability on prefix-recognizable graphs. Inf. Process. Lett. 108(2): 71-74 (2008) - [j1]Stefan Göller, Dirk Nowotka:
A note on an extension of PDL. J. Appl. Log. 6(4): 606-608 (2008) - 2007
- [c5]Stefan Göller:
On the Complexity of Reasoning About Dynamic Policies. CSL 2007: 358-373 - [c4]Stefan Göller, Markus Lohrey, Carsten Lutz:
PDL with Intersection and Converse Is 2 EXP-Complete. FoSSaCS 2007: 198-212 - [i2]Stefan Göller, Markus Lohrey, Carsten Lutz:
PDL with Intersection and Converse is 2EXP-complete. Algorithmic-Logical Theory of Infinite Structures 2007 - [i1]Stefan Göller, Dirk Nowotka:
On a Non-Context-Free Extension of PDL. CoRR abs/0707.0562 (2007) - 2006
- [c3]Stefan Göller, Markus Lohrey:
Infinite State Model-Checking of Propositional Dynamic Logics. CSL 2006: 349-364 - 2005
- [c2]Stefan Göller, Markus Lohrey:
Fixpoint Logics on Hierarchical Structures. FSTTCS 2005: 483-494 - 2003
- [c1]Stefan Göller, Gérard Milmeister:
Composition on Distributed RUBATO by Affine Transformations and Deformations of Musical Structures. ICMC 2003
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
