| 2008 |
|---|
| 26 | EE | Thomas Colcombet,
Christof Löding:
The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem.
CSL 2008: 416-430 |
| 25 | EE | Thomas Colcombet,
Christof Löding:
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata.
ICALP (2) 2008: 398-409 |
| 2007 |
|---|
| 24 | EE | Michael Holtmann,
Christof Löding:
Memory Reduction for Strategies in Infinite Games.
CIAA 2007: 253-264 |
| 23 | EE | Arnaud Carayol,
Christof Löding:
MSO on the Infinite Binary Tree: Choice and Order.
CSL 2007: 161-176 |
| 22 | EE | Wong Karianto,
Christof Löding:
Unranked Tree Automata with Sibling Equalities and Disequalities.
ICALP 2007: 875-887 |
| 21 | EE | Christof Löding,
Alex Spelten:
Transition Graphs of Rewriting Systems over Unranked Trees.
MFCS 2007: 67-77 |
| 20 | EE | Thomas Colcombet,
Christof Löding:
Transforming structures by set interpretations
CoRR abs/cs/0703039: (2007) |
| 19 | EE | Christof Löding,
Carsten Lutz,
Olivier Serre:
Propositional dynamic logic with recursive programs.
J. Log. Algebr. Program. 73(1-2): 51-69 (2007) |
| 18 | EE | Thomas Colcombet,
Christof Löding:
Transforming structures by set interpretations.
Logical Methods in Computer Science 3(2): (2007) |
| 2006 |
|---|
| 17 | EE | Christof Löding,
Olivier Serre:
Propositional Dynamic Logic with Recursive Programs.
FoSSaCS 2006: 292-306 |
| 16 | EE | Vince Bárány,
Christof Löding,
Olivier Serre:
Regularity Problems for Visibly Pushdown Languages.
STACS 2006: 420-431 |
| 15 | EE | Michael Benedikt,
Bart Kuijpers,
Christof Löding,
Jan Van den Bussche,
Thomas Wilke:
A characterization of first-order topological properties of planar spatial data.
J. ACM 53(2): 273-305 (2006) |
| 14 | EE | Christof Löding:
Reachability Problems on Regular Ground Tree Rewriting Graphs.
Theory Comput. Syst. 39(2): 347-383 (2006) |
| 2005 |
|---|
| 13 | EE | Julien Cristau,
Christof Löding,
Wolfgang Thomas:
Deterministic Automata on Unranked Trees.
FCT 2005: 68-79 |
| 12 | EE | Wolfgang Thomas,
Julien Cristau,
Christof Löding:
Deterministic Automata on Unranked Trees.
Foundations of Semistructured Data 2005 |
| 2004 |
|---|
| 11 | EE | Christof Löding,
P. Madhusudan,
Olivier Serre:
Visibly Pushdown Games.
FSTTCS 2004: 408-420 |
| 10 | EE | Michael Benedikt,
Christof Löding,
Jan Van den Bussche,
Thomas Wilke:
A Characterization of First-Order Topological Properties of Planar Spatial Data.
PODS 2004: 107-114 |
| 9 | EE | Thomas Colcombet,
Christof Löding:
On the Expressiveness of Deterministic Transducers over Infinite Trees.
STACS 2004: 428-439 |
| 8 | EE | Yves Bontemps,
Pierre-Yves Schobbens,
Christof Löding:
Synthesis of Open Reactive Systems from Scenario-Based Specifications.
Fundam. Inform. 62(2): 139-169 (2004) |
| 2003 |
|---|
| 7 | EE | Christof Löding,
Philipp Rohde:
Model Checking and Satisfiability for Sabotage Modal Logic.
FSTTCS 2003: 302-313 |
| 6 | EE | Christof Löding,
Philipp Rohde:
Solving the Sabotage Game Is PSPACE-Hard.
MFCS 2003: 531-540 |
| 2002 |
|---|
| 5 | EE | Christof Löding:
Model-Checking Infinite Systems Generated by Ground Tree Rewriting.
FoSSaCS 2002: 280-294 |
| 4 | EE | Christof Löding:
Ground Tree Rewriting Graphs of Bounded Tree Width.
STACS 2002: 559-570 |
| 2001 |
|---|
| 3 | EE | Christof Löding:
Efficient minimization of deterministic weak omega-automata.
Inf. Process. Lett. 79(3): 105-109 (2001) |
| 2000 |
|---|
| 2 | EE | Christof Löding,
Wolfgang Thomas:
Alternating Automata and Logics over Infinite Words.
IFIP TCS 2000: 521-535 |
| 1999 |
|---|
| 1 | EE | Christof Löding:
Optimal Bounds for Transformations of omega-Automata.
FSTTCS 1999: 97-109 |
