Volker Diekert

ORCID

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 29

Top Venues

CoRR

Theory Comput. Syst.

Int. J. Algebra Comput.

ISSAC

Publications

Volker Diekert, Mikhail Volkov
Preface of the Special Issue Dedicated to Selected Papers from DLT 2022. Theory Comput. Syst. 68 (3) (2024)
Carlos Camino, Volker Diekert, Besik Dundua, Mircea Marin, Géraud Sénizergues
Regular matching problems for infinite trees. Log. Methods Comput. Sci. 18 (1) (2022)
Volker Diekert, Henning Fernau, Petra Wolf
Properties of graphs specified by a regular language. Acta Informatica 59 (4) (2022)
Volker Diekert, Manfred Kufleitner
Reachability Games and Parity Games. ICTAC (2022)
Volker Diekert, Manfred Kufleitner
Reachability Games and Parity Games. CoRR (2022)
Volker Diekert, Henning Fernau, Petra Wolf
Properties of Graphs Specified by a Regular Language. DLT (2021)
Volker Diekert, Henning Fernau, Petra Wolf
Properties of Graphs Specified by a Regular Language. CoRR (2021)
Volker Diekert, Igor Potapov, Pavel Semukhin
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices. ISSAC (2020)
Volker Diekert, Murray Elder
Solutions to twisted word equations and equations in virtually free groups. Int. J. Algebra Comput. 30 (04) (2020)
Carlos Camino, Volker Diekert, Besik Dundua, Mircea Marin, Géraud Sénizergues
Regular matching problems for infinite trees. CoRR (2020)
Volker Diekert, Olga Kharlampovich, Markus Lohrey, Alexei G. Myasnikov
Algorithmic Problems in Group Theory (Dagstuhl Seminar 19131). Dagstuhl Reports 9 (3) (2019)
Volker Diekert, Igor Potapov, Pavel Semukhin
Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices. CoRR (2019)
Volker Diekert, Lukas Fleischer
Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions. CoRR (2017)
Volker Diekert, Murray Elder
Solutions of Twisted Word Equations, EDT0L Languages, and Context-Free Groups. ICALP (2017)
Volker Diekert, Lukas Fleischer
Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions. WORDS (2017)
Volker Diekert, Alexei G. Myasnikov, Armin Weiß
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. J. Symb. Comput. 83 (2017)
Volker Diekert, Murray Elder
Solutions of twisted word equations, EDT0L languages, and context-free groups. CoRR (2017)
Volker Diekert, Tobias Walter
Characterizing classes of regular languages using prefix codes of bounded synchronization delay. Int. J. Algebra Comput. 27 (6) (2017)
Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva
Equations Over Free Inverse Monoids with Idempotent Variables. Theory Comput. Syst. 61 (2) (2017)
Volker Diekert, Tobias Walter
Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay. ICALP (2016)
Volker Diekert, Jonathan Kausch
Logspace computations in graph products. J. Symb. Comput. 75 (2016)
Volker Diekert, Manfred Kufleitner
A survey on the local divisor technique. Theor. Comput. Sci. 610 (2016)
Volker Diekert, Tobias Walter
Characterizing classes of regular languages using prefix codes of bounded synchronization delay. CoRR (2016)
Laura Ciobanu, Volker Diekert, Murray Elder
Solution sets for equations over free groups are EDT0L languages. Int. J. Algebra Comput. 26 (5) (2016)
Volker Diekert, Artur Jez, Manfred Kufleitner
Solutions of Word Equations Over Partially Commutative Structures. ICALP (2016)
Volker Diekert, Armin Weiß
QuickHeapsort: Modifications and Improved Analysis. Theory Comput. Syst. 59 (2) (2016)
Volker Diekert, Alexei G. Myasnikov, Armin Weiß
Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. Algorithmica 76 (4) (2016)
Volker Diekert, Artur Jez, Manfred Kufleitner
Solutions of Word Equations over Partially Commutative Structures. CoRR (2016)
Volker Diekert, Artur Jez, Wojciech Plandowski
Finding all solutions of equations in free groups and monoids with involution. Inf. Comput. 251 (2016)
Volker Diekert, Tobias Walter
Asymptotic Approximation for the Quotient Complexities of Atoms. Acta Cybern. 22 (2) (2015)
Volker Diekert, Anca Muscholl, Igor Walukiewicz
A Note on Monitors and Büchi Automata. ICTAC (2015)
Laura Ciobanu, Volker Diekert, Murray Elder
Solution sets for equations over free groups are EDT0L languages. CoRR (2015)
Laura Ciobanu, Volker Diekert, Murray Elder
Solution Sets for Equations over Free Groups are EDT0L Languages. ICALP (2) (2015)
Volker Diekert, Alexei G. Myasnikov, Armin Weiß
Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem. ISSAC (2015)
Volker Diekert, Olga Kharlampovich, Atefeh Mohajeri Moghaddam
SLP compression for solutions of equations with constraints in free and hyperbolic groups. Int. J. Algebra Comput. 25 (1-2) (2015)
Volker Diekert, Manfred Kufleitner
Omega-Rational Expressions with Bounded Synchronization Delay. Theory Comput. Syst. 56 (4) (2015)
Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter
Regular Languages Are Church-Rosser Congruential. J. ACM 62 (5) (2015)
Volker Diekert
More Than 1700 Years of Word Equations. CAI (2015)
Volker Diekert, Alexei G. Myasnikov, Armin Weiß
Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem. CoRR (2015)
Volker Diekert, Anca Muscholl, Igor Walukiewicz
A Note on Monitors and Büchi automata. CoRR (2015)
Volker Diekert
More Than 1700 Years of Word Equations. CoRR (2015)
Laura Ciobanu, Volker Diekert, Murray Elder
Solution sets for equations over free groups are EDT0L languages. CoRR (2015)
Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva
Equations over Free Inverse Monoids with Idempotent Variables. CSR (2015)
Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva
Equations over free inverse monoids with idempotent variables. CoRR (2014)
Volker Diekert, Manfred Kufleitner
A Survey on the Local Divisor Technique. CoRR (2014)
Volker Diekert, Artur Jez, Wojciech Plandowski
Finding All Solutions of Equations in Free Groups and Monoids with Involution. CSR (2014)
Volker Diekert, Artur Jez, Wojciech Plandowski
Finding All Solutions of Equations in Free Groups and Monoids with Involution. CoRR (2014)
Volker Diekert, Martin Leucker
Topology, monitorable properties and runtime verification. Theor. Comput. Sci. 537 (2014)
Volker Diekert, Jonathan Kausch
Logspace computations in graph products. ISSAC (2014)
Volker Diekert, Alexei G. Myasnikov, Armin Weiß
Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits. LATIN (2014)
Volker Diekert, Olga Kharlampovich, Atefeh Mohajeri Moghaddam
SLP compression for solutions of equations with constraints in free and hyperbolic groups. CoRR (2013)
Volker Diekert, Armin Weiß
QuickHeapsort: Modifications and Improved Analysis. CSR (2013)
Volker Diekert, Alexei Miasnikov, Armin Weiß
Conjugacy in Baumslag's group, generic case complexity, and division in power circuits. CoRR (2013)
Volker Diekert, Armin Weiß
Context-Free Groups and their Structure Trees. Int. J. Algebra Comput. 23 (3) (2013)
Volker Diekert, Jonathan Kausch
Logspace computations in graph products. CoRR (2013)
Volker Diekert, Manfred Kufleitner, Benjamin Steinberg
The Krohn-Rhodes Theorem and Local Divisors. Fundam. Informaticae 116 (1-4) (2012)
Volker Diekert, Steffen Kopecki
Language theoretical properties of hairpin formations. Theor. Comput. Sci. 429 (2012)
Volker Diekert, Jonathan Kausch, Markus Lohrey
Logspace Computations in Graph Groups and Coxeter Groups. LATIN (2012)
Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter
Regular Languages are Church-Rosser Congruential CoRR (2012)
Volker Diekert, Manfred Kufleitner, Pascal Weil
Star-free languages are Church-Rosser congruential. Theor. Comput. Sci. 454 (2012)
Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter
Regular Languages Are Church-Rosser Congruential. ICALP (2) (2012)
Volker Diekert, Jürn Laun, Alexander Ushakov
Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P. STACS (2012)
Volker Diekert, Armin Weiß
QuickHeapsort: Modifications and improved analysis CoRR (2012)
Volker Diekert, Anca Muscholl
On Distributed Monitoring of Asynchronous Systems. WoLLIC (2012)
Volker Diekert, Alexei G. Myasnikov
Group Extensions over Infinite Words. Int. J. Found. Comput. Sci. 23 (5) (2012)
Volker Diekert, Steffen Kopecki, Victor Mitrana
Deciding regularity of hairpin completions of regular languages in polynomial time. Inf. Comput. 217 (2012)
Volker Diekert, Anca Muscholl
On distributed monitoring of asynchronous systems CoRR (2012)
Volker Diekert, Andrew J. Duncan, Alexei G. Myasnikov
Cyclic rewriting and conjugacy problems. Groups Complex. Cryptol. 4 (2) (2012)
Volker Diekert, Manfred Kufleitner
Bounded Synchronization Delay in Omega-Rational Expressions. CSR (2012)
Volker Diekert, Jürn Laun, Alexander Ushakov
Efficient Algorithms for Highly Compressed Data: the Word Problem in Higman's Group is in P. Int. J. Algebra Comput. 22 (8) (2012)
Volker Diekert, Jürn Laun
On Computing Geodesics in Baumslag-Solitar Groups. Int. J. Algebra Comput. 21 (1-2) (2011)
Volker Diekert, Alexei G. Myasnikov
Solving Word Problems in Group Extensions over Infinite Words. Developments in Language Theory (2011)
Volker Diekert, Steffen Kopecki
It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular. Int. J. Found. Comput. Sci. 22 (8) (2011)
Volker Diekert, Manfred Kufleitner, Benjamin Steinberg
The Krohn-Rhodes Theorem and Local Divisors CoRR (2011)
Volker Diekert, Steffen Kopecki, Victor Mitrana
Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time CoRR (2011)
Volker Diekert, Manfred Kufleitner, Pascal Weil
Star-Free Languages are Church-Rosser Congruential CoRR (2011)
Volker Diekert, Steffen Kopecki
It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular CoRR (2011)
Volker Diekert, Manfred Kufleitner
Fragments of First-Order Logic over Infinite Words. Theory Comput. Syst. 48 (3) (2011)
Volker Diekert, Dirk Nowotka
Preface. Int. J. Found. Comput. Sci. 22 (2) (2011)
Volker Diekert, Alexei G. Myasnikov
Group extensions over infinite words CoRR (2010)
Volker Diekert, Steffen Kopecki
Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract). CIAA (2010)
Sergei N. Artëmov, Volker Diekert, Dima Grigoriev
Preface. Theory Comput. Syst. 46 (1) (2010)
Sergei N. Artëmov, Volker Diekert, Alexander A. Razborov
Preface. Theory Comput. Syst. 46 (4) (2010)
Volker Diekert, Dalia Krieger
Some remarks about stabilizers. Theor. Comput. Sci. 410 (30-32) (2009)
Volker Diekert, Steffen Kopecki, Victor Mitrana
On the Hairpin Completion of Regular Languages. ICTAC (2009)
Volker Diekert, Manfred Kufleitner
Fragments of first-order logic over infinite words CoRR (2009)
Volker Diekert, Manfred Kufleitner
Fragments of First-Order Logic over Infinite Words. STACS (2009)
Volker Diekert, Nicole Ondrusch, Markus Lohrey
Algorithmic Problems on Inverse Monoids over Virtually Free Groups. Int. J. Algebra Comput. 18 (1) (2008)
Volker Diekert, Markus Lohrey
Word Equations over Graph Products. Int. J. Algebra Comput. 18 (3) (2008)
Volker Diekert, Paul Gastin
First-order definable languages. Logic and Automata (2008)
Sergei N. Artëmov, Volker Diekert, Dima Grigoriev
Foreword. Theory Comput. Syst. 43 (2) (2008)
Volker Diekert, Paul Gastin, Manfred Kufleitner
A Survey on Small Fragments of First-Order Logic over Finite Words. Int. J. Found. Comput. Sci. 19 (3) (2008)
Volker Diekert, Manfred Kufleitner
On First-Order Fragments for Words and Mazurkiewicz Traces. Developments in Language Theory (2007)
Volker Diekert, Martin Horsch, Manfred Kufleitner
On First-Order Fragments for Mazurkiewicz Traces. Fundam. Informaticae 80 (1-3) (2007)
Volker Diekert, Bruno Durand
Foreword. Theory Comput. Syst. 40 (4) (2007)
Volker Diekert
Equations: From Words to Graph Products. LATA (2007)
Volker Diekert, Anca Muscholl
Solvability of Equations in Graph Groups Is Decidable. Int. J. Algebra Comput. 16 (6) (2006)
Volker Diekert, Paul Gastin
From local to global temporal logics over Mazurkiewicz traces. Theor. Comput. Sci. 356 (1-2) (2006)
Volker Diekert, Paul Gastin
Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Inf. Comput. 204 (11) (2006)
Volker Diekert, Michel Habib
Foreword. Theory Comput. Syst. 39 (1) (2006)

Volker Diekert.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Volker Diekert