Volker Diekert

According to our database1, Volker Diekert
  • authored at least 158 papers between 1985 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Equations Over Free Inverse Monoids with Idempotent Variables.
Theory Comput. Syst., 2017

Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem.
J. Symb. Comput., 2017

Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions.
CoRR, 2017

Solutions of twisted word equations, EDT0L languages, and context-free groups.
CoRR, 2017

Solutions of Twisted Word Equations, EDT0L Languages, and Context-Free Groups.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016
A survey on the local divisor technique.
Theor. Comput. Sci., 2016

QuickHeapsort: Modifications and Improved Analysis.
Theory Comput. Syst., 2016

Logspace computations in graph products.
J. Symb. Comput., 2016

Solution sets for equations over free groups are EDT0L languages.
IJAC, 2016

Finding all solutions of equations in free groups and monoids with involution.
Inf. Comput., 2016

Characterizing classes of regular languages using prefix codes of bounded synchronization delay.
CoRR, 2016

Solutions of Word Equations over Partially Commutative Structures.
CoRR, 2016

Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits.
Algorithmica, 2016

Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Solutions of Word Equations Over Partially Commutative Structures.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Omega-Rational Expressions with Bounded Synchronization Delay.
Theory Comput. Syst., 2015

Regular Languages Are Church-Rosser Congruential.
J. ACM, 2015

SLP compression for solutions of equations with constraints in free and hyperbolic groups.
IJAC, 2015

A Note on Monitors and Büchi automata.
CoRR, 2015

Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem.
CoRR, 2015

More Than 1700 Years of Word Equations.
CoRR, 2015

Solution sets for equations over free groups are EDT0L languages.
CoRR, 2015

Solution sets for equations over free groups are EDT0L languages.
CoRR, 2015

Asymptotic Approximation for the Quotient Complexities of Atoms.
Acta Cybern., 2015

Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

A Note on Monitors and Büchi Automata.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

Solution Sets for Equations over Free Groups are EDT0L Languages.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Equations over Free Inverse Monoids with Idempotent Variables.
Proceedings of the Computer Science - Theory and Applications, 2015

More Than 1700 Years of Word Equations.
Proceedings of the Algebraic Informatics - 6th International Conference, 2015

2014
Topology, monitorable properties and runtime verification.
Theor. Comput. Sci., 2014

Equations over free inverse monoids with idempotent variables.
CoRR, 2014

A Survey on the Local Divisor Technique.
CoRR, 2014

Finding All Solutions of Equations in Free Groups and Monoids with Involution.
CoRR, 2014

Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Logspace computations in graph products.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

Finding All Solutions of Equations in Free Groups and Monoids with Involution.
Proceedings of the Computer Science - Theory and Applications, 2014

2013
Context-Free Groups and their Structure Trees.
IJAC, 2013

Conjugacy in Baumslag's group, generic case complexity, and division in power circuits.
CoRR, 2013

SLP compression for solutions of equations with constraints in free and hyperbolic groups.
CoRR, 2013

Logspace computations in graph products.
CoRR, 2013

QuickHeapsort: Modifications and Improved Analysis.
Proceedings of the Computer Science - Theory and Applications, 2013

Elemente der diskreten Mathematik - Zahlen und Zählen, Graphen und Verbände.
De Gruyter Studium, de Gruyter, ISBN: 978-3-11-027767-8, 2013

Diskrete algebraische Methoden - Arithmetik, Kryptographie, Automaten und Gruppen.
De Gruyter Studium, de Gruyter, ISBN: 978-3-11-031260-7, 2013

2012
Star-free languages are Church-Rosser congruential.
Theor. Comput. Sci., 2012

Language theoretical properties of hairpin formations.
Theor. Comput. Sci., 2012

Group Extensions over Infinite Words.
Int. J. Found. Comput. Sci., 2012

Efficient Algorithms for Highly Compressed Data: the Word Problem in Higman's Group is in P.
IJAC, 2012

Deciding regularity of hairpin completions of regular languages in polynomial time.
Inf. Comput., 2012

Cyclic rewriting and conjugacy problems.
Groups Complexity Cryptology, 2012

