Daniel Reidenbach

424 total citations
23 papers, 119 citations indexed

About

Daniel Reidenbach is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Daniel Reidenbach has authored 23 papers receiving a total of 119 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computational Theory and Mathematics, 18 papers in Artificial Intelligence and 7 papers in Molecular Biology. Recurrent topics in Daniel Reidenbach's work include semigroups and automata theory (22 papers), Machine Learning and Algorithms (15 papers) and Algorithms and Data Compression (13 papers). Daniel Reidenbach is often cited by papers focused on semigroups and automata theory (22 papers), Machine Learning and Algorithms (15 papers) and Algorithms and Data Compression (13 papers). Daniel Reidenbach collaborates with scholars based in United Kingdom, Germany and Canada. Daniel Reidenbach's co-authors include Markus L. Schmid, Robert Mercaş and Jeffrey Shallit and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Daniel Reidenbach

16 papers receiving 114 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Daniel Reidenbach United Kingdom 7 114 112 9 5 3 23 119
Aleksandrs Belovs Latvia 6 99 0.9× 81 0.7× 5 0.6× 8 1.6× 2 0.7× 17 109
Manfred Kufleitner Germany 6 75 0.7× 84 0.8× 12 1.3× 4 0.8× 1 0.3× 30 98
Olivier Serre France 6 118 1.0× 122 1.1× 5 0.6× 5 1.0× 5 1.7× 18 136
Sylvain Lombardy France 8 100 0.9× 130 1.2× 24 2.7× 8 1.6× 2 0.7× 14 141
David Janin France 5 51 0.4× 65 0.6× 5 0.6× 7 1.4× 2 0.7× 14 73
Elaine Pimentel Brazil 6 109 1.0× 91 0.8× 3 0.3× 8 1.6× 7 2.3× 28 115
Joost J. Joosten Spain 7 97 0.9× 81 0.7× 4 0.4× 3 0.6× 1 0.3× 33 133
Stefan Hetzl Austria 6 101 0.9× 92 0.8× 3 0.3× 6 1.2× 1 0.3× 27 101
Sylvain Schmitz France 7 50 0.4× 55 0.5× 11 1.2× 8 1.6× 2 0.7× 17 74
Magnus Steinby Finland 7 86 0.8× 99 0.9× 18 2.0× 3 0.6× 1 0.3× 22 116

Countries citing papers authored by Daniel Reidenbach

Since Specialization
Citations

This map shows the geographic impact of Daniel Reidenbach'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 Daniel Reidenbach with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel Reidenbach more than expected).

Fields of papers citing papers by Daniel Reidenbach

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Daniel Reidenbach. 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 Daniel Reidenbach. The network helps show where Daniel Reidenbach may publish in the future.

Co-authorship network of co-authors of Daniel Reidenbach

This figure shows the co-authorship network connecting the top 25 collaborators of Daniel Reidenbach. A scholar is included among the top collaborators of Daniel Reidenbach 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 Daniel Reidenbach. Daniel Reidenbach is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Reidenbach, Daniel, et al.. (2022). On Billaud words and their companions. Theoretical Computer Science. 940. 231–253.
2.
Mercaş, Robert, et al.. (2021). Reducing the ambiguity of Parikh matrices. Theoretical Computer Science. 860. 23–40. 2 indexed citations
3.
Reidenbach, Daniel, et al.. (2019). Unique decipherability in formal languages. Theoretical Computer Science. 804. 149–160.
4.
Reidenbach, Daniel, et al.. (2016). Closure properties of pattern languages. Journal of Computer and System Sciences. 84. 11–31.
5.
Reidenbach, Daniel, et al.. (2015). Periodicity forcing words. Theoretical Computer Science. 601. 2–14. 1 indexed citations
6.
Reidenbach, Daniel & Markus L. Schmid. (2014). Patterns with bounded treewidth. Information and Computation. 239. 87–99. 8 indexed citations
7.
Reidenbach, Daniel & Markus L. Schmid. (2013). Regular and context-free pattern languages over small alphabets. Theoretical Computer Science. 518. 80–95. 2 indexed citations
8.
Reidenbach, Daniel, et al.. (2012). Weakly unambiguous morphisms. Theoretical Computer Science. 448. 21–40.
9.
Reidenbach, Daniel, et al.. (2012). Inferring descriptive generalisations of formal languages. Journal of Computer and System Sciences. 79(5). 622–639. 1 indexed citations
10.
Reidenbach, Daniel & Markus L. Schmid. (2012). Finding shuffle words that represent optimal scheduling of shared memory access. International Journal of Computer Mathematics. 90(6). 1292–1309.
11.
Reidenbach, Daniel, et al.. (2011). Restricted ambiguity of erasing morphisms. Theoretical Computer Science. 412(29). 3510–3523. 4 indexed citations
12.
Reidenbach, Daniel, et al.. (2010). Existence and nonexistence of descriptive patterns. Theoretical Computer Science. 411(34-36). 3274–3286. 4 indexed citations
13.
Reidenbach, Daniel, et al.. (2009). Morphically primitive words. Theoretical Computer Science. 410(21-23). 2148–2161. 11 indexed citations
14.
Reidenbach, Daniel, et al.. (2009). Bad news on decision problems for patterns. Information and Computation. 208(1). 83–96. 16 indexed citations
15.
Reidenbach, Daniel, et al.. (2009). The unambiguity of segmented morphisms. Discrete Applied Mathematics. 157(14). 3055–3068. 4 indexed citations
16.
Reidenbach, Daniel. (2008). Discontinuities in pattern inference. Theoretical Computer Science. 397(1-3). 166–193. 18 indexed citations
17.
Reidenbach, Daniel. (2007). An Examination of Ohlebusch and Ukkonen's Conjecture on the Equivalence Problem for E-Pattern Languages. Journal of automata, languages and combinatorics. 12(3). 407–426. 4 indexed citations
18.
Reidenbach, Daniel, et al.. (2006). UNAMBIGUOUS MORPHIC IMAGES OF STRINGS. International Journal of Foundations of Computer Science. 17(3). 601–628. 13 indexed citations
19.
Reidenbach, Daniel. (2005). A non-learnable class of E-pattern languages. Theoretical Computer Science. 350(1). 91–102. 21 indexed citations
20.
Reidenbach, Daniel. (2004). On the equivalence problem for E-pattern languages over small alphabets. Loughborough University Institutional Repository (Loughborough University).

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

Breakdown of academic impact, for papers by Aleksandrs Belovs Breakdown of academic impact, for papers by Manfred Kufleitner Breakdown of academic impact, for papers by Olivier Serre Breakdown of academic impact, for papers by Sylvain Lombardy Breakdown of academic impact, for papers by David Janin Breakdown of academic impact, for papers by Elaine Pimentel Breakdown of academic impact, for papers by Joost J. Joosten Breakdown of academic impact, for papers by Stefan Hetzl Breakdown of academic impact, for papers by Sylvain Schmitz Breakdown of academic impact, for papers by Magnus Steinby
Rankless by CCL
2026