Christof Löding

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
i2		Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider: Learning Universally Quantified Invariants of Linear Data Structures. CoRR abs/1302.2273 (2013)
	2012
j7		Dimitri Isaak, Christof Löding: Efficient inclusion testing for simple classes of unambiguous ω-automata. Inf. Process. Lett. 112(14-15): 578-582 (2012)
c27		Stefan Breuers, Christof Löding, Jörg Olschewski: Improved Ramsey-Based Büchi Complementation. FoSSaCS 2012: 150-164
c26		Christof Löding, Stefan Repke: Regularity Problems for Weak Pushdown ω-Automata and Games. MFCS 2012: 764-776
	2011
c25		Wladimir Fridman, Christof Löding, Martin Zimmermann: Degrees of Lookahead in Context-free Infinite Games. CSL 2011: 264-276
	2010
c24		Krishnendu Chatterjee, Florian Horn, Christof Löding: Obliging Games. CONCUR 2010: 284-296
c23		Nicolas Bousquet, Christof Löding: Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata. LATA 2010: 118-129
c22		Thomas Colcombet, Christof Löding: Regular Cost Functions over Finite Trees. LICS 2010: 70-79
	2009
c21		Christof Löding, Karianto Wong: On Nondeterministic Unranked Tree Automata with Sibling Constraints. FSTTCS 2009: 311-322
	2008
c20		Achim Blumensath, Thomas Colcombet, Christof Löding: Logical theories and compatible operations. Logic and Automata 2008: 73-106
c19		Thomas Colcombet, Christof Löding: The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem. CSL 2008: 416-430
c18		Thomas Colcombet, Christof Löding: The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata. ICALP (2) 2008: 398-409
	2007
j6		Christof Löding, Carsten Lutz, Olivier Serre: Propositional dynamic logic with recursive programs. J. Log. Algebr. Program. 73(1-2): 51-69 (2007)
j5		Thomas Colcombet, Christof Löding: Transforming structures by set interpretations. Logical Methods in Computer Science 3(2) (2007)
c17		Arnaud Carayol, Christof Löding: MSO on the Infinite Binary Tree: Choice and Order. CSL 2007: 161-176
c16		Karianto Wong, Christof Löding: Unranked Tree Automata with Sibling Equalities and Disequalities. ICALP 2007: 875-887
c15		Christof Löding, Alex Spelten: Transition Graphs of Rewriting Systems over Unranked Trees. MFCS 2007: 67-77
c14		Michael Holtmann, Christof Löding: Memory Reduction for Strategies in Infinite Games. CIAA 2007: 253-264
i1		Thomas Colcombet, Christof Löding: Transforming structures by set interpretations. CoRR abs/cs/0703039 (2007)
	2006
j4		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)
j3		Christof Löding: Reachability Problems on Regular Ground Tree Rewriting Graphs. Theory Comput. Syst. 39(2): 347-383 (2006)
c13		Christof Löding, Olivier Serre: Propositional Dynamic Logic with Recursive Programs. FoSSaCS 2006: 292-306
c12		Vince Bárány, Christof Löding, Olivier Serre: Regularity Problems for Visibly Pushdown Languages. STACS 2006: 420-431
	2005
c11		Wolfgang Thomas, Julien Cristau, Christof Löding: Deterministic Automata on Unranked Trees. Foundations of Semistructured Data 2005
c10		Julien Cristau, Christof Löding, Wolfgang Thomas: Deterministic Automata on Unranked Trees. FCT 2005: 68-79
	2004
j2		Yves Bontemps, Pierre-Yves Schobbens, Christof Löding: Synthesis of Open Reactive Systems from Scenario-Based Specifications. Fundam. Inform. 62(2): 139-169 (2004)
c9		Christof Löding, P. Madhusudan, Olivier Serre: Visibly Pushdown Games. FSTTCS 2004: 408-420
c8		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
c7		Thomas Colcombet, Christof Löding: On the Expressiveness of Deterministic Transducers over Infinite Trees. STACS 2004: 428-439
	2003
c6		Christof Löding, Philipp Rohde: Model Checking and Satisfiability for Sabotage Modal Logic. FSTTCS 2003: 302-313
c5		Christof Löding, Philipp Rohde: Solving the Sabotage Game Is PSPACE-Hard. MFCS 2003: 531-540
	2002
c4		Christof Löding: Model-Checking Infinite Systems Generated by Ground Tree Rewriting. FoSSaCS 2002: 280-294
c3		Christof Löding: Ground Tree Rewriting Graphs of Bounded Tree Width. STACS 2002: 559-570
	2001
j1		Christof Löding: Efficient minimization of deterministic weak omega-automata. Inf. Process. Lett. 79(3): 105-109 (2001)
	2000
c2		Christof Löding, Wolfgang Thomas: Alternating Automata and Logics over Infinite Words. IFIP TCS 2000: 521-535
	1999
c1		Christof Löding: Optimal Bounds for Transformations of omega-Automata. FSTTCS 1999: 97-109

Coauthor Index

1	Michael Benedikt	[j4] [c8]
2	Achim Blumensath	[c20]
3	Yves Bontemps	[j2]
4	Nicolas Bousquet	[c23]
5	Stefan Breuers	[c27]
6	Jan Van den Bussche	[j4] [c8]
7	Vince Bárány	[c12]
8	Arnaud Carayol	[c17]
9	Krishnendu Chatterjee	[c24]
10	Thomas Colcombet	[c22] [c20] [c19] [c18] [j5] [i1] [c7]
11	Julien Cristau	[c11] [c10]
12	Wladimir Fridman	[c25]
13	Pranav Garg 0001	[i2]
14	Michael Holtmann	[c14]
15	Florian Horn	[c24]
16	Dimitri Isaak	[j7]
17	Bart Kuijpers	[j4]
18	Carsten Lutz	[j6]
19	P. Madhusudan (Parthasarathy Madhusudan)	[i2] [c9]
20	Daniel Neider	[i2]
21	Jörg Olschewski	[c27]
22	Stefan Repke	[c26]
23	Philipp Rohde	[c6] [c5]
24	Pierre-Yves Schobbens	[j2]
25	Olivier Serre	[j6] [c13] [c12] [c9]
26	Alex Spelten	[c15]
27	Wolfgang Thomas	[c11] [c10] [c2]
28	Thomas Wilke	[j4] [c8]
29	Karianto Wong	[c21] [c16]
30	Martin Zimmermann 0002	[c25]

Colors in the list of coauthors

Last update Tue May 21 05:41:45 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page