The Krohn-Rhodes Theorem and Local Divisors.
Fundam. Inform., 2012

QuickHeapsort: Modifications and improved analysis
CoRR, 2012

On distributed monitoring of asynchronous systems
CoRR, 2012

Regular Languages are Church-Rosser Congruential
CoRR, 2012

On Distributed Monitoring of Asynchronous Systems.
Proceedings of the Logic, Language, Information and Computation, 2012

Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Logspace Computations in Graph Groups and Coxeter Groups.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Regular Languages Are Church-Rosser Congruential.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Bounded Synchronization Delay in Omega-Rational Expressions.
Proceedings of the Computer Science - Theory and Applications, 2012

2011
Trace Theory.
Proceedings of the Encyclopedia of Parallel Computing, 2011

Fragments of First-Order Logic over Infinite Words.
Theory Comput. Syst., 2011

Preface.
Int. J. Found. Comput. Sci., 2011

It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular.
Int. J. Found. Comput. Sci., 2011

On Computing Geodesics in Baumslag-Solitar Groups.
IJAC, 2011

Star-Free Languages are Church-Rosser Congruential
CoRR, 2011

The Krohn-Rhodes Theorem and Local Divisors
CoRR, 2011

Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time
CoRR, 2011

It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular
CoRR, 2011

Solving Word Problems in Group Extensions over Infinite Words.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Marriage Broker.
Proceedings of the Algorithms Unplugged, 2011

2010
Preface.
Theory Comput. Syst., 2010

Preface.
Theory Comput. Syst., 2010

Group extensions over infinite words
CoRR, 2010

Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract).
Proceedings of the Implementation and Application of Automata, 2010

2009
Some remarks about stabilizers.
Theor. Comput. Sci., 2009

Fragments of first-order logic over infinite words
CoRR, 2009

Fragments of First-Order Logic over Infinite Words.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

On the Hairpin Completion of Regular Languages.
Proceedings of the Theoretical Aspects of Computing, 2009

2008
Partnerschaftsvermittlung.
Proceedings of the Taschenbuch der Algorithmen, 2008

Foreword.
Theory Comput. Syst., 2008

A Survey on Small Fragments of First-Order Logic over Finite Words.
Int. J. Found. Comput. Sci., 2008

Algorithmic Problems on Inverse Monoids over Virtually Free Groups.
IJAC, 2008

Word Equations over Graph Products.
IJAC, 2008

First-order definable languages.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007
Foreword.
Theory Comput. Syst., 2007

On First-Order Fragments for Mazurkiewicz Traces.
Fundam. Inform., 2007

Equations: From Words to Graph Products.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

On First-Order Fragments for Words and Mazurkiewicz Traces.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006
From local to global temporal logics over Mazurkiewicz traces.
Theor. Comput. Sci., 2006

Foreword.
Theory Comput. Syst., 2006

Solvability of Equations in Graph Groups Is Decidable.
IJAC, 2006

Pure future local temporal logics are expressively complete for Mazurkiewicz traces.
Inf. Comput., 2006

Partially Commutative Inverse Monoids.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005
Regular frequency computations.
Theor. Comput. Sci., 2005

The existential theory of equations with rational constraints in free groups is PSPACE-complete.
Inf. Comput., 2005

2004
Existential and Positive Theories of Equations in Graph Products.
Theory Comput. Syst., 2004

Local temporal logic is expressively complete for cograph dependence alphabets.
Inf. Comput., 2004

Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003
A structural property of regular frequency computations.
Theor. Comput. Sci., 2003

Word Equations over Graph Products.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002
LTL Is Expressively Complete for Mazurkiewicz Traces.
J. Comput. Syst. Sci., 2002

A Note on The Existential Theory of Equations in Plain Groups.
IJAC, 2002

Existential and Positive Theories of Equations in Graph Products.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

A Remark about Quadratic Trace Equations.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids.
Proceedings of the Formal and Natural Computing, 2002

2001
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete
CoRR, 2001

The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete.
Proceedings of the STACS 2001, 2001

Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets.
Proceedings of the Logic for Programming, 2001

