Christof Löding

	2009
27		Christof Löding, Karianto Wong: On Nondeterministic Unranked Tree Automata with Sibling Constraints. FSTTCS 2009: 311-322
	2008
26		Thomas Colcombet, Christof Löding: The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem. CSL 2008: 416-430
25		Thomas Colcombet, Christof Löding: The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata. ICALP (2) 2008: 398-409
	2007
24		Michael Holtmann, Christof Löding: Memory Reduction for Strategies in Infinite Games. CIAA 2007: 253-264
23		Arnaud Carayol, Christof Löding: MSO on the Infinite Binary Tree: Choice and Order. CSL 2007: 161-176
22		Karianto Wong, Christof Löding: Unranked Tree Automata with Sibling Equalities and Disequalities. ICALP 2007: 875-887
21		Christof Löding, Alex Spelten: Transition Graphs of Rewriting Systems over Unranked Trees. MFCS 2007: 67-77
20		Thomas Colcombet, Christof Löding: Transforming structures by set interpretations CoRR abs/cs/0703039: (2007)
19		Christof Löding, Carsten Lutz, Olivier Serre: Propositional dynamic logic with recursive programs. J. Log. Algebr. Program. 73(1-2): 51-69 (2007)
18		Thomas Colcombet, Christof Löding: Transforming structures by set interpretations. Logical Methods in Computer Science 3(2): (2007)
	2006
17		Christof Löding, Olivier Serre: Propositional Dynamic Logic with Recursive Programs. FoSSaCS 2006: 292-306
16		Vince Bárány, Christof Löding, Olivier Serre: Regularity Problems for Visibly Pushdown Languages. STACS 2006: 420-431
15		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		Christof Löding: Reachability Problems on Regular Ground Tree Rewriting Graphs. Theory Comput. Syst. 39(2): 347-383 (2006)
	2005
13		Julien Cristau, Christof Löding, Wolfgang Thomas: Deterministic Automata on Unranked Trees. FCT 2005: 68-79
12		Wolfgang Thomas, Julien Cristau, Christof Löding: Deterministic Automata on Unranked Trees. Foundations of Semistructured Data 2005
	2004
11		Christof Löding, P. Madhusudan, Olivier Serre: Visibly Pushdown Games. FSTTCS 2004: 408-420
10		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		Thomas Colcombet, Christof Löding: On the Expressiveness of Deterministic Transducers over Infinite Trees. STACS 2004: 428-439
8		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		Christof Löding, Philipp Rohde: Model Checking and Satisfiability for Sabotage Modal Logic. FSTTCS 2003: 302-313
6		Christof Löding, Philipp Rohde: Solving the Sabotage Game Is PSPACE-Hard. MFCS 2003: 531-540
	2002
5		Christof Löding: Model-Checking Infinite Systems Generated by Ground Tree Rewriting. FoSSaCS 2002: 280-294
4		Christof Löding: Ground Tree Rewriting Graphs of Bounded Tree Width. STACS 2002: 559-570
	2001
3		Christof Löding: Efficient minimization of deterministic weak omega-automata. Inf. Process. Lett. 79(3): 105-109 (2001)
	2000
2		Christof Löding, Wolfgang Thomas: Alternating Automata and Logics over Infinite Words. IFIP TCS 2000: 521-535
	1999
1		Christof Löding: Optimal Bounds for Transformations of omega-Automata. FSTTCS 1999: 97-109

Coauthor Index

1	Vince Bárány	[16]
2	Michael Benedikt	[10] [15]
3	Yves Bontemps	[8]
4	Jan Van den Bussche	[10] [15]
5	Arnaud Carayol	[23]
6	Thomas Colcombet	[9] [18] [20] [25] [26]
7	Julien Cristau	[12] [13]
8	Michael Holtmann	[24]
9	Bart Kuijpers	[15]
10	Carsten Lutz	[19]
11	P. Madhusudan (Parthasarathy Madhusudan)	[11]
12	Philipp Rohde	[6] [7]
13	Pierre-Yves Schobbens	[8]
14	Olivier Serre	[11] [16] [17] [19]
15	Alex Spelten	[21]
16	Wolfgang Thomas	[2] [12] [13]
17	Thomas Wilke	[10] [15]
18	Karianto Wong	[22] [27]

Colors in the list of coauthors