Peter Hertling

1.1k total citations
55 papers, 405 citations indexed

About

Peter Hertling is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Artificial Intelligence. According to data from OpenAlex, Peter Hertling has authored 55 papers receiving a total of 405 indexed citations (citations by other indexed papers that have themselves been cited), including 45 papers in Computational Theory and Mathematics, 10 papers in Geometry and Topology and 8 papers in Artificial Intelligence. Recurrent topics in Peter Hertling's work include Computability, Logic, AI Algorithms (36 papers), semigroups and automata theory (14 papers) and Advanced Topology and Set Theory (9 papers). Peter Hertling is often cited by papers focused on Computability, Logic, AI Algorithms (36 papers), semigroups and automata theory (14 papers) and Advanced Topology and Set Theory (9 papers). Peter Hertling collaborates with scholars based in Germany, New Zealand and South Africa. Peter Hertling's co-authors include Vasco Brattka, Klaus Weihrauch, Cristian S. Calude, Yongge Wang, Bakhadyr Khoussainov, Ulrich L. Günther, Radu Nicolescu, Karl Svozil, M.R. Titchener and Victor Selivanov and has published in prestigious journals such as Chaos Solitons & Fractals, Theoretical Computer Science and Mathematische Annalen.

In The Last Decade

Peter Hertling

44 papers receiving 374 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Peter Hertling Germany 14 356 127 99 70 54 55 405
Matthias Schröder Germany 9 275 0.8× 131 1.0× 153 1.5× 98 1.4× 15 0.3× 32 349
L. Lovász United States 3 157 0.4× 37 0.3× 149 1.5× 59 0.8× 49 0.9× 3 312
Michael Krivelevich Israel 12 253 0.7× 45 0.4× 119 1.2× 47 0.7× 52 1.0× 28 374
Jerome Malitz United States 10 182 0.5× 98 0.8× 130 1.3× 65 0.9× 13 0.2× 19 287
Yu. L. Ershov Russia 13 507 1.4× 221 1.7× 258 2.6× 130 1.9× 40 0.7× 113 736
Noboru Endou Japan 10 122 0.3× 55 0.4× 82 0.8× 95 1.4× 56 1.0× 70 290
Werner Gähler Germany 11 186 0.5× 40 0.3× 149 1.5× 75 1.1× 42 0.8× 41 398
Gregory A. Freiman Israel 12 145 0.4× 62 0.5× 143 1.4× 75 1.1× 33 0.6× 51 448
Beloslav Riečan Slovakia 13 317 0.9× 215 1.7× 29 0.3× 78 1.1× 157 2.9× 65 553
Arno Pauly United Kingdom 11 257 0.7× 115 0.9× 95 1.0× 40 0.6× 31 0.6× 48 295

Countries citing papers authored by Peter Hertling

Since Specialization
Citations

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

Fields of papers citing papers by Peter Hertling

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Peter Hertling

This figure shows the co-authorship network connecting the top 25 collaborators of Peter Hertling. A scholar is included among the top collaborators of Peter Hertling 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 Peter Hertling. Peter Hertling 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.
Hertling, Peter, et al.. (2024). REGAININGLY APPROXIMABLE NUMBERS AND SETS. Journal of Symbolic Logic. 90(4). 1664–1694.
2.
Hertling, Peter, et al.. (2015). Effective subsets under homeomorphisms of Rn. Information and Computation. 245. 197–212. 1 indexed citations
3.
Hertling, Peter & Victor Selivanov. (2014). Complexity issues for Preorders on finite labeled forests. 165–190. 1 indexed citations
4.
Hertling, Peter, et al.. (2008). Computability Theoretic Properties of the Entropy of Gap Shifts. Fundamenta Informaticae. 83(1). 141–157. 5 indexed citations
5.
6.
Hertling, Peter. (2006). A sequentially computable function that is not effectively continuous at any point. Journal of Complexity. 22(6). 752–767. 2 indexed citations
7.
Brattka, Vasco, et al.. (2006). Computability and complexity in analysis. Journal of Complexity. 22(6). 728–728. 3 indexed citations
8.
Hertling, Peter. (2004). A Banach–Mazur computable but not Markov computable function on the computable real numbers. Annals of Pure and Applied Logic. 132(2-3). 227–246. 7 indexed citations
9.
Hertling, Peter. (2002). Topological Complexity of Zero Finding with Algebraic Operations. Journal of Complexity. 18(4). 912–942. 1 indexed citations
10.
Brattka, Vasco & Peter Hertling. (2002). Topological properties of real number representations. Theoretical Computer Science. 284(2). 241–257. 25 indexed citations
11.
Hertling, Peter. (2002). A lower bound for range enclosure in interval arithmetic. Theoretical Computer Science. 279(1-2). 83–95. 3 indexed citations
12.
Brattka, Vasco, et al.. (2001). Computability and complexity in analysis : 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000 : selected papers. Springer eBooks. 14 indexed citations
13.
Hertling, Peter. (2001). Nonlinear Lebesgue and Itô Integration Problems of High Complexity. Journal of Complexity. 17(2). 366–387. 9 indexed citations
14.
Calude, Cristian S., Peter Hertling, Bakhadyr Khoussainov, & Yongge Wang. (2001). Recursively enumerable reals and Chaitin Ω numbers. Theoretical Computer Science. 255(1-2). 125–149. 39 indexed citations
15.
Hertling, Peter. (2001). Random sets versus random sequences. 68(9). 668–668.
16.
Hertling, Peter. (1999). An effective Riemann Mapping Theorem. Theoretical Computer Science. 219(1-2). 225–265. 26 indexed citations
17.
Hertling, Peter & Klaus Weihrauch. (1998). Randomness Spaces. International Colloquium on Automata, Languages and Programming. 796–807. 18 indexed citations
18.
Calude, Cristian S., Peter Hertling, & Bakhadyr Khoussainov. (1997). Do the Zeros of Riemann's Zeta-Function Form a Random Sequence?. ResearchSpace (University of Auckland). 62. 1 indexed citations
19.
Hertling, Peter. (1996). Effectivity and Effective Continuity of Functions between Computable Metric Spaces.. Discrete Mathematics & Theoretical Computer Science. 264–275. 5 indexed citations
20.
Hertling, Peter. (1996). Topological Complexity with Continuous Operations. Journal of Complexity. 12(4). 315–338. 21 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

Rankless by CCL
2026