The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dietrich Kuske: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dietrich Kuske
    Nondeterministic Automata with Concurrency Relations and Domains. [Citation Graph (0, 0)][DBLP]
    CAAP, 1994, pp:202-217 [Conf]
  2. Paul Gastin, Dietrich Kuske
    Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:218-232 [Conf]
  3. Paul Gastin, Dietrich Kuske
    Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:533-547 [Conf]
  4. Dietrich Kuske
    Emptiness Is Decidable for Asynchronous Cellular Machines. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2000, pp:536-551 [Conf]
  5. Dietrich Kuske
    Asynchronous Cellular Automata and Asynchronous Automata for Pomsets. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1998, pp:517-532 [Conf]
  6. Dietrich Kuske, Rémi Morin
    Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2000, pp:426-441 [Conf]
  7. Manfred Droste, Dietrich Kuske
    Languages and Logical Definability in Concurrency Monoids. [Citation Graph (0, 0)][DBLP]
    CSL, 1995, pp:233-251 [Conf]
  8. Manfred Droste, Dietrich Kuske
    Trace Languages Definable with Modular Quantifiers. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:386-395 [Conf]
  9. Blaise Genest, Anca Muscholl, Dietrich Kuske
    A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:30-48 [Conf]
  10. Dietrich Kuske
    Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:206-216 [Conf]
  11. Dietrich Kuske, Peter Weigel
    The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:272-283 [Conf]
  12. Manfred Droste, Dietrich Kuske
    On Recognizable Languages in Divisibility Monoids. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:246-257 [Conf]
  13. Dietrich Kuske
    Divisibility Monoids: Presentation, Word Problem, and Rational Languages. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:227-239 [Conf]
  14. Dietrich Kuske, Markus Lohrey
    First-Order and Counting Theories of omega-Automatic Structures. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2006, pp:322-336 [Conf]
  15. Bernd Borchert, Dietrich Kuske, Frank Stephan
    On Existentially First-Order Definable Languages and Their Relation to NP. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:17-28 [Conf]
  16. Manfred Droste, Dietrich Kuske
    Skew and Infinitary Formal Power Series. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:426-438 [Conf]
  17. Dietrich Kuske
    Infinite Series-Parallel Posets: Logic and Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:648-662 [Conf]
  18. Dietrich Kuske, Markus Lohrey
    On the Theory of One-Step Rewriting in Trace Monoids. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:752-763 [Conf]
  19. Dietrich Kuske, Markus Lohrey
    Monadic Chain Logic Over Iterations and Applications to Pushdown Systems. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:91-100 [Conf]
  20. Steffen Hölldobler, Dietrich Kuske
    The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus. [Citation Graph (0, 0)][DBLP]
    LPAR, 2000, pp:436-450 [Conf]
  21. Dietrich Kuske
    Is Cantor's Theorem Automatic? [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:332-345 [Conf]
  22. Felipe Bracho, Manfred Droste, Dietrich Kuske
    Dependence Orders for Computations of Concurrent Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:467-478 [Conf]
  23. Dietrich Kuske
    A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:443-454 [Conf]
  24. Dietrich Kuske
    A Further Step towards a Theory of Regular MSC Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:489-500 [Conf]
  25. Dietrich Kuske
    Weighted Asynchronous Cellular Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:684-695 [Conf]
  26. Dietrich Kuske, Markus Lohrey
    Decidable Theories of Cayley-Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:463-474 [Conf]
  27. Blaise Genest, Dietrich Kuske, Anca Muscholl, Doron Peled
    Snapshot Verification. [Citation Graph (0, 0)][DBLP]
    TACAS, 2005, pp:510-525 [Conf]
  28. Dietrich Kuske, Ingmar Meinecke
    Branching Automata with Costs - A Way of Reflecting Parallelism in Costs. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:150-162 [Conf]
  29. Dietrich Kuske, Markus Lohrey
    Logical aspects of Cayley-graphs: the group case. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2005, v:131, n:1-3, pp:263-286 [Journal]
  30. Bernd Borchert, Dietrich Kuske, Frank Stephan
    On Existentially First-Order Definable Languages and their Relation to NP [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:13, pp:- [Journal]
  31. Manfred Droste, Dietrich Kuske
    Almost Every Domain is Universal. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:173, n:, pp:103-119 [Journal]
  32. Dietrich Kuske
    Regular sets of infinite message sequence charts. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:187, n:1, pp:80-109 [Journal]
  33. Blaise Genest, Dietrich Kuske, Anca Muscholl
    A Kleene theorem and model checking algorithms for existentially bounded communicating automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:6, pp:920-956 [Journal]
  34. Dietrich Kuske, Markus Lohrey
    Logical Aspects of Cayley-graphs: the Monoid Case. [Citation Graph (0, 0)][DBLP]
    IJAC, 2006, v:16, n:2, pp:307-340 [Journal]
  35. Manfred Droste, Dietrich Kuske
    Recognizable and Logically Definable Languages of Infinite Computations in Concurrent Automata. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1998, v:9, n:3, pp:295-314 [Journal]
  36. Bernd Borchert, Dietrich Kuske, Frank Stephan
    On existentially first-order definable languages and their relation to NP. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:3, pp:259-270 [Journal]
  37. Dietrich Kuske, Rémi Morin
    Pomsets for Local Trace Languages. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:2, pp:187-224 [Journal]
  38. Manfred Droste, Dietrich Kuske
    On random relational structures. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:102, n:2, pp:241-254 [Journal]
  39. Manfred Droste, Dietrich Kuske
    Recognizable languages in divisibility monoids. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2001, v:11, n:6, pp:743-770 [Journal]
  40. Dietrich Kuske, Markus Lohrey
    Decidable First-Order Theories of One-Step Rewriting in Trace Monoids. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:1, pp:39-81 [Journal]
  41. Felipe Bracho, Manfred Droste, Dietrich Kuske
    Representation of Computations in Concurrent Automata by Dependence Orders. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:174, n:1-2, pp:67-96 [Journal]
  42. Manfred Droste, Paul Gastin, Dietrich Kuske
    Asynchronous cellular automata for pomsets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:247, n:1-2, pp:1-38 [Journal]
  43. Manfred Droste, Dietrich Kuske
    Skew and infinitary formal power series. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:366, n:3, pp:199-227 [Journal]
  44. Ralph Kummetz, Dietrich Kuske
    The topology of Mazurkiewicz traces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:305, n:1-3, pp:237-258 [Journal]
  45. Dietrich Kuske
    Towards a language theory for infinite N-free pomsets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:347-386 [Journal]
  46. Dietrich Kuske, Ingmar Meinecke
    Branching automata with costs - a way of reflecting parallelism in costs star. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:328, n:1-2, pp:53-75 [Journal]
  47. Dietrich Kuske
    Weighted asynchronous cellular automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:374, n:1-3, pp:127-148 [Journal]

  48. Automatic Structures of Bounded Degree Revisited. [Citation Graph (, )][DBLP]


  49. The Isomorphism Problem for omega-Automatic Trees. [Citation Graph (, )][DBLP]


  50. 07441 Summary -- Algorithmic-Logical Theory of Infinite Structures. [Citation Graph (, )][DBLP]


  51. 07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures. [Citation Graph (, )][DBLP]


  52. Compatibility of Shelah and Stupp's and of Muchnik's iteration with fragments of monadic second order logic. [Citation Graph (, )][DBLP]


  53. Construction of Tree Automata from Regular Expressions. [Citation Graph (, )][DBLP]


  54. Propositional Dynamic Logic for Message-Passing Systems. [Citation Graph (, )][DBLP]


  55. Hamiltonicity of automatic graphs. [Citation Graph (, )][DBLP]


  56. The Isomorphism Problem on Classes of Automatic Structures. [Citation Graph (, )][DBLP]


  57. Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic. [Citation Graph (, )][DBLP]


  58. Is Ramsey's Theorem omega-automatic?. [Citation Graph (, )][DBLP]


  59. Theories of Automatic Structures and Their Complexity. [Citation Graph (, )][DBLP]


  60. Weighted and Unweighted Trace Automata. [Citation Graph (, )][DBLP]


  61. Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic [Citation Graph (, )][DBLP]


  62. Automatic structures of bounded degree revisited [Citation Graph (, )][DBLP]


  63. Is Ramsey's theorem omega-automatic? [Citation Graph (, )][DBLP]


  64. The Isomorphism Problem On Classes of Automatic Structures [Citation Graph (, )][DBLP]


  65. The Isomorphism Problem for omega-Automatic Trees [Citation Graph (, )][DBLP]


  66. Propositional Dynamic Logic for Message-Passing Systems [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.008secs
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