Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Volker Diekert
2010 – today
- 2013
[j50]Volker Diekert, Armin Weiß: Context-Free Groups and their Structure Trees. IJAC 23(3): 611-642 (2013)- [c50]
- 2012
- [j49]Volker Diekert, Manfred Kufleitner, Benjamin Steinberg: The Krohn-Rhodes Theorem and Local Divisors. Fundam. Inform. 116(1-4): 65-77 (2012)
- [j48]Volker Diekert, Andrew J. Duncan, Alexei G. Myasnikov: Cyclic rewriting and conjugacy problems. Groups Complexity Cryptology 4(2): 321-355 (2012)
- [j47]Volker Diekert, Steffen Kopecki, Victor Mitrana: Deciding regularity of hairpin completions of regular languages in polynomial time. Inf. Comput. 217: 12-30 (2012)
- [j46]Volker Diekert, Jürn Laun, Alexander Ushakov: Efficient Algorithms for Highly Compressed Data: the Word Problem in Higman's Group is in P. IJAC 22(8) (2012)
- [j45]Volker Diekert, Alexei G. Myasnikov: Group Extensions over Infinite Words. Int. J. Found. Comput. Sci. 23(5): 1001-1020 (2012)
- [j44]Volker Diekert, Steffen Kopecki: Language theoretical properties of hairpin formations. Theor. Comput. Sci. 429: 65-73 (2012)
- [j43]Volker Diekert, Manfred Kufleitner, Pascal Weil: Star-free languages are Church-Rosser congruential. Theor. Comput. Sci. 454: 129-135 (2012)
- [c49]Volker Diekert, Manfred Kufleitner: Bounded Synchronization Delay in Omega-Rational Expressions. CSR 2012: 89-98
- [c48]Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter: Regular Languages Are Church-Rosser Congruential. ICALP (2) 2012: 177-188
- [c47]Volker Diekert, Jonathan Kausch, Markus Lohrey: Logspace Computations in Graph Groups and Coxeter Groups. LATIN 2012: 243-254
- [c46]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: 218-229
- [c45]Volker Diekert, Anca Muscholl: On Distributed Monitoring of Asynchronous Systems. WoLLIC 2012: 70-84
- [i10]Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter: Regular Languages are Church-Rosser Congruential. CoRR abs/1202.1148 (2012)
- [i9]Volker Diekert, Anca Muscholl: On distributed monitoring of asynchronous systems. CoRR abs/1208.2125 (2012)
- [i8]Volker Diekert, Armin Weiss: QuickHeapsort: Modifications and improved analysis. CoRR abs/1209.4214 (2012)
- 2011
- [j42]
- [j41]
- [j40]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): 1813-1828 (2011)
- [j39]Volker Diekert, Manfred Kufleitner: Fragments of First-Order Logic over Infinite Words. Theory Comput. Syst. 48(3): 486-516 (2011)
- [p2]
- [c44]Volker Diekert, Alexei G. Myasnikov: Solving Word Problems in Group Extensions over Infinite Words. Developments in Language Theory 2011: 192-203
- [r1]
- [i7]Volker Diekert, Steffen Kopecki: It Is NL-complete to Decide Whether a Hairpin Completion of Regular Languages Is Regular. CoRR abs/1101.4824 (2011)
- [i6]Volker Diekert, Steffen Kopecki, Victor Mitrana: Deciding Regularity of Hairpin Completions of Regular Languages in Polynomial Time. CoRR abs/1108.2427 (2011)
- [i5]Volker Diekert, Manfred Kufleitner, Benjamin Steinberg: The Krohn-Rhodes Theorem and Local Divisors. CoRR abs/1111.1585 (2011)
- [i4]Volker Diekert, Manfred Kufleitner, Pascal Weil: Star-Free Languages are Church-Rosser Congruential. CoRR abs/1111.4300 (2011)
- 2010
- [j38]
- [j37]Sergei N. Artëmov, Volker Diekert, Alexander A. Razborov: Preface. Theory Comput. Syst. 46(4): 619 (2010)
- [c43]Volker Diekert, Steffen Kopecki: Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract). CIAA 2010: 105-114
- [i3]Volker Diekert, Alexei G. Myasnikov: Group extensions over infinite words. CoRR abs/1011.2024 (2010)
2000 – 2009
- 2009
- [j36]Volker Diekert, Dalia Krieger: Some remarks about stabilizers. Theor. Comput. Sci. 410(30-32): 2935-2946 (2009)
- [c42]Volker Diekert, Steffen Kopecki, Victor Mitrana: On the Hairpin Completion of Regular Languages. ICTAC 2009: 170-184
- [c41]Volker Diekert, Manfred Kufleitner: Fragments of First-Order Logic over Infinite Words. STACS 2009: 325-336
- [e4]Volker Diekert, Dirk Nowotka (Eds.): Developments in Language Theory, 13th International Conference, DLT 2009, Stuttgart, Germany, June 30 - July 3, 2009. Proceedings. Lecture Notes in Computer Science 5583, Springer 2009, ISBN 978-3-642-02736-9
- [i2]Volker Diekert, Manfred Kufleitner: Fragments of first-order logic over infinite words. CoRR abs/0906.2995 (2009)
- 2008
- [j35]Volker Diekert, Nicole Ondrusch, Markus Lohrey: Algorithmic Problems on Inverse Monoids over Virtually Free Groups. IJAC 18(1): 181-208 (2008)
- [j34]
- [j33]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): 513-548 (2008)
- [j32]
- [c40]
- [p1]Volker Claus, Volker Diekert, Holger Petersen: Partnerschaftsvermittlung. Taschenbuch der Algorithmen 2008: 373-383
- 2007
- [j31]Volker Diekert, Martin Horsch, Manfred Kufleitner: On First-Order Fragments for Mazurkiewicz Traces. Fundam. Inform. 80(1-3): 1-29 (2007)
- [j30]
- [c39]Volker Diekert, Manfred Kufleitner: On First-Order Fragments for Words and Mazurkiewicz Traces. Developments in Language Theory 2007: 1-19
- [c38]
- [e3]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. Lecture Notes in Computer Science 4649, Springer 2007, ISBN 978-3-540-74509-9
- 2006
- [j29]Volker Diekert, Paul Gastin: Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Inf. Comput. 204(11): 1597-1619 (2006)
- [j28]Volker Diekert, Anca Muscholl: Solvability of Equations in Graph Groups Is Decidable. IJAC 16(6): 1047-1070 (2006)
- [j27]
- [j26]Volker Diekert, Paul Gastin: From local to global temporal logics over Mazurkiewicz traces. Theor. Comput. Sci. 356(1-2): 126-135 (2006)
- [c37]Volker Diekert, Markus Lohrey, Alexander Miller: Partially Commutative Inverse Monoids. MFCS 2006: 292-304
- 2005
- [j25]Volker Diekert, Claudio Gutiérrez, Christian Hagenah: The existential theory of equations with rational constraints in free groups is PSPACE-complete. Inf. Comput. 202(2): 105-140 (2005)
- [j24]Holger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen: Regular frequency computations. Theor. Comput. Sci. 330(1): 15-21 (2005)
- [e2]Volker Diekert, Bruno Durand (Eds.): STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings. Lecture Notes in Computer Science 3404, Springer 2005, ISBN 3-540-24998-2
- 2004
- [j23]Volker Diekert, Paul Gastin: Local temporal logic is expressively complete for cograph dependence alphabets. Inf. Comput. 195(1-2): 30-52 (2004)
- [j22]Volker Diekert, Markus Lohrey: Existential and Positive Theories of Equations in Graph Products. Theory Comput. Syst. 37(1): 133-156 (2004)
- [c36]Volker Diekert, Paul Gastin: Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces. LATIN 2004: 232-241
- [e1]Volker Diekert, Michel Habib (Eds.): STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings. Lecture Notes in Computer Science 2996, Springer 2004, ISBN 3-540-21236-1
- 2003
- [j21]Holger Austinat, Volker Diekert, Ulrich Hertrampf: A structural property of regular frequency computations. Theor. Comput. Sci. 292(1): 33-43 (2003)
- [c35]
- 2002
- [j20]Volker Diekert, Markus Lohrey: A Note on The Existential Theory of Equations in Plain Groups. IJAC 12(1-2): 1-7 (2002)
- [j19]Volker Diekert, Paul Gastin: LTL Is Expressively Complete for Mazurkiewicz Traces. J. Comput. Syst. Sci. 64(2): 396-418 (2002)
- [c34]Volker Diekert, Paul Gastin: Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids. Formal and Natural Computing 2002: 26-38
- [c33]Volker Diekert, Manfred Kufleitner: A Remark about Quadratic Trace Equations. Developments in Language Theory 2002: 59-66
- [c32]Volker Diekert, Markus Lohrey: Existential and Positive Theories of Equations in Graph Products. STACS 2002: 501-512
- 2001
- [c31]Volker Diekert, Anca Muscholl: Solvability of Equations in Free Partially Commutative Groups Is Decidable. ICALP 2001: 543-554
- [c30]Volker Diekert, Paul Gastin: Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets. LPAR 2001: 55-69
- [c29]Volker Diekert, Claudio Gutiérrez, Christian Hagenah: The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete. STACS 2001: 170-182
- [i1]Volker Diekert, Claudio Gutiérrez, Christian Hagenah: The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete. CoRR cs.DS/0103018 (2001)
- 2000
- [c28]Volker Diekert, Paul Gastin: LTL Is Expressively Complete for Mazurkiewicz Traces. ICALP 2000: 211-222
1990 – 1999
- 1999
- [j18]Volker Diekert, Yuri Matiyasevich, Anca Muscholl: Solving Word Equations modulo Partial Commutations. Theor. Comput. Sci. 224(1-2): 215-235 (1999)
- [c27]
- [c26]Volker Diekert, Paul Gastin: An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces. CSL 1999: 188-203
- [c25]
- 1998
- [j17]
- [j16]Béatrice Bérard, Antoine Petit, Volker Diekert, Paul Gastin: Characterization of the Expressive Power of Silent Transitions in Timed Automata. Fundam. Inform. 36(2-3): 145-182 (1998)
- 1997
- [c24]Volker Diekert: A Remark on Trace Equations. Foundations of Computer Science: Potential - Theory - Cognition 1997: 251-260
- [c23]Volker Diekert, Yuri Matiyasevich, Anca Muscholl: Solving Trace Equations Using Lexicographical Normal Forms. ICALP 1997: 336-346
- [c22]Volker Diekert, Paul Gastin, Antoine Petit: Removing epsilon-Transitions in Timed Automata. STACS 1997: 583-594
- 1996
- [j15]Volker Diekert, Anca Muscholl: A Note on Métivier's Construction of Asynchronous Automata for Triangulated Graphs. Fundam. Inform. 25(3): 241-246 (1996)
- [c21]
- [c20]Michael Bertol, Volker Diekert: Trace Rewriting: Computing Normal Forms in Time O(n log n). STACS 1996: 269-280
- 1995
- [j14]Volker Diekert, Paul Gastin, Antoine Petit: Rational and Recognizable Complex Trace Languages. Inf. Comput. 116(1): 134-153 (1995)
- [j13]Celia Wrathall, Volker Diekert: On Confluence of One-Rule Trace-Rewriting Systems. Mathematical Systems Theory 28(4): 341-361 (1995)
- [c19]Volker Diekert, Paul Gastin, Antoine Petit: Recent Developments in Trace Theory. Developments in Language Theory 1995: 373-385
- [c18]Volker Diekert, Paul Gastin: A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract). ICALP 1995: 15-26
- [c17]
- 1994
- [j12]Volker Diekert, Anca Muscholl: Deterministic Asynchronous Automata for Infinite Traces. Acta Inf. 31(4): 379-397 (1994)
- [j11]Volker Diekert, Edward Ochmanski, Klaus Reinhardt: On Confluent Semi-commutations: Decidability and Complexity Results. Inf. Comput. 110(1): 164-182 (1994)
- [j10]
- 1993
- [j9]Volker Diekert: Möbius Functions and Confluent Semi-Commutations. Theor. Comput. Sci. 108(1): 25-43 (1993)
- [j8]
- [c16]Michael Bertol, Volker Diekert: On Efficient Reduction Algorithms for Some Trace Rewriting Systems. Term Rewriting 1993: 114-126
- [c15]
- [c14]
- [c13]Volker Diekert, Anca Muscholl: Deterministic Asynchronous Automata for Infinite Traces. STACS 1993: 617-628
- 1992
- [c12]Celia Wrathall, Volker Diekert, Friedrich Otto: One-Rule Trace-Rewriting Systems and Confluence. MFCS 1992: 511-521
- 1991
- [j7]Volker Diekert, Ronald V. Book: On ``Inherently Context-Sensitive'' Languages - An Application of Complexity Cores. Inf. Process. Lett. 40(1): 21-23 (1991)
- [c11]Volker Diekert, Edward Ochmanski, Klaus Reinhardt: On Confluent Semi-Commutations - Decidability and Complexity Results. ICALP 1991: 229-241
- [c10]Volker Diekert, Paul Gastin, Antoine Petit: Recognizable Complex Trace Languages. MFCS 1991: 131-140
- [c9]
- 1990
- [b1]Volker Diekert: Combinatorics on Traces. Lecture Notes in Computer Science 454, Springer 1990, ISBN 3-540-53031-2
- [j6]Volker Diekert: Word Problems Over Traces which are Solvable in Linear Time. Theor. Comput. Sci. 74(1): 3-18 (1990)
- [c8]
1980 – 1989
- 1989
- [j5]Volker Diekert, Axel Möbus: Hotz-Isomorphism Theorems In Formal Language Theory. ITA 23(1): 29-43 (1989)
- [j4]Volker Diekert, Walter Vogler: On the Synchronization of Traces. Mathematical Systems Theory 22(3): 161-175 (1989)
- [j3]Volker Diekert: On the Knuth-Bendix Completion for Concurrent Processes. Theor. Comput. Sci. 66(2): 117-136 (1989)
- [c7]
- 1988
- [c6]Volker Diekert: Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids. ICALP 1988: 176-187
- [c5]
- [c4]Volker Diekert, Axel Möbus: Hotz-Isomorphism Theorems in Formal Language Theory. STACS 1988: 126-135
- 1987
- [c3]
- [c2]Volker Diekert: Some Remarks on Presentations by Finite Church-Rosser Thue Systems. STACS 1987: 272-285
- 1986
- [j2]Volker Diekert: Investigations on Hotz Groups for Arbitrary Grammars. Acta Inf. 22(6): 679-698 (1986)
- [j1]Volker Diekert: Complete Semi-Thue Systems for Abelian Groups. Theor. Comput. Sci. 44: 199-208 (1986)
- 1985
- [c1]Volker Diekert: On Hotz Groups and Homomorphic Images of Sentential Form Languages. STACS 1985: 87-97
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-05 21:24 CEST by the dblp team