| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter |
Regular Languages are Church-Rosser Congruential  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Volker Diekert, Jonathan Kausch, Markus Lohrey |
Logspace Computations in Graph Groups and Coxeter Groups. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Jürn Laun |
On Computing Geodesics in Baumslag-Solitar Groups. |
IJAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Steffen Kopecki |
It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular. |
Int. J. Found. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Dirk Nowotka |
Preface. |
Int. J. Found. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Steffen Kopecki, Victor Mitrana |
Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Volker Diekert, Steffen Kopecki |
It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Volker Diekert, Manfred Kufleitner, Benjamin Steinberg |
The Krohn-Rhodes Theorem and Local Divisors |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Volker Diekert, Manfred Kufleitner, Pascal Weil |
Star-Free Languages are Church-Rosser Congruential |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Volker Diekert, Manfred Kufleitner |
Fragments of First-Order Logic over Infinite Words. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Anca Muscholl |
Trace Theory. |
Encyclopedia of Parallel Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Claus, Volker Diekert, Holger Petersen |
Marriage Broker. |
Algorithms Unplugged |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Alexei G. Myasnikov |
Solving Word Problems in Group Extensions over Infinite Words. |
Developments in Language Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Alexei G. Myasnikov |
Group extensions over infinite words |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Sergei N. Artëmov, Volker Diekert, Alexander A. Razborov |
Preface. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergei N. Artëmov, Volker Diekert, Dima Grigoriev |
Preface. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Steffen Kopecki |
Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract). |
CIAA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Dalia Krieger |
Some remarks about stabilizers. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Manfred Kufleitner |
Fragments of first-order logic over infinite words |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Volker Diekert, Steffen Kopecki, Victor Mitrana |
On the Hairpin Completion of Regular Languages. |
ICTAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Manfred Kufleitner |
Fragments of First-Order Logic over Infinite Words. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Dirk Nowotka (eds.) |
Developments in Language Theory, 13th International Conference, DLT 2009, Stuttgart, Germany, June 30 - July 3, 2009. Proceedings |
Developments in Language Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Nicole Ondrusch, Markus Lohrey |
Algorithmic Problems on Inverse Monoids over Virtually Free Groups. |
IJAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Markus Lohrey |
Word Equations over Graph Products. |
IJAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin, Manfred Kufleitner |
A Survey on Small Fragments of First-Order Logic over Finite Words. |
Int. J. Found. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergei N. Artëmov, Volker Diekert, Dima Grigoriev |
Foreword. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Claus, Volker Diekert, Holger Petersen |
Partnerschaftsvermittlung. |
Taschenbuch der Algorithmen |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
First-order definable languages. |
Logic and Automata |
2008 |
DBLP BibTeX RDF |
|
| 1 | Volker Diekert, Martin Horsch, Manfred Kufleitner |
On First-Order Fragments for Mazurkiewicz Traces. |
Fundam. Inform. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Volker Diekert, Bruno Durand |
Foreword. |
Theory Comput. Syst. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Mikhail V. Volkov, Andrei Voronkov (eds.) |
Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings |
CSR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Volker Diekert |
Equations: From Words to Graph Products. |
LATA |
2007 |
DBLP BibTeX RDF |
|
| 1 | Volker Diekert, Manfred Kufleitner |
On First-Order Fragments for Words and Mazurkiewicz Traces. |
Developments in Language Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
From local to global temporal logics over Mazurkiewicz traces. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Anca Muscholl |
Solvability of Equations in Graph Groups Is Decidable. |
IJAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
Pure future local temporal logics are expressively complete for Mazurkiewicz traces. |
Inf. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Michel Habib |
Foreword. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Markus Lohrey, Alexander Miller |
Partially Commutative Inverse Monoids. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen |
Regular frequency computations. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Claudio Gutiérrez, Christian Hagenah |
The existential theory of equations with rational constraints in free groups is PSPACE-complete. |
Inf. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Bruno Durand (eds.) |
STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings |
STACS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
Local temporal logic is expressively complete for cograph dependence alphabets. |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Markus Lohrey |
Existential and Positive Theories of Equations in Graph Products. |
Theory Comput. Syst. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces. |
LATIN |
2004 |
DBLP DOI BibTeX RDF |
concurrency, Temporal logics, Mazurkiewicz traces |
| 1 | Volker Diekert, Michel Habib (eds.) |
STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings |
STACS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Holger Austinat, Volker Diekert, Ulrich Hertrampf |
A structural property of regular frequency computations. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Markus Lohrey |
Word Equations over Graph Products. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Markus Lohrey |
A Note on The Existential Theory of Equations in Plain Groups. |
IJAC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
LTL Is Expressively Complete for Mazurkiewicz Traces. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Markus Lohrey |
Existential and Positive Theories of Equations in Graph Products. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Manfred Kufleitner |
A Remark about Quadratic Trace Equations. |
Developments in Language Theory |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids. |
Formal and Natural Computing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Claudio Gutiérrez, Christian Hagenah |
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets. |
LPAR |
2001 |
DBLP DOI BibTeX RDF |
concurrency, Temporal logics, Mazurkiewicz traces |
| 1 | Volker Diekert, Anca Muscholl |
Solvability of Equations in Free Partially Commutative Groups Is Decidable. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Claudio Gutiérrez, Christian Hagenah |
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
free group, Formal languages, regular language, equations |
| 1 | Volker Diekert, Paul Gastin |
LTL Is Expressively Complete for Mazurkiewicz Traces. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Yuri Matiyasevich, Anca Muscholl |
Solving Word Equations modulo Partial Commutations. |
Theor. Comput. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | John Michael Robson, Volker Diekert |
On Quadratic Word Equations. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, John Michael Robson |
Quadratic Word Equations. |
Jewels are Forever |
1999 |
DBLP BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces. |
CSL |
1999 |
DBLP DOI BibTeX RDF |
concurrency, Temporal logics, Mazurkiewicz traces |
| 1 | Volker Diekert, Paul Gastin |
Approximating Traces. |
Acta Inf. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Béatrice Bérard, Antoine Petit, Volker Diekert, Paul Gastin |
Characterization of the Expressive Power of Silent Transitions in Timed Automata. |
Fundam. Inform. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Yuri Matiyasevich, Anca Muscholl |
Solving Trace Equations Using Lexicographical Normal Forms. |
ICALP |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin, Antoine Petit |
Removing epsilon-Transitions in Timed Automata. |
STACS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert |
A Remark on Trace Equations. |
Foundations of Computer Science: Potential - Theory - Cognition |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Anca Muscholl |
A Note on Métivier's Construction of Asynchronous Automata for Triangulated Graphs. |
Fundam. Inform. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Anca Muscholl |
Code Problems on Traces. |
MFCS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bertol, Volker Diekert |
Trace Rewriting: Computing Normal Forms in Time O(n log n). |
STACS |
1996 |
DBLP DOI BibTeX RDF |
rewriting modulo a partial commutation, Mazurkiewicz traces |
| 1 | Volker Diekert, Paul Gastin, Antoine Petit |
Rational and Recognizable Complex Trace Languages |
Inf. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Celia Wrathall, Volker Diekert |
On Confluence of One-Rule Trace-Rewriting Systems. |
Mathematical Systems Theory |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin |
A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract). |
ICALP |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Anca Muscholl, Klaus Reinhardt |
On Codings of Traces. |
STACS |
1995 |
DBLP DOI BibTeX RDF |
Topics Formal languages, concurrency |
| 1 | Volker Diekert, Paul Gastin, Antoine Petit |
Recent Developments in Trace Theory. |
Developments in Language Theory |
1995 |
DBLP BibTeX RDF |
|
| 1 | Volker Diekert |
A Partial Trace Semantics for Petri Nets. |
Theor. Comput. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Anca Muscholl |
Deterministic Asynchronous Automata for Infinite Traces. |
Acta Inf. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Edward Ochmanski, Klaus Reinhardt |
On Confluent Semi-commutations: Decidability and Complexity Results |
Inf. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert |
On the Concentration of Infinite Traces. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert |
Möbius Functions and Confluent Semi-Commutations. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert |
Complex and Complex-Like Traces. |
MFCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Anca Muscholl |
Deterministic Asynchronous Automata for Infinite Traces. |
STACS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert |
Rewriting, Möbius Functions and Semi-Commutations. |
FCT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Bertol, Volker Diekert |
On Efficient Reduction Algorithms for Some Trace Rewriting Systems. |
Term Rewriting |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Celia Wrathall, Volker Diekert, Friedrich Otto |
One-Rule Trace-Rewriting Systems and Confluence. |
MFCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Ronald V. Book |
On ``Inherently Context-Sensitive'' Languages - An Application of Complexity Cores. |
Inf. Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Edward Ochmanski, Klaus Reinhardt |
On Confluent Semi-Commutations - Decidability and Complexity Results. |
ICALP |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Paul Gastin, Antoine Petit |
Recognizable Complex Trace Languages. |
MFCS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert |
On the Concatenation of Infinite Traces. |
STACS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert |
Word Problems Over Traces which are Solvable in Linear Time. |
Theor. Comput. Sci. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert |
Combinatorics on Traces |
|
1990 |
DOI RDF |
|
| 1 | Volker Diekert |
Combinatorial Rewriting on Traces. |
STACS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert |
On the Knuth-Bendix Completion for Concurrent Processes. |
Theor. Comput. Sci. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Axel Möbus |
Hotz-Isomorphism Theorems In Formal Language Theory. |
ITA |
1989 |
DBLP BibTeX RDF |
|
| 1 | Volker Diekert, Walter Vogler |
On the Synchronization of Traces. |
Mathematical Systems Theory |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert |
Word Problems over TRaces Which are Solvable in Linear Time. |
STACS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert |
Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids. |
ICALP |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Walter Vogler |
Local Checking of Trace Synchroniziability. |
MFCS |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert, Axel Möbus |
Hotz-Isomorphism Theorems in Formal Language Theory. |
STACS |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Volker Diekert |
On the Knuth-Bendix Completion for Concurrent Processes. |
ICALP |
1987 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")