| 2022 | ICTAC | Reachability Games and Parity Games. | Volker Diekert, Manfred Kufleitner |
| 2021 | DLT | Properties of Graphs Specified by a Regular Language. | Volker Diekert, Henning Fernau, Petra Wolf |
| 2020 | ISSAC | Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices. | Volker Diekert, Igor Potapov, Pavel Semukhin |
| 2017 | ICALP | Solutions of Twisted Word Equations, EDT0L Languages, and Context-Free Groups. | Volker Diekert, Murray Elder |
| 2016 | ICALP | Solutions of Word Equations Over Partially Commutative Structures. | Volker Diekert, Artur Jez, Manfred Kufleitner |
| 2016 | ICALP | Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay. | Volker Diekert, Tobias Walter |
| 2015 | CSR | Equations over Free Inverse Monoids with Idempotent Variables. | Volker Diekert, Florent Martin, Graud Snizergues, Pedro V. Silva |
| 2015 | ICALP | Solution Sets for Equations over Free Groups are EDT0L Languages. | Laura Ciobanu, Volker Diekert, Murray Elder |
| 2015 | ICTAC | A Note on Monitors and Bchi Automata. | Volker Diekert, Anca Muscholl, Igor Walukiewicz |
| 2015 | ISSAC | Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem. | Volker Diekert, Alexei G. Myasnikov, Armin Wei |
| 2014 | CSR | Finding All Solutions of Equations in Free Groups and Monoids with Involution. | Volker Diekert, Artur Jez, Wojciech Plandowski |
| 2014 | ISSAC | Logspace computations in graph products. | Volker Diekert, Jonathan Kausch |
| 2014 | LATIN | Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. | Volker Diekert, Alexei G. Myasnikov, Armin Wei |
| 2013 | CSR | QuickHeapsort: Modifications and Improved Analysis. | Volker Diekert, Armin Wei |
| 2012 | CSR | Bounded Synchronization Delay in Omega-Rational Expressions. | Volker Diekert, Manfred Kufleitner |
| 2012 | ICALP | Regular Languages Are Church-Rosser Congruential. | Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter |
| 2012 | LATIN | Logspace Computations in Graph Groups and Coxeter Groups. | Volker Diekert, Jonathan Kausch, Markus Lohrey |
| 2012 | STACS | Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P. | Volker Diekert, Jrn Laun, Alexander Ushakov |
| 2012 | WoLLIC | On Distributed Monitoring of Asynchronous Systems. | Volker Diekert, Anca Muscholl |
| 2011 | DLT | Solving Word Problems in Group Extensions over Infinite Words. | Volker Diekert, Alexei G. Myasnikov |
| 2009 | ICTAC | On the Hairpin Completion of Regular Languages. | Volker Diekert, Steffen Kopecki, Victor Mitrana |
| 2009 | STACS | Fragments of First-Order Logic over Infinite Words. | Volker Diekert, Manfred Kufleitner |
| 2007 | DLT | On First-Order Fragments for Words and Mazurkiewicz Traces. | Volker Diekert, Manfred Kufleitner |
| 2007 | LATA | Equations: From Words to Graph Products. | Volker Diekert |
| 2006 | MFCS | Partially Commutative Inverse Monoids. | Volker Diekert, Markus Lohrey, Alexander Miller |
| 2004 | LATIN | Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces. | Volker Diekert, Paul Gastin |
| 2002 | DLT | A Remark about Quadratic Trace Equations. | Volker Diekert, Manfred Kufleitner |
| 2002 | STACS | Existential and Positive Theories of Equations in Graph Products. | Volker Diekert, Markus Lohrey |
| 2001 | ICALP | Solvability of Equations in Free Partially Commutative Groups Is Decidable. | Volker Diekert, Anca Muscholl |
| 2001 | LPAR | Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets. | Volker Diekert, Paul Gastin |
| 2001 | STACS | The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete. | Volker Diekert, Claudio Gutierrez, Christian Hagenah |
| 2000 | ICALP | LTL Is Expressively Complete for Mazurkiewicz Traces. | Volker Diekert, Paul Gastin |
| 1999 | CSL | An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces. | Volker Diekert, Paul Gastin |
| 1999 | STACS | On Quadratic Word Equations. | John Michael Robson, Volker Diekert |
| 1997 | ICALP | Solving Trace Equations Using Lexicographical Normal Forms. | Volker Diekert, Yuri V. Matiyasevich, Anca Muscholl |
| 1997 | STACS | Removing epsilon-Transitions in Timed Automata. | Volker Diekert, Paul Gastin, Antoine Petit |
| 1996 | MFCS | Code Problems on Traces. | Volker Diekert, Anca Muscholl |
| 1996 | STACS | Trace Rewriting: Computing Normal Forms in Time O(n log n). | Michael Bertol, Volker Diekert |
| 1995 | DLT | Recent Developments in Trace Theory. | Volker Diekert, Paul Gastin, Antoine Petit |
| 1995 | ICALP | A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract). | Volker Diekert, Paul Gastin |
| 1995 | STACS | On Codings of Traces. | Volker Diekert, Anca Muscholl, Klaus Reinhardt |
| 1993 | FCT | Rewriting, Mbius Functions and Semi-Commutations. | Volker Diekert |
| 1993 | MFCS | Complex and Complex-Like Traces. | Volker Diekert |
| 1993 | STACS | Deterministic Asynchronous Automata for Infinite Traces. | Volker Diekert, Anca Muscholl |
| 1992 | MFCS | One-Rule Trace-Rewriting Systems and Confluence. | Celia Wrathall, Volker Diekert, Friedrich Otto |
| 1991 | ICALP | On Confluent Semi-Commutations - Decidability and Complexity Results. | Volker Diekert, Edward Ochmanski, Klaus Reinhardt |
| 1991 | MFCS | Recognizable Complex Trace Languages. | Volker Diekert, Paul Gastin, Antoine Petit |
| 1991 | STACS | On the Concatenation of Infinite Traces. | Volker Diekert |
| 1990 | STACS | Combinatorial Rewriting on Traces. | Volker Diekert |
| 1989 | STACS | Word Problems over TRaces Which are Solvable in Linear Time. | Volker Diekert |
| 1988 | ICALP | Transitive Orientations, Mbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids. | Volker Diekert |
| 1988 | MFCS | Local Checking of Trace Synchroniziability. | Volker Diekert, Walter Vogler |
| 1988 | STACS | Hotz-Isomorphism Theorems in Formal Language Theory. | Volker Diekert, Axel Mbus |
| 1987 | ICALP | On the Knuth-Bendix Completion for Concurrent Processes. | Volker Diekert |
| 1987 | STACS | Some Remarks on Presentations by Finite Church-Rosser Thue Systems. | Volker Diekert |
| 1985 | STACS | On Hotz Groups and Homomorphic Images of Sentential Form Languages. | Volker Diekert |