Volker Diekert
-
- semigroups and automata theory 64
- Advanced Algebra and Logic 17
- Computability, Logic, AI Algorithms 11
- Geometry and Topology top 5%
- Geometric and Algebraic Topology 17
- Software top 10%
- Artificial Intelligence top 5%
- Logic, programming, and type systems 23
- Algorithms and Data Compression 14
- Natural Language Processing Techniques 10
-
- DNA and Biological Computing 14
- Co-authors
- Grzegorz RozenbergPaul GastinAntoine PetitManfred KufleitnerMarkus LohreyBéatrice BérardAnca MuschollClaudio Gutiérrez
- Cited by
- Computational Theory and MathematicsGeometry and TopologyDiscrete Mathematics and Combinatorics
- Journals
- Journal of the ACM (1 paper)Theoretical Computer Science (17 papers)Journal of Computer and System Sciences (1 paper)
- Partner nations
- GermanyFranceUnited States
In The Last Decade
Volker Diekert
77 papers receiving 659 citations
Peers
Comparison fields: 5 of 34
- Computational Theory and Mathematics 596
- Geometry and Topology 135
- Discrete Mathematics and Combinatorics 49
- Software 51
- Artificial Intelligence 372
Countries citing papers authored by Volker Diekert
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
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
The 25 scholars most cited alongside Volker Diekert, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | Solutions of twisted word equations, EDT0L languages, and context-free groups | 2017 | 1 |
| 2 | 2016 | 3 | |
| 3 | 2015 | 1 | |
| 4 | 2012 | 2 | |
| 5 | Fragments of First-Order Logic over Infinite Words (Extended Abstract) | 2009 | 1 |
| 6 | On First-Order Fragments for Mazurkiewicz Traces | 2007 | 8 |
| 7 | 2005 | 1 | |
| 8 | 2005 | 25 | |
| 9 | A Pure Future Local Temporal Logic Beyond Cograph-Monoids (Algebraic Systems, Formal Languages and Conventional and Unconventional Computation Theory) | 2004 | 2 |
| 10 | 2002 | 9 | |
| 11 | Regular Frequency Computations (Algebraic Systems, Formal Languages and Computations) | 2000 | 0 |
| 12 | Removing epsilon-Transitions in Timed Automata | 1997 | 11 |
| 13 | A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract) | 1995 | 1 |
| 14 | 1995 | 5 | |
| 15 | 1994 | 3 | |
| 16 | 1993 | 10 | |
| 17 | Recognizable Complex Trace Languages. | 1991 | 4 |
| 18 | On the concatenation of infinite traces (extended abstract) | 1991 | 3 |
| 19 | 1990 | 3 | |
| 20 | 1986 | 4 |
About Volker Diekert
Volker Diekert is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology, having authored 82 papers that have together received 702 indexed citations. Recurring topics across this work include semigroups and automata theory (64 papers), Logic, programming, and type systems (23 papers), Advanced Algebra and Logic (17 papers), Geometric and Algebraic Topology (17 papers), DNA and Biological Computing (14 papers), Algorithms and Data Compression (14 papers), Computability, Logic, AI Algorithms (11 papers) and Natural Language Processing Techniques (10 papers). The work is most often cited by research in Computational Theory and Mathematics (596 citations), Geometry and Topology (135 citations) and Discrete Mathematics and Combinatorics (49 citations). Volker Diekert has collaborated with scholars based in Germany, France and United States. Frequent 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. Their work appears in journals such as Journal of the ACM, Theoretical Computer Science and Journal of Computer and System Sciences.
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.