Volker Diekert - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Marriage BrokerVolker Claus, Volker Diekert, Holger Petersen. In Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner, editors, Algorithms Unplugged. pages 345-355, Springer, 2011. [doi]

PrefaceVolker Diekert, Dirk Nowotka. ijfcs, 22(2):275-276, 2011. [doi]

Solving Word Problems in Group Extensions over Infinite WordsVolker Diekert, Alexei G. Myasnikov. dlt 2011: 192-203 [doi]

Fragments of First-Order Logic over Infinite WordsVolker Diekert, Manfred Kufleitner. mst, 48(3):486-516, 2011. [doi]

2010

PrefaceSergei N. ArtÃ«mov, Volker Diekert, Dima Grigoriev. mst, 46(1):1, 2010. [doi]

PrefaceSergei N. Artëmov, Volker Diekert, Alexander A. Razborov. mst, 46(4):619, 2010. [doi]

Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract)Volker Diekert, Steffen Kopecki. wia 2011: 105-114 [doi]

2009

Developments in Language Theory, 13th International Conference, DLT 2009, Stuttgart, Germany, June 30 - July 3, 2009. ProceedingsVolker Diekert, Dirk Nowotka, editors, Volume 5583 of Lecture Notes in Computer Science, Springer, 2009. [doi]

On the Hairpin Completion of Regular LanguagesVolker Diekert, Steffen Kopecki, Victor Mitrana. ictac 2009: 170-184 [doi]

Some remarks about stabilizersVolker Diekert, Dalia Krieger. TCS, 410(30-32):2935-2946, 2009. [doi]

Fragments of First-Order Logic over Infinite WordsVolker Diekert, Manfred Kufleitner. STACS 2009: 325-336 [doi]

2008

ForewordSergei N. Artëmov, Volker Diekert, Dima Grigoriev. mst, 43(2):99, 2008. [doi]

Algorithmic Problems on Inverse Monoids over Virtually Free GroupsVolker Diekert, Nicole Ondrusch, Markus Lohrey. ijac, 18(1):181-208, 2008. [doi]

First-order definable languagesVolker Diekert, Paul Gastin. BIRTHDAY 2008: 261-306

A Survey on Small Fragments of First-Order Logic over Finite WordsVolker Diekert, Paul Gastin, Manfred Kufleitner. ijfcs, 19(3):513-548, 2008. [doi]

Word Equations over Graph ProductsVolker Diekert, Markus Lohrey. ijac, 18(3):493-533, 2008. [doi]

2007

ForewordVolker Diekert, Bruno Durand. mst, 40(4):301, 2007. [doi]

On First-Order Fragments for Words and Mazurkiewicz TracesVolker Diekert, Manfred Kufleitner. dlt 2007: 1-19 [doi]

On First-Order Fragments for Mazurkiewicz TracesVolker Diekert, Martin Horsch, Manfred Kufleitner. FUIN, 80(1-3):1-29, 2007. [doi]

Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, ProceedingsVolker Diekert, Mikhail V. Volkov, Andrei Voronkov, editors, Volume 4649 of Lecture Notes in Computer Science, Springer, 2007.

2006

Partially Commutative Inverse MonoidsVolker Diekert, Markus Lohrey, Alexander Miller. mfcs 2006: 292-304 [doi]

ForewordVolker Diekert, Michel Habib. mst, 39(1):1, 2006. [doi]

From local to global temporal logics over Mazurkiewicz tracesVolker Diekert, Paul Gastin. TCS, 356(1-2):126-135, 2006. [doi]

Pure future local temporal logics are expressively complete for Mazurkiewicz tracesVolker Diekert, Paul Gastin. iandc, 204(11):1597-1619, 2006. [doi]

Solvability of Equations in Graph Groups Is DecidableVolker Diekert, Anca Muscholl. ijac, 16(6):1047-1070, 2006. [doi]

2005

Regular frequency computationsHolger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen. TCS, 330(1):15-21, 2005. [doi]

The existential theory of equations with rational constraints in free groups is PSPACE-completeVolker Diekert, Claudio Gutiérrez, Christian Hagenah. iandc, 202(2):105-140, 2005. [doi]

STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, ProceedingsVolker Diekert, Bruno Durand, editors, Volume 3404 of Lecture Notes in Computer Science, Springer, 2005.

2004

Local temporal logic is expressively complete for cograph dependence alphabetsVolker Diekert, Paul Gastin. iandc, 195(1-2):30-52, 2004. [doi]

Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz TracesVolker Diekert, Paul Gastin. latin 2004: 232-241 [doi]

STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, ProceedingsVolker Diekert, Michel Habib, editors, Volume 2996 of Lecture Notes in Computer Science, Springer, 2004.

Existential and Positive Theories of Equations in Graph ProductsVolker Diekert, Markus Lohrey. mst, 37(1):133-156, 2004. [doi]

2003

A structural property of regular frequency computationsHolger Austinat, Volker Diekert, Ulrich Hertrampf. TCS, 292(1):33-43, 2003.

Word Equations over Graph ProductsVolker Diekert, Markus Lohrey. fsttcs 2003: 156-167 [doi]

2002

2001

Solvability of Equations in Free Partially Commutative Groups Is DecidableVolker Diekert, Anca Muscholl. icalp 2001: 543-554 [doi]

Local Temporal Logic is Expressively Complete for Cograph Dependence AlphabetsVolker Diekert, Paul Gastin. lpar 2001: 55-69 [doi]

The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-CompleteVolker Diekert, Claudio Gutiérrez, Christian Hagenah. STACS 2001: 170-182 [doi]

2000

LTL Is Expressively Complete for Mazurkiewicz TracesVolker Diekert, Paul Gastin. icalp 2000: 211-222 [doi]

1999

Quadratic Word EquationsVolker Diekert, John Michael Robson. BIRTHDAY 1999: 314-326

Solving Word Equations modulo Partial CommutationsVolker Diekert, Yuri Matiyasevich, Anca Muscholl. TCS, 224(1-2):215-235, 1999. [doi]

An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz TracesVolker Diekert, Paul Gastin. csl 1999: 188-203

On Quadratic Word EquationsJohn Michael Robson, Volker Diekert. STACS 1999: 217-226 [doi]

1998

Characterization of the Expressive Power of Silent Transitions in Timed AutomataBéatrice Bérard, Antoine Petit, Volker Diekert, Paul Gastin. FUIN, 36(2-3):145-182, 1998.

Approximating TracesVolker Diekert, Paul Gastin. ACTA, 35(7):567-593, 1998. [doi]

1997

A Remark on Trace EquationsVolker Diekert. BIRTHDAY 1997: 251-260 [doi]

Solving Trace Equations Using Lexicographical Normal FormsVolker Diekert, Yuri Matiyasevich, Anca Muscholl. icalp 1997: 336-346

Removing epsilon-Transitions in Timed AutomataVolker Diekert, Paul Gastin, Antoine Petit. STACS 1997: 583-594

1996

Trace Rewriting: Computing Normal Forms in Time O(n log n)Michael Bertol, Volker Diekert. STACS 1996: 269-280

Code Problems on TracesVolker Diekert, Anca Muscholl. mfcs 1996: 2-17

A Note on Métivier s Construction of Asynchronous Automata for Triangulated GraphsVolker Diekert, Anca Muscholl. FUIN, 25(3):241-246, 1996.

1995

1994

Deterministic Asynchronous Automata for Infinite TracesVolker Diekert, Anca Muscholl. ACTA, 31(4):379-397, 1994.

On Confluent Semi-commutations: Decidability and Complexity ResultsVolker Diekert, Edward Ochmanski, Klaus Reinhardt. iandc, 110(1):164-182, April 1994.

A Partial Trace Semantics for Petri NetsVolker Diekert. TCS, 134(1):87-105, 1994.

1993

1992

One-Rule Trace-Rewriting Systems and ConfluenceCelia Wrathall, Volker Diekert, Friedrich Otto. mfcs 1992: 511-521

1991

On Confluent Semi-Commutations - Decidability and Complexity ResultsVolker Diekert, Edward Ochmanski, Klaus Reinhardt. icalp 1991: 229-241

Recognizable Complex Trace LanguagesVolker Diekert, Paul Gastin, Antoine Petit. mfcs 1991: 131-140

On the Concatenation of Infinite TracesVolker Diekert. STACS 1991: 105-117

On Inherently Context-Sensitive Languages - An Application of Complexity CoresVolker Diekert, Ronald V. Book. ipl, 40(1):21-23, 1991.

1990

Word Problems Over Traces which are Solvable in Linear TimeVolker Diekert. TCS, 74(1):3-18, 1990.

Combinatorics on TracesVolker Diekert. Volume 454 of Lecture Notes in Computer Science, Springer, 1990.

Combinatorial Rewriting on TracesVolker Diekert. STACS 1990: 138-151

1989

On the Knuth-Bendix Completion for Concurrent ProcessesVolker Diekert. TCS, 66(2):117-136, 1989.

Word Problems over TRaces Which are Solvable in Linear TimeVolker Diekert. STACS 1989: 168-180

Hotz-Isomorphism Theorems In Formal Language TheoryVolker Diekert, Axel Möbus. ita, 23(1):29-43, 1989.

On the Synchronization of TracesVolker Diekert, Walter Vogler. mst, 22(3):161-175, 1989.

1988

Local Checking of Trace SynchroniziabilityVolker Diekert, Walter Vogler. mfcs 1988: 271-279

Hotz-Isomorphism Theorems in Formal Language TheoryVolker Diekert, Axel Möbus. STACS 1988: 126-135

Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative MonoidsVolker Diekert. icalp 1988: 176-187

1987

On the Knuth-Bendix Completion for Concurrent ProcessesVolker Diekert. icalp 1987: 42-53

Some Remarks on Presentations by Finite Church-Rosser Thue SystemsVolker Diekert. STACS 1987: 272-285

1986

Complete Semi-Thue Systems for Abelian GroupsVolker Diekert. TCS, 44:199-208, 1986.

Investigations on Hotz Groups for Arbitrary GrammarsVolker Diekert. ACTA, 22(6):679-698, 1986.

1985

On Hotz Groups and Homomorphic Images of Sentential Form LanguagesVolker Diekert. STACS 1985: 87-97