Volker Diekert

2.6k total citations
82 papers, 702 citations indexed

About

Volker Diekert is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Volker Diekert has authored 82 papers receiving a total of 702 indexed citations (citations by other indexed papers that have themselves been cited), including 71 papers in Computational Theory and Mathematics, 45 papers in Artificial Intelligence and 18 papers in Geometry and Topology. Recurrent topics in Volker Diekert's work include semigroups and automata theory (64 papers), Logic, programming, and type systems (23 papers) and Advanced Algebra and Logic (17 papers). Volker Diekert is often cited by papers focused on semigroups and automata theory (64 papers), Logic, programming, and type systems (23 papers) and Advanced Algebra and Logic (17 papers). Volker Diekert collaborates with scholars based in Germany, France and United States. Volker Diekert's co-authors include Grzegorz Rozenberg, Paul Gastin, Antoine Petit, Manfred Kufleitner, Markus Lohrey, Béatrice Bérard, Anca Muscholl, Claudio Gutiérrez, Martin Leucker and Alexei Myasnikov and has published in prestigious journals such as Journal of the ACM, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Volker Diekert

77 papers receiving 659 citations

Peers

Volker Diekert

CTM

CNC

Markus Lohrey Germany

Manfred Droste Germany

Terry A. McKee United States

Hans Zantema Netherlands

Werner Kuich Austria

Jacques Sakarovitch France

Kevin J. Compton United States

James Worrell United Kingdom

Paliath Narendran United States

Howard Straubing United States

Markus Lohrey Germany

Volker Diekert

444 ×0.7

CTM

391 ×1.1

146 ×1.1

99 ×1.4

CNC

80 ×1.3

Citations per year, relative to Volker Diekert Volker Diekert (= 1×) peers Markus Lohrey

Countries citing papers authored by Volker Diekert

Since Specialization

Citations

This map shows the geographic impact of Volker Diekert's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Volker Diekert with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Volker Diekert more than expected).

Fields of papers citing papers by Volker Diekert

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Volker Diekert. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Volker Diekert. The network helps show where Volker Diekert may publish in the future.

Co-authorship network of co-authors of Volker Diekert

This figure shows the co-authorship network connecting the top 25 collaborators of Volker Diekert. A scholar is included among the top collaborators of Volker Diekert based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Volker Diekert. Volker Diekert is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Diekert, Volker & Murray Elder. (2017). Solutions of twisted word equations, EDT0L languages, and context-free groups. UTS ePRESS (University of Technology Sydney). 1 indexed citations

Diekert, Volker, Artur Jeż, & Manfred Kufleitner. (2016). Solutions of word equations over partially commutative structures. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 14. 3 indexed citations

Diekert, Volker, et al.. (2015). Logspace computations in graph products. Journal of Symbolic Computation. 75. 94–109. 1 indexed citations

Diekert, Volker, et al.. (2012). Deciding regularity of hairpin completions of regular languages in polynomial time. Information and Computation. 217. 12–30. 2 indexed citations

Diekert, Volker & Manfred Kufleitner. (2009). Fragments of First-Order Logic over Infinite Words (Extended Abstract). INRIA a CCSD electronic archive server. 325–336. 1 indexed citations

Diekert, Volker, Martin Horsch, & Manfred Kufleitner. (2007). On First-Order Fragments for Mazurkiewicz Traces. Fundamenta Informaticae. 80(1). 1–29. 8 indexed citations

Diekert, Volker & Bruno Durand. (2005). STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005 : proceedings. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 1 indexed citations

Diekert, Volker, et al.. (2005). The existential theory of equations with rational constraints in free groups is PSPACE-complete. Information and Computation. 202(2). 105–140. 25 indexed citations

Diekert, Volker. (2004). A Pure Future Local Temporal Logic Beyond Cograph-Monoids (Algebraic Systems, Formal Languages and Conventional and Unconventional Computation Theory). Kyoto University Research Information Repository (Kyoto University). 1366. 34–43. 2 indexed citations

10.

Diekert, Volker & Paul Gastin. (2002). LTL Is Expressively Complete for Mazurkiewicz Traces. Journal of Computer and System Sciences. 64(2). 396–418. 9 indexed citations

11.

Diekert, Volker, et al.. (2000). Regular Frequency Computations (Algebraic Systems, Formal Languages and Computations). Kyoto University Research Information Repository (Kyoto University). 1166. 35–42.

12.

Diekert, Volker, Paul Gastin, & Antoine Petit. (1997). Removing epsilon-Transitions in Timed Automata. 583–594. 11 indexed citations

13.

Diekert, Volker & Paul Gastin. (1995). A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract). International Colloquium on Automata, Languages and Programming. 15–26. 1 indexed citations

14.

Diekert, Volker, Paul Gastin, & Antoine Petit. (1995). Rational and Recognizable Complex Trace Languages. Information and Computation. 116(1). 134–153. 5 indexed citations

15.

Diekert, Volker. (1994). A partial trace semantics for Petri nets. Theoretical Computer Science. 134(1). 87–105. 3 indexed citations

16.

Diekert, Volker. (1993). On the concatenation of infinite traces. Theoretical Computer Science. 113(1). 35–54. 10 indexed citations

17.

Diekert, Volker, Paul Gastin, & Antoine Petit. (1991). Recognizable Complex Trace Languages.. 131–140. 4 indexed citations

18.

Diekert, Volker. (1991). On the concatenation of infinite traces (extended abstract). 105–117. 3 indexed citations

19.

Diekert, Volker. (1990). Word problems over traces which are solvable in linear time. Theoretical Computer Science. 74(1). 3–19. 3 indexed citations

20.

Diekert, Volker. (1986). Commutative monoids have complete presentations by free (non-commutative) monoids. Theoretical Computer Science. 46. 319–327. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact