Dietrich Kuske

Publication Activity (10 Years)

Years Active: 1994-2023
Publications (10 Years): 28

Top Venues

CoRR

LICS

FoSSaCS

CSR

University of Duisburg-Essen, Germany (PHD)

Education History

University of Duisburg-Essen, Germany

PHD

Publications

Peter Habermehl, Dietrich Kuske
On Presburger arithmetic extended with non-unary counting quantifiers. Log. Methods Comput. Sci. 19 (3) (2023)
Dietrich Kuske, Christian Schwarz
Alternating complexity of counting first-order logic for the subword order. Acta Informatica 60 (1) (2023)
Dietrich Kuske
A Class of Rational Trace Relations Closed Under Composition. FSTTCS (2023)
Chris Köcher, Dietrich Kuske
Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems. FCT (2023)
Peter Habermehl, Dietrich Kuske
On Presburger arithmetic extended with non-unary counting quantifiers. CoRR (2022)
Dietrich Kuske
Second-Order Finite Automata: Expressive Power and Simple Proofs Using Automatic Structures. DLT (2021)
Dietrich Kuske, Christian Schwarz
Complexity of Counting First-Order Logic for the Subword Order. MFCS (2020)
Dietrich Kuske
The Subtrace Order and Counting First-Order Logic. CSR (2020)
Dietrich Kuske, Georg Zetzsche
Languages ordered by the subword order. CoRR (2019)
Dietrich Kuske, Georg Zetzsche
Languages Ordered by the Subword Order. FoSSaCS (2019)
Dietrich Kuske, Jiamou Liu, Anastasia Moskvina
Infinite and Bi-infinite Words with Decidable Monadic Theories. Log. Methods Comput. Sci. 14 (3) (2018)
Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes
Multi-buffer simulations: Decidability and complexity. Inf. Comput. 262 (2018)
Faried Abu Zaid, Dietrich Kuske, Peter Lindner
Climbing up the Elementary Complexity Classes with Theories of Automatic Structures. CSL (2018)
Chris Köcher, Dietrich Kuske, Olena Prianychnykova
The inclusion structure of partially lossy queue monoids and their trace submonoids. RAIRO Theor. Informatics Appl. 52 (1) (2018)
Dietrich Kuske, Nicole Schweikardt
Gaifman Normal Forms for Counting Extensions of First-Order Logic. ICALP (2018)
Dietrich Kuske, Nicole Schweikardt
First-order logic with counting. LICS (2017)
Chris Köcher, Dietrich Kuske
The Transformation Monoid of a Partially Lossy Queue. CSR (2017)
Dietrich Kuske, Nicole Schweikardt
First-Order Logic with Counting: At Least, Weak Hanf Normal Forms Always Exist and Can Be Computed! CoRR (2017)
Georg Zetzsche, Dietrich Kuske, Markus Lohrey
On Boolean Closed Full Trios and Rational Kripke Frames. Theory Comput. Syst. 60 (3) (2017)
Benedikt Bollig, Dietrich Kuske, Roy Mennicke
The Complexity of Model Checking Multi-Stack Systems. Theory Comput. Syst. 60 (4) (2017)
Dietrich Kuske, Jiamou Liu, Anastasia Moskvina
Infinite and Bi-infinite Words with Decidable Monadic Theories. CoRR (2017)
Dietrich Kuske, Olena Prianychnykova
The trace monoids in the queue monoid and in the direct product of two free monoids. CoRR (2016)
Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes
Multi-Buffer Simulations for Trace Language Inclusion. GandALF (2016)
Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes
Two-Buffer Simulation Games. Cassting/SynCoP (2016)
Dietrich Kuske, Olena Prianychnykova
The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids. DLT (2016)
Lucas Heimberg, Dietrich Kuske, Nicole Schweikardt
Hanf normal form for first-order logic with unary counting quantifiers. LICS (2016)
Dietrich Kuske, Jiamou Liu, Anastasia Moskvina
Infinite and Bi-infinite Words with Decidable Monadic Theories. CSL (2015)
Peter Habermehl, Dietrich Kuske
On Presburger Arithmetic Extended with Modulo Counting Quantifiers. FoSSaCS (2015)
Martin Huschenbett, Dietrich Kuske, Georg Zetzsche
The Monoid of Queue Actions. MFCS (1) (2014)
Dietrich Kuske
Isomorphisms of scattered automatic linear orders. Theor. Comput. Sci. 533 (2014)
Martin Huschenbett, Dietrich Kuske, Georg Zetzsche
The monoid of queue actions. CoRR (2014)
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) (2013)
Lucas Heimberg, Dietrich Kuske, Nicole Schweikardt
An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree. LICS (2013)
Benedikt Bollig, Dietrich Kuske, Roy Mennicke
The Complexity of Model Checking Multi-stack Systems. LICS (2013)
Dietrich Kuske
Logical Aspects of the Lexicographic Order on 1-Counter Languages. MFCS (2013)
Dietrich Kuske, Jiamou Liu, Markus Lohrey
The isomorphism problem for ω-automatic trees. Ann. Pure Appl. Log. 164 (1) (2013)
Dietrich Kuske
Isomorphisms of scattered automatic linear orders. CSL (2012)
Benedikt Bollig, Dietrich Kuske
An optimal construction of Hanf sentences. J. Appl. Log. 10 (2) (2012)
Dietrich Kuske
Isomorphisms of scattered automatic linear orders CoRR (2012)
Dietrich Kuske, Thomas Weidner
Size and Computation of Injective Tree Automatic Presentations. MFCS (2011)
Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas
Singular Artin Monoids of Finite Coxeter Type Are Automatic. LATA (2011)
Dietrich Kuske, Markus Lohrey
Automatic structures of bounded degree revisited. J. Symb. Log. 76 (4) (2011)
Dietrich Kuske
Where Automatic Structures Benefit from Weighted Automata. Algebraic Foundations in Computer Science (2011)
Dietrich Kuske, Ingmar Meinecke
Construction of tree automata from regular expressions. RAIRO Theor. Informatics Appl. 45 (3) (2011)
Benedikt Bollig, Dietrich Kuske
An optimal construction of Hanf sentences CoRR (2011)
Dietrich Kuske, Jiamou Liu, Markus Lohrey
The Isomorphism Problem for omega-Automatic Trees CoRR (2010)
Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke
Propositional Dynamic Logic for Message-Passing Systems Log. Methods Comput. Sci. 6 (3) (2010)
Dietrich Kuske, Markus Lohrey
Some natural decision problems in automatic graphs. J. Symb. Log. 75 (2) (2010)
Dietrich Kuske, Jiamou Liu, Markus Lohrey
-Automatic Trees. CSL (2010)
Paul Gastin, Dietrich Kuske
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces. Inf. Comput. 208 (7) (2010)
Dietrich Kuske, Jiamou Liu, Markus Lohrey
The Isomorphism Problem on Classes of Automatic Structures. LICS (2010)
Dietrich Kuske
Is Ramsey's Theorem omega-automatic?. STACS (2010)
Dietrich Kuske, Jiamou Liu, Markus Lohrey
The Isomorphism Problem On Classes of Automatic Structures CoRR (2010)
Dietrich Kuske
(Un)countable and (Non)effective Versions of Ramsey's Theorem. AMS-ASL Joint Special Session (2009)
Dietrich Kuske
Is Ramsey's theorem omega-automatic? CoRR (2009)
Dietrich Kuske
Weighted and Unweighted Trace Automata. Acta Cybern. 19 (2) (2009)
Dietrich Kuske, Markus Lohrey
Automatic Structures of Bounded Degree Revisited. CSL (2009)
Dietrich Kuske
Theories of Automatic Structures and Their Complexity. CAI (2009)
Benedikt Bollig, Dietrich Kuske
Muller message-passing automata and logics. Inf. Comput. 206 (9-10) (2008)
Dietrich Kuske, Markus Lohrey
Hamiltonicity of automatic graphs. IFIP TCS (2008)
Dietrich Kuske
Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic CoRR (2008)
Dietrich Kuske, Markus Lohrey
Automatic structures of bounded degree revisited CoRR (2008)
Dietrich Kuske
Schützenberger's theorem on formal power series follows from Kleene's theorem. Theor. Comput. Sci. 401 (1-3) (2008)
Dietrich Kuske, Markus Lohrey
First-order and counting theories of omega-automatic structures. J. Symb. Log. 73 (1) (2008)
Dietrich Kuske, Ingmar Meinecke
Construction of Tree Automata from Regular Expressions. Developments in Language Theory (2008)
Dietrich Kuske, Markus Lohrey
Euler paths and ends in automatic and recursive graphs. AFL (2008)
Dietrich Kuske
Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic. STACS (2008)
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)
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)
Manfred Droste, Dietrich Kuske
Almost Every Domain is Universal. MFPS (2007)
Paul Gastin, Dietrich Kuske
Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces. Fundam. Informaticae 80 (1-3) (2007)
Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke
Propositional Dynamic Logic for Message-Passing Systems. FSTTCS (2007)
Benedikt Bollig, Dietrich Kuske
Muller Message-Passing Automata and Logics. LATA (2007)
Blaise Genest, Dietrich Kuske, Anca Muscholl
On Communicating Automata with Bounded Channels. Fundam. Informaticae 80 (1-3) (2007)
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)
Dietrich Kuske
Weighted asynchronous cellular automata. Theor. Comput. Sci. 374 (1-3) (2007)
Dietrich Kuske
Weighted Asynchronous Cellular Automata. STACS (2006)
Blaise Genest, Dietrich Kuske, Anca Muscholl
A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Inf. Comput. 204 (6) (2006)
Dietrich Kuske, Markus Lohrey
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems. LICS (2006)
Dietrich Kuske, Markus Lohrey
Logical Aspects of Cayley-graphs: the Monoid Case. Int. J. Algebra Comput. 16 (2) (2006)
Dietrich Kuske, Markus Lohrey
-Automatic Structures. FoSSaCS (2006)
Manfred Droste, Dietrich Kuske
Skew and infinitary formal power series. Theor. Comput. Sci. 366 (3) (2006)
Dietrich Kuske
Theories of orders on the set of words. RAIRO Theor. Informatics Appl. 40 (1) (2006)
Dietrich Kuske, Markus Lohrey
Logical aspects of Cayley-graphs: the group case. Ann. Pure Appl. Log. 131 (1-3) (2005)
Blaise Genest, Dietrich Kuske, Anca Muscholl, Doron A. Peled
Snapshot Verification. TACAS (2005)
Paul Gastin, Dietrich Kuske
Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces. CONCUR (2005)
Dietrich Kuske, Markus Lohrey
Decidable First-Order Theories of One-Step Rewriting in Trace Monoids. Theory Comput. Syst. 38 (1) (2005)
Dietrich Kuske, Peter Weigel
The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems. Developments in Language Theory (2004)
Blaise Genest, Anca Muscholl, Dietrich Kuske
A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. Developments in Language Theory (2004)
Dietrich Kuske, Ingmar Meinecke
Branching automata with costs - a way of reflecting parallelism in costs star. Theor. Comput. Sci. 328 (1-2) (2004)
Paul Gastin, Dietrich Kuske
Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE. CONCUR (2003)
Dietrich Kuske
Is Cantor's Theorem Automatic? LPAR (2003)
Manfred Droste, Dietrich Kuske
Skew and Infinitary Formal Power Series. ICALP (2003)
Ralph Kummetz, Dietrich Kuske
The topology of Mazurkiewicz traces. Theor. Comput. Sci. 305 (1-3) (2003)
Dietrich Kuske, Markus Lohrey
Decidable Theories of Cayley-Graphs. STACS (2003)
Dietrich Kuske, Ingmar Meinecke
Branching Automata with Costs - A Way of Reflecting Parallelism in Costs. CIAA (2003)
Dietrich Kuske
Regular sets of infinite message sequence charts. Inf. Comput. 187 (1) (2003)
Manfred Droste, Dietrich Kuske
On random relational structures. J. Comb. Theory, Ser. A 102 (2) (2003)
Dietrich Kuske
Towards a language theory for infinite N-free pomsets. Theor. Comput. Sci. 299 (1-3) (2003)
Dietrich Kuske, Rémi Morin
Pomsets for Local Trace Languages. J. Autom. Lang. Comb. 7 (2) (2002)

Dietrich Kuske.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Dietrich Kuske