The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Volker Diekert: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael Bertol, Volker Diekert
    On Efficient Reduction Algorithms for Some Trace Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Term Rewriting, 1993, pp:114-126 [Conf]
  2. Volker Diekert
    A Remark on Trace Equations. [Citation Graph (0, 0)][DBLP]
    Foundations of Computer Science: Potential - Theory - Cognition, 1997, pp:251-260 [Conf]
  3. Volker Diekert, Paul Gastin
    Safety and Liveness Properties for Real Traces and a Direct Translation from LTL to Monoids. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:26-38 [Conf]
  4. Volker Diekert, John Michael Robson
    Quadratic Word Equations. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:314-326 [Conf]
  5. Volker Diekert, Paul Gastin
    An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:188-203 [Conf]
  6. Volker Diekert, Paul Gastin, Antoine Petit
    Recent Developments in Trace Theory. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:373-385 [Conf]
  7. Volker Diekert, Manfred Kufleitner
    A Remark about Quadratic Trace Equations. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:59-66 [Conf]
  8. Volker Diekert
    Rewriting, Möbius Functions and Semi-Commutations. [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:1-15 [Conf]
  9. Volker Diekert, Markus Lohrey
    Word Equations over Graph Products. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:156-167 [Conf]
  10. Volker Diekert
    On the Knuth-Bendix Completion for Concurrent Processes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:42-53 [Conf]
  11. Volker Diekert
    Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:176-187 [Conf]
  12. Volker Diekert, Paul Gastin
    LTL Is Expressively Complete for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:211-222 [Conf]
  13. Volker Diekert, Paul Gastin
    A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:15-26 [Conf]
  14. Volker Diekert, Anca Muscholl
    Solvability of Equations in Free Partially Commutative Groups Is Decidable. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:543-554 [Conf]
  15. Volker Diekert, Yuri Matiyasevich, Anca Muscholl
    Solving Trace Equations Using Lexicographical Normal Forms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:336-346 [Conf]
  16. Volker Diekert, Edward Ochmanski, Klaus Reinhardt
    On Confluent Semi-Commutations - Decidability and Complexity Results. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:229-241 [Conf]
  17. Volker Diekert, Paul Gastin
    Pure Future Local Temporal Logics Are Expressively Complete for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:232-241 [Conf]
  18. Volker Diekert, Paul Gastin
    Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:55-69 [Conf]
  19. Volker Diekert, Anca Muscholl
    Code Problems on Traces. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:2-17 [Conf]
  20. Volker Diekert, Walter Vogler
    Local Checking of Trace Synchroniziability. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:271-279 [Conf]
  21. Volker Diekert
    Complex and Complex-Like Traces. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:68-82 [Conf]
  22. Volker Diekert, Paul Gastin, Antoine Petit
    Recognizable Complex Trace Languages. [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:131-140 [Conf]
  23. Volker Diekert, Markus Lohrey, Alexander Miller
    Partially Commutative Inverse Monoids. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:292-304 [Conf]
  24. Celia Wrathall, Volker Diekert, Friedrich Otto
    One-Rule Trace-Rewriting Systems and Confluence. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:511-521 [Conf]
  25. Michael Bertol, Volker Diekert
    Trace Rewriting: Computing Normal Forms in Time O(n log n). [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:269-280 [Conf]
  26. Volker Diekert
    On Hotz Groups and Homomorphic Images of Sentential Form Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:87-97 [Conf]
  27. Volker Diekert
    Some Remarks on Presentations by Finite Church-Rosser Thue Systems. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:272-285 [Conf]
  28. Volker Diekert
    Word Problems over TRaces Which are Solvable in Linear Time. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:168-180 [Conf]
  29. Volker Diekert
    Combinatorial Rewriting on Traces. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:138-151 [Conf]
  30. Volker Diekert
    On the Concatenation of Infinite Traces. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:105-117 [Conf]
  31. Volker Diekert, Claudio Gutiérrez, Christian Hagenah
    The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:170-182 [Conf]
  32. Volker Diekert, Paul Gastin, Antoine Petit
    Removing epsilon-Transitions in Timed Automata. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:583-594 [Conf]
  33. Volker Diekert, Markus Lohrey
    Existential and Positive Theories of Equations in Graph Products. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:501-512 [Conf]
  34. Volker Diekert, Axel Möbus
    Hotz-Isomorphism Theorems in Formal Language Theory. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:126-135 [Conf]
  35. Volker Diekert, Anca Muscholl
    Deterministic Asynchronous Automata for Infinite Traces. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:617-628 [Conf]
  36. Volker Diekert, Anca Muscholl, Klaus Reinhardt
    On Codings of Traces. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:385-396 [Conf]
  37. John Michael Robson, Volker Diekert
    On Quadratic Word Equations. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:217-226 [Conf]
  38. Volker Diekert
    Investigations on Hotz Groups for Arbitrary Grammars. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1986, v:22, n:6, pp:679-698 [Journal]
  39. Volker Diekert, Paul Gastin
    Approximating Traces. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:7, pp:567-593 [Journal]
  40. Volker Diekert, Anca Muscholl
    Deterministic Asynchronous Automata for Infinite Traces. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1994, v:31, n:4, pp:379-397 [Journal]
  41. Volker Diekert, Claudio Gutiérrez, Christian Hagenah
    The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  42. Béatrice Bérard, Antoine Petit, Volker Diekert, Paul Gastin
    Characterization of the Expressive Power of Silent Transitions in Timed Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1998, v:36, n:2-3, pp:145-182 [Journal]
  43. Volker Diekert, Anca Muscholl
    A Note on Métivier's Construction of Asynchronous Automata for Triangulated Graphs. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:25, n:3, pp:241-246 [Journal]
  44. Volker Diekert, Paul Gastin
    Local temporal logic is expressively complete for cograph dependence alphabets. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:195, n:1-2, pp:30-52 [Journal]
  45. Volker Diekert, Claudio Gutiérrez, Christian Hagenah
    The existential theory of equations with rational constraints in free groups is PSPACE-complete. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:202, n:2, pp:105-140 [Journal]
  46. Volker Diekert, Paul Gastin, Antoine Petit
    Rational and Recognizable Complex Trace Languages [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:116, n:1, pp:134-153 [Journal]
  47. Volker Diekert, Edward Ochmanski, Klaus Reinhardt
    On Confluent Semi-commutations: Decidability and Complexity Results [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:110, n:1, pp:164-182 [Journal]
  48. Volker Diekert, Paul Gastin
    Pure future local temporal logics are expressively complete for Mazurkiewicz traces. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:11, pp:1597-1619 [Journal]
  49. Volker Diekert, Markus Lohrey
    A Note on The Existential Theory of Equations in Plain Groups. [Citation Graph (0, 0)][DBLP]
    IJAC, 2002, v:12, n:1-2, pp:1-7 [Journal]
  50. Volker Diekert, Anca Muscholl
    Solvability of Equations in Graph Groups Is Decidable. [Citation Graph (0, 0)][DBLP]
    IJAC, 2006, v:16, n:6, pp:1047-1070 [Journal]
  51. Volker Diekert, Ronald V. Book
    On ``Inherently Context-Sensitive'' Languages - An Application of Complexity Cores. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:40, n:1, pp:21-23 [Journal]
  52. Volker Diekert, Axel Möbus
    Hotz-Isomorphism Theorems In Formal Language Theory. [Citation Graph (0, 0)][DBLP]
    ITA, 1989, v:23, n:1, pp:29-43 [Journal]
  53. Volker Diekert, Paul Gastin
    LTL Is Expressively Complete for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:64, n:2, pp:396-418 [Journal]
  54. Volker Diekert, Michel Habib
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:1, pp:1- [Journal]
  55. Volker Diekert, Markus Lohrey
    Existential and Positive Theories of Equations in Graph Products. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:1, pp:133-156 [Journal]
  56. Volker Diekert, Walter Vogler
    On the Synchronization of Traces. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1989, v:22, n:3, pp:161-175 [Journal]
  57. Celia Wrathall, Volker Diekert
    On Confluence of One-Rule Trace-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1995, v:28, n:4, pp:341-361 [Journal]
  58. Holger Austinat, Volker Diekert, Ulrich Hertrampf
    A structural property of regular frequency computations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:33-43 [Journal]
  59. Holger Austinat, Volker Diekert, Ulrich Hertrampf, Holger Petersen
    Regular frequency computations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:1, pp:15-21 [Journal]
  60. Volker Diekert
    Complete Semi-Thue Systems for Abelian Groups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:44, n:, pp:199-208 [Journal]
  61. Volker Diekert
    On the Knuth-Bendix Completion for Concurrent Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:66, n:2, pp:117-136 [Journal]
  62. Volker Diekert
    Word Problems Over Traces which are Solvable in Linear Time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:74, n:1, pp:3-18 [Journal]
  63. Volker Diekert
    Möbius Functions and Confluent Semi-Commutations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:108, n:1, pp:25-43 [Journal]
  64. Volker Diekert
    On the Concentration of Infinite Traces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:113, n:1, pp:35-54 [Journal]
  65. Volker Diekert
    A Partial Trace Semantics for Petri Nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:134, n:1, pp:87-105 [Journal]
  66. Volker Diekert, Paul Gastin
    From local to global temporal logics over Mazurkiewicz traces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:356, n:1-2, pp:126-135 [Journal]
  67. Volker Diekert, Yuri Matiyasevich, Anca Muscholl
    Solving Word Equations modulo Partial Commutations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:224, n:1-2, pp:215-235 [Journal]
  68. Volker Diekert, Manfred Kufleitner
    On First-Order Fragments for Words and Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2007, pp:1-19 [Conf]
  69. Volker Diekert, Bruno Durand
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:4, pp:301- [Journal]

  70. On the Hairpin Completion of Regular Languages. [Citation Graph (, )][DBLP]


  71. Fragments of First-Order Logic over Infinite Words. [Citation Graph (, )][DBLP]


  72. Fragments of first-order logic over infinite words [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002