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