Solvability of Equations in Free Partially Commutative Groups Is Decidable.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
LTL Is Expressively Complete for Mazurkiewicz Traces.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
Solving Word Equations modulo Partial Commutations.
Theor. Comput. Sci., 1999

On Quadratic Word Equations.
Proceedings of the STACS 99, 1999

An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces.
Proceedings of the Computer Science Logic, 13th International Workshop, 1999

Quadratic Word Equations.
Proceedings of the Jewels are Forever, 1999

1998
Characterization of the Expressive Power of Silent Transitions in Timed Automata.
Fundam. Inform., 1998

Approximating Traces.
Acta Inf., 1998

1997
Removing epsilon-Transitions in Timed Automata.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Solving Trace Equations Using Lexicographical Normal Forms.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

A Remark on Trace Equations.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1996
A Note on Métivier's Construction of Asynchronous Automata for Triangulated Graphs.
Fundam. Inform., 1996

Trace Rewriting: Computing Normal Forms in Time O(n log n).
Proceedings of the STACS 96, 1996

Code Problems on Traces.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995
Rational and Recognizable Complex Trace Languages
Inf. Comput., January, 1995

On Confluence of One-Rule Trace-Rewriting Systems.
Mathematical Systems Theory, 1995

On Codings of Traces.
STACS, 1995

A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Recent Developments in Trace Theory.
Proceedings of the Developments in Language Theory II, 1995

1994
On Confluent Semi-commutations: Decidability and Complexity Results
Inf. Comput., April, 1994

A Partial Trace Semantics for Petri Nets.
Theor. Comput. Sci., 1994

Deterministic Asynchronous Automata for Infinite Traces.
Acta Inf., 1994

1993
On the Concentration of Infinite Traces.
Theor. Comput. Sci., 1993

Möbius Functions and Confluent Semi-Commutations.
Theor. Comput. Sci., 1993

Deterministic Asynchronous Automata for Infinite Traces.
Proceedings of the STACS 93, 1993

Complex and Complex-Like Traces.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Rewriting, Möbius Functions and Semi-Commutations.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

On Efficient Reduction Algorithms for Some Trace Rewriting Systems.
Proceedings of the Term Rewriting, 1993

1992
One-Rule Trace-Rewriting Systems and Confluence.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

1991
On "Inherently Context-Sensitive" Languages - An Application of Complexity Cores.
Inf. Process. Lett., 1991

On the Concatenation of Infinite Traces.
Proceedings of the STACS 91, 1991

Recognizable Complex Trace Languages.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

On Confluent Semi-Commutations - Decidability and Complexity Results.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990
Word Problems Over Traces which are Solvable in Linear Time.
Theor. Comput. Sci., 1990

Combinatorial Rewriting on Traces.
Proceedings of the STACS 90, 1990

Combinatorics on Traces
Lecture Notes in Computer Science 454, Springer, ISBN: 3-540-53031-2, 1990

1989
On the Knuth-Bendix Completion for Concurrent Processes.
Theor. Comput. Sci., 1989

On the Synchronization of Traces.
Mathematical Systems Theory, 1989

Hotz-Isomorphism Theorems In Formal Language Theory.
ITA, 1989

Word Problems over TRaces Which are Solvable in Linear Time.
Proceedings of the STACS 89, 1989

1988
Hotz-Isomorphism Theorems in Formal Language Theory.
Proceedings of the STACS 88, 1988

Local Checking of Trace Synchroniziability.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987
Some Remarks on Presentations by Finite Church-Rosser Thue Systems.
Proceedings of the STACS 87, 1987

On the Knuth-Bendix Completion for Concurrent Processes.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986
Commutative monoids have complete presentations by free (non-commutative) monoids.
Theor. Comput. Sci., 1986

On some variants of the Ehrenfeucht conjecture.
Theor. Comput. Sci., 1986

Complete Semi-Thue Systems for Abelian Groups.
Theor. Comput. Sci., 1986

Investigations on Hotz Groups for Arbitrary Grammars.
Acta Inf., 1986

1985
On Hotz Groups and Homomorphic Images of Sentential Form Languages.
Proceedings of the STACS 85, 1985


  Loading...