The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christof Löding: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  24. Obliging Games. [Citation Graph (, )][DBLP]


  25. The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem. [Citation Graph (, )][DBLP]


  26. On Nondeterministic Unranked Tree Automata with Sibling Constraints. [Citation Graph (, )][DBLP]


  27. The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata. [Citation Graph (, )][DBLP]


  28. Regular Cost Functions over Finite Trees. [Citation Graph (, )][DBLP]


  29. Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002