Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Dietrich Kuske
2010 – today
- 2013
[j34]Dietrich Kuske, Jiamou Liu, Markus Lohrey: The isomorphism problem for ω-automatic trees. Ann. Pure Appl. Logic 164(1): 30-48 (2013)- [j33]Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas: On the automaticity of singular Artin monoids of finite type. Int. J. Comput. Math. 90(6): 1197-1222 (2013)
- [c49]Lucas Heimberg, Dietrich Kuske, Nicole Schweikardt: An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree. LICS 2013: 63-72
- [c48]Benedikt Bollig, Dietrich Kuske, Roy Mennicke: The Complexity of Model Checking Multi-stack Systems. LICS 2013: 163-172
- [c47]Dietrich Kuske: Logical Aspects of the Lexicographic Order on 1-Counter Languages. MFCS 2013: 619-630
- 2012
- [j32]Benedikt Bollig, Dietrich Kuske: An optimal construction of Hanf sentences. J. Applied Logic 10(2): 179-186 (2012)
- [c46]
- [i8]
- 2011
- [j31]Dietrich Kuske, Ingmar Meinecke: Construction of tree automata from regular expressions. RAIRO - Theor. Inf. and Applic. 45(3): 347-370 (2011)
- [j30]Dietrich Kuske, Markus Lohrey: Automatic structures of bounded degree revisited. J. Symb. Log. 76(4): 1352-1380 (2011)
- [c45]Dietrich Kuske: Where Automatic Structures Benefit from Weighted Automata. Algebraic Foundations in Computer Science 2011: 257-271
- [c44]Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas: Singular Artin Monoids of Finite Coxeter Type Are Automatic. LATA 2011: 250-261
- [c43]Dietrich Kuske, Thomas Weidner: Size and Computation of Injective Tree Automatic Presentations. MFCS 2011: 424-435
- [i7]Benedikt Bollig, Dietrich Kuske: An optimal construction of Hanf sentences. CoRR abs/1105.5487 (2011)
- 2010
- [j29]Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke: Propositional Dynamic Logic for Message-Passing Systems. Logical Methods in Computer Science 6(3) (2010)
- [j28]Paul Gastin, Dietrich Kuske: Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces. Inf. Comput. 208(7): 797-816 (2010)
- [j27]Dietrich Kuske, Markus Lohrey: Some natural decision problems in automatic graphs. J. Symb. Log. 75(2): 678-710 (2010)
- [c42]Dietrich Kuske, Jiamou Liu, Markus Lohrey: The Isomorphism Problem for omega-Automatic Trees. CSL 2010: 396-410
- [c41]Dietrich Kuske, Jiamou Liu, Markus Lohrey: The Isomorphism Problem on Classes of Automatic Structures. LICS 2010: 160-169
- [c40]
- [i6]Dietrich Kuske, Jiamou Liu, Markus Lohrey: The Isomorphism Problem On Classes of Automatic Structures. CoRR abs/1001.2086 (2010)
- [i5]Dietrich Kuske, Jiamou Liu, Markus Lohrey: The Isomorphism Problem for omega-Automatic Trees. CoRR abs/1004.0610 (2010)
2000 – 2009
- 2009
- [j26]
- [c39]
- [c38]
- [i4]
- 2008
- [j25]Benedikt Bollig, Dietrich Kuske: Muller message-passing automata and logics. Inf. Comput. 206(9-10): 1084-1094 (2008)
- [j24]Dietrich Kuske, Markus Lohrey: First-order and counting theories of omega-automatic structures. J. Symb. Log. 73(1): 129-150 (2008)
- [j23]Dietrich Kuske: Schützenberger's theorem on formal power series follows from Kleene's theorem. Theor. Comput. Sci. 401(1-3): 243-248 (2008)
- [c37]Dietrich Kuske, Markus Lohrey: Euler paths and ends in automatic and recursive graphs. AFL 2008: 245-256
- [c36]Dietrich Kuske, Ingmar Meinecke: Construction of Tree Automata from Regular Expressions. Developments in Language Theory 2008: 491-503
- [c35]
- [c34]Dietrich Kuske: Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic. STACS 2008: 467-478
- [e1]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi (Eds.): Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007. Dagstuhl Seminar Proceedings 07441, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008
- [i3]Dietrich Kuske: Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic. CoRR abs/0802.2862 (2008)
- [i2]Dietrich Kuske, Markus Lohrey: Automatic structures of bounded degree revisited. CoRR abs/0810.4998 (2008)
- 2007
- [j22]Manfred Droste, Dietrich Kuske: Almost Every Domain is Universal. Electr. Notes Theor. Comput. Sci. 173: 103-119 (2007)
- [j21]Blaise Genest, Dietrich Kuske, Anca Muscholl: On Communicating Automata with Bounded Channels. Fundam. Inform. 80(1-3): 147-167 (2007)
- [j20]Paul Gastin, Dietrich Kuske: Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces. Fundam. Inform. 80(1-3): 169-197 (2007)
- [j19]Dietrich Kuske: Weighted asynchronous cellular automata. Theor. Comput. Sci. 374(1-3): 127-148 (2007)
- [c33]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
- [c32]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
- [c31]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
- [c30]Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke: Propositional Dynamic Logic for Message-Passing Systems. FSTTCS 2007: 303-315
- [c29]
- 2006
- [j18]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)
- [j17]Dietrich Kuske, Markus Lohrey: Logical Aspects of Cayley-graphs: the Monoid Case. IJAC 16(2): 307-340 (2006)
- [j16]
- [j15]Manfred Droste, Dietrich Kuske: Skew and infinitary formal power series. Theor. Comput. Sci. 366(3): 199-227 (2006)
- [c28]Dietrich Kuske, Markus Lohrey: First-Order and Counting Theories of omega-Automatic Structures. FoSSaCS 2006: 322-336
- [c27]Dietrich Kuske, Markus Lohrey: Monadic Chain Logic Over Iterations and Applications to Pushdown Systems. LICS 2006: 91-100
- [c26]
- 2005
- [j14]Dietrich Kuske, Markus Lohrey: Logical aspects of Cayley-graphs: the group case. Ann. Pure Appl. Logic 131(1-3): 263-286 (2005)
- [j13]Dietrich Kuske, Markus Lohrey: Decidable First-Order Theories of One-Step Rewriting in Trace Monoids. Theory Comput. Syst. 38(1): 39-81 (2005)
- [c25]Paul Gastin, Dietrich Kuske: Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces. CONCUR 2005: 533-547
- [c24]Blaise Genest, Dietrich Kuske, Anca Muscholl, Doron Peled: Snapshot Verification. TACAS 2005: 510-525
- 2004
- [j12]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)
- [c23]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
- [c22]Dietrich Kuske, Peter Weigel: The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems. Developments in Language Theory 2004: 272-283
- 2003
- [j11]Dietrich Kuske: Regular sets of infinite message sequence charts. Inf. Comput. 187(1): 80-109 (2003)
- [j10]Manfred Droste, Dietrich Kuske: On random relational structures. J. Comb. Theory, Ser. A 102(2): 241-254 (2003)
- [j9]Dietrich Kuske: Towards a language theory for infinite N-free pomsets. Theor. Comput. Sci. 1-3(299): 347-386 (2003)
- [j8]Ralph Kummetz, Dietrich Kuske: The topology of Mazurkiewicz traces. Theor. Comput. Sci. 305(1-3): 237-258 (2003)
- [c21]Paul Gastin, Dietrich Kuske: Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE. CONCUR 2003: 218-232
- [c20]
- [c19]
- [c18]
- [c17]Dietrich Kuske, Ingmar Meinecke: Branching Automata with Costs - A Way of Reflecting Parallelism in Costs. CIAA 2003: 150-162
- 2002
- [j7]Dietrich Kuske, Rémi Morin: Pomsets for Local Trace Languages. Journal of Automata, Languages and Combinatorics 7(2): 187-224 (2002)
- [c16]Dietrich Kuske, Markus Lohrey: On the Theory of One-Step Rewriting in Trace Monoids. ICALP 2002: 752-763
- [c15]
- 2001
- [j6]Manfred Droste, Dietrich Kuske: Recognizable languages in divisibility monoids. Mathematical Structures in Computer Science 11(6): 743-770 (2001)
- [c14]Dietrich Kuske: Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable. Developments in Language Theory 2001: 206-216
- [c13]Dietrich Kuske: Divisibility Monoids: Presentation, Word Problem, and Rational Languages. FCT 2001: 227-239
- [c12]Dietrich Kuske: A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets. STACS 2001: 443-454
- 2000
- [j5]Manfred Droste, Paul Gastin, Dietrich Kuske: Asynchronous cellular automata for pomsets. Theor. Comput. Sci. 247(1-2): 1-38 (2000)
- [c11]Dietrich Kuske, Rémi Morin: Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets. CONCUR 2000: 426-441
- [c10]
- [c9]
- [c8]Steffen Hölldobler, Dietrich Kuske: The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus. LPAR 2000: 436-450
1990 – 1999
- 1999
- [j4]Bernd Borchert, Dietrich Kuske, Frank Stephan: On existentially first-order definable languages and their relation to NP. ITA 33(3): 259-270 (1999)
- [c7]Manfred Droste, Dietrich Kuske: On Recognizable Languages in Divisibility Monoids. FCT 1999: 246-257
- 1998
- [j3]Dietrich Kuske, R. M. Shortt: Topology for Computations of Concurrent Automata. IJAC 8(3): 327-362 (1998)
- [j2]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)
- [c6]Dietrich Kuske: Asynchronous Cellular Automata and Asynchronous Automata for Pomsets. CONCUR 1998: 517-532
- [c5]Bernd Borchert, Dietrich Kuske, Frank Stephan: On Existentially First-Order Definable Languages and Their Relation to NP. ICALP 1998: 17-28
- 1997
- [j1]Felipe Bracho, Manfred Droste, Dietrich Kuske: Representation of Computations in Concurrent Automata by Dependence Orders. Theor. Comput. Sci. 174(1-2): 67-96 (1997)
- [i1]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)
- 1995
- [c4]Manfred Droste, Dietrich Kuske: Languages and Logical Definability in Concurrency Monoids. CSL 1995: 233-251
- [c3]Manfred Droste, Dietrich Kuske: Trace Languages Definable with Modular Quantifiers. Developments in Language Theory 1995: 386-395
- [c2]Felipe Bracho, Manfred Droste, Dietrich Kuske: Dependence Orders for Computations of Concurrent Automata. STACS 1995: 467-478
- 1994
- [b1]Dietrich Kuske: Modelle nebenläufiger Prozesse - Monoide, Residuensysteme und Automaten. Universität Essen 1994, pp. 1-170
- [c1]Dietrich Kuske: Nondeterministic Automata with Concurrency Relations and Domains. CAAP 1994: 202-217
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:13 CEST by the dblp team