| 2026 | MFCS | Boolean Combinations of ω-Rational Trace Languages: Emptiness, Rationality, Regularity. | Dietrich Kuske |
| 2025 | CiE | The Theory of Reachability of Trace-Pushdown Systems. | Dietrich Kuske |
| 2025 | FCT | Disjointness, Inclusion, and Regularity of mega-Rational Trace Languages - Extended Abstract -. | Dietrich Kuske |
| 2024 | STACS | Modal Logic Is More Succinct Iff Bi-Implication Is Available in Some Form. | Christoph Berkholz, Dietrich Kuske, Christian Schwarz |
| 2023 | FCT | Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems. | Chris Kcher, Dietrich Kuske |
| 2021 | DLT | Second-Order Finite Automata: Expressive Power and Simple Proofs Using Automatic Structures. | Dietrich Kuske |
| 2020 | CSR | The Subtrace Order and Counting First-Order Logic. | Dietrich Kuske |
| 2020 | MFCS | Complexity of Counting First-Order Logic for the Subword Order. | Dietrich Kuske, Christian Schwarz |
| 2019 | FOSSACS | Languages Ordered by the Subword Order. | Dietrich Kuske, Georg Zetzsche |
| 2018 | CSL | Climbing up the Elementary Complexity Classes with Theories of Automatic Structures. | Faried Abu Zaid, Dietrich Kuske, Peter Lindner |
| 2018 | ICALP | Gaifman Normal Forms for Counting Extensions of First-Order Logic. | Dietrich Kuske, Nicole Schweikardt |
| 2017 | CSR | The Transformation Monoid of a Partially Lossy Queue. | Chris Kcher, Dietrich Kuske |
| 2017 | LICS | First-order logic with counting. | Dietrich Kuske, Nicole Schweikardt |
| 2016 | DLT | The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids. | Dietrich Kuske, Olena Prianychnykova |
| 2016 | LICS | Hanf normal form for first-order logic with unary counting quantifiers. | Lucas Heimberg, Dietrich Kuske, Nicole Schweikardt |
| 2015 | CSL | Infinite and Bi-infinite Words with Decidable Monadic Theories. | Dietrich Kuske, Jiamou Liu, Anastasia Moskvina |
| 2015 | FOSSACS | On Presburger Arithmetic Extended with Modulo Counting Quantifiers. | Peter Habermehl, Dietrich Kuske |
| 2014 | MFCS | The Monoid of Queue Actions. | Martin Huschenbett, Dietrich Kuske, Georg Zetzsche |
| 2013 | LICS | The Complexity of Model Checking Multi-stack Systems. | Benedikt Bollig, Dietrich Kuske, Roy Mennicke |
| 2013 | LICS | An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree. | Lucas Heimberg, Dietrich Kuske, Nicole Schweikardt |
| 2013 | MFCS | Logical Aspects of the Lexicographic Order on 1-Counter Languages. | Dietrich Kuske |
| 2012 | CSL | Isomorphisms of scattered automatic linear orders. | Dietrich Kuske |
| 2011 | LATA | Singular Artin Monoids of Finite Coxeter Type Are Automatic. | Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas |
| 2011 | MFCS | Size and Computation of Injective Tree Automatic Presentations. | Dietrich Kuske, Thomas Weidner |
| 2010 | CSL | The Isomorphism Problem for | Dietrich Kuske, Jiamou Liu, Markus Lohrey |
| 2010 | LICS | The Isomorphism Problem on Classes of Automatic Structures. | Dietrich Kuske, Jiamou Liu, Markus Lohrey |
| 2010 | STACS | Is Ramsey's Theorem omega-automatic?. | Dietrich Kuske |
| 2009 | CSL | Automatic Structures of Bounded Degree Revisited. | Dietrich Kuske, Markus Lohrey |
| 2008 | DLT | Construction of Tree Automata from Regular Expressions. | Dietrich Kuske, Ingmar Meinecke |
| 2008 | STACS | Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic. | Dietrich Kuske |
| 2007 | LATA | Muller Message-Passing Automata and Logics. | Benedikt Bollig, Dietrich Kuske |
| 2006 | FOSSACS | First-Order and Counting Theories of | Dietrich Kuske, Markus Lohrey |
| 2006 | LICS | Monadic Chain Logic Over Iterations and Applications to Pushdown Systems. | Dietrich Kuske, Markus Lohrey |
| 2006 | STACS | Weighted Asynchronous Cellular Automata. | Dietrich Kuske |
| 2005 | CONCUR | Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces. | Paul Gastin, Dietrich Kuske |
| 2005 | TACAS | Snapshot Verification. | Blaise Genest, Dietrich Kuske, Anca Muscholl, Doron A. Peled |
| 2004 | DLT | A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms. | Blaise Genest, Anca Muscholl, Dietrich Kuske |
| 2004 | DLT | The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems. | Dietrich Kuske, Peter Weigel |
| 2003 | CONCUR | Satisfiability and Model Checking for MSO-definable Temporal Logics are in PSPACE. | Paul Gastin, Dietrich Kuske |
| 2003 | ICALP | Skew and Infinitary Formal Power Series. | Manfred Droste, Dietrich Kuske |
| 2003 | LPAR | Is Cantor's Theorem Automatic? | Dietrich Kuske |
| 2003 | STACS | Decidable Theories of Cayley-Graphs. | Dietrich Kuske, Markus Lohrey |
| 2002 | ICALP | On the Theory of One-Step Rewriting in Trace Monoids. | Dietrich Kuske, Markus Lohrey |
| 2002 | STACS | A Further Step towards a Theory of Regular MSC Languages. | Dietrich Kuske |
| 2001 | DLT | Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable. | Dietrich Kuske |
| 2001 | FCT | Divisibility Monoids: Presentation, Word Problem, and Rational Languages. | Dietrich Kuske |
| 2001 | STACS | A Model Theoretic Proof of Bchi-Type Theorems and First-Order Logic for N-Free Pomsets. | Dietrich Kuske |
| 2000 | CONCUR | Emptiness Is Decidable for Asynchronous Cellular Machines. | Dietrich Kuske |
| 2000 | CONCUR | Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets. | Dietrich Kuske, Rmi Morin |
| 2000 | ICALP | Infinite Series-Parallel Posets: Logic and Languages. | Dietrich Kuske |
| 2000 | LPAR | The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus. | Steffen Hlldobler, Dietrich Kuske |
| 1999 | FCT | On Recognizable Languages in Divisibility Monoids. | Manfred Droste, Dietrich Kuske |
| 1998 | CONCUR | Asynchronous Cellular Automata and Asynchronous Automata for Pomsets. | Dietrich Kuske |
| 1998 | ICALP | On Existentially First-Order Definable Languages and Their Relation to NP. | Bernd Borchert, Dietrich Kuske, Frank Stephan |
| 1995 | CSL | Languages and Logical Definability in Concurrency Monoids. | Manfred Droste, Dietrich Kuske |
| 1995 | DLT | Trace Languages Definable with Modular Quantifiers. | Manfred Droste, Dietrich Kuske |
| 1995 | STACS | Dependence Orders for Computations of Concurrent Automata. | Felipe Bracho, Manfred Droste, Dietrich Kuske |