Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="G{\"o}ller, Stefan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bisimulation equivalence and regularity for real-time one-counter automata
Stanislav Böhm
,
Stefan Göller
,
Petr Janc̑ar
Journal of Computer and System Sciences
80
(4), 2014, pp. 720-743
Reachability in register machines with polynomial updates
Alain Finkel
,
Stefan Göller
,
Christoph Haase
Lecture Notes in Computer Science
8087
, 2013, pp. 409-420
Branching-time model checking of one-counter processes and timed automata
Stefan Göller
,
Markus Lohrey
SIAM Journal on Computing
42
(3), 2013, pp. 884-923
On bisimilarity of higher-order pushdown automata: Undecidability at order two
Christopher Broadbent
,
Stefan Göller
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 160-172
Concurrency makes simple theories hard
Stefan Göller
,
Anthony Widjaja Lin
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 148-159
Language equivalence of deterministic real-time one-counter automata is NL-complete
Stanislav Böhm
,
Stefan Göller
Lecture Notes in Computer Science
6907
, 2011, pp. 194-205
The first-order theory of ground tree rewrite graphs
Stefan Göller
,
Markus Lohrey
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 276-287
Fixpoint logics over hierarchical structures
Stefan Göller
,
Markus Lohrey
Theory of Computing Systems
48
(1), 2011, pp. 93-131
Model checking succinct and parametric one-counter automata
Stefan Göller
,
Christoph Haase
,
Joël Ouaknine
,
James Worrell
Lecture Notes in Computer Science
6199
, 2010, pp. 575-586
Reachability on prefix-recognizable graphs
Stefan Göller
Information Processing Letters
108
(2), 2008, pp. 71-74
Fixpoint logics on hierarchical structures
Stefan Göller
,
Markus Lohrey
Lecture Notes in Computer Science
3821
, 2005, pp. 483-494