Florian Frohn

450 total citations
9 papers, 54 citations indexed

About

Florian Frohn is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Software. According to data from OpenAlex, Florian Frohn has authored 9 papers receiving a total of 54 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Artificial Intelligence, 7 papers in Computational Theory and Mathematics and 4 papers in Software. Recurrent topics in Florian Frohn's work include Logic, programming, and type systems (8 papers), Formal Methods in Verification (7 papers) and Software Testing and Debugging Techniques (4 papers). Florian Frohn is often cited by papers focused on Logic, programming, and type systems (8 papers), Formal Methods in Verification (7 papers) and Software Testing and Debugging Techniques (4 papers). Florian Frohn collaborates with scholars based in Germany, United Kingdom and Denmark. Florian Frohn's co-authors include Jürgen Giesl, Cornelius Aschermann, Thomas Ströder, Marc Brockschmidt, Carsten Fuhs, Peter Schneider–Kamp, Fabian Emmes, Carsten Otto and René Thiemann and has published in prestigious journals such as Journal of Automated Reasoning, International Journal on Software Tools for Technology Transfer and Journal of Logical and Algebraic Methods in Programming.

In The Last Decade

Florian Frohn

8 papers receiving 52 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Florian Frohn Germany	4	43	36	21	8	5	9	54
Daniel Kühlwein Germany	3	62 1.4×	28 0.8×	10 0.5×	10 1.3×	5 1.0×	10	70
François Bobot France	5	40 0.9×	37 1.0×	19 0.9×	12 1.5×	7 1.4×	7	60
Thomas Ströder Germany	5	66 1.5×	54 1.5×	30 1.4×	14 1.8×	7 1.4×	8	83
Joe Hurd United Kingdom	5	79 1.8×	56 1.6×	16 0.8×	9 1.1×	3 0.6×	13	90
Andrei Paskevich France	5	46 1.1×	33 0.9×	11 0.5×	8 1.0×	12 2.4×	12	58
Yoad Lustig United States	4	32 0.7×	36 1.0×	9 0.4×	7 0.9×	7 1.4×	8	48
Malte Isberner Germany	6	33 0.8×	47 1.3×	59 2.8×	14 1.8×	7 1.4×	10	76
Laurence Rideau France	5	41 1.0×	38 1.1×	8 0.4×	11 1.4×	7 1.4×	10	53
David Nowak France	5	55 1.3×	44 1.2×	7 0.3×	8 1.0×	7 1.4×	11	68
Adam Rogalewicz Czechia	4	22 0.5×	26 0.7×	18 0.9×	6 0.8×	4 0.8×	5	39

Countries citing papers authored by Florian Frohn

Since Specialization

Citations

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

Fields of papers citing papers by Florian Frohn

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Florian Frohn

This figure shows the co-authorship network connecting the top 25 collaborators of Florian Frohn. A scholar is included among the top collaborators of Florian Frohn 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 Florian Frohn. Florian Frohn 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:

9 of 9 papers shown

1.

Frohn, Florian & Carsten Fuhs. (2022). A calculus for modular loop acceleration and non-termination proofs. International Journal on Software Tools for Technology Transfer. 24(5). 691–715. 1 indexed citations

2.

Frohn, Florian, et al.. (2020). Polynomial Loops: Beyond Termination. EPiC series in computing. 73. 279–259. 1 indexed citations

3.

Giesl, Jürgen, et al.. (2018). Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution. Journal of Logical and Algebraic Methods in Programming. 97. 105–130. 1 indexed citations

4.

Frohn, Florian & Jürgen Giesl. (2018). Analyzing Runtime Complexity via Innermost Runtime Complexity. EPiC series in computing. 46. 249–228. 2 indexed citations

5.

Ströder, Thomas, Jürgen Giesl, Marc Brockschmidt, et al.. (2016). Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic. Journal of Automated Reasoning. 58(1). 33–65. 9 indexed citations

6.

Frohn, Florian, et al.. (2016). Lower Bounds for Runtime Complexity of Term Rewriting. Journal of Automated Reasoning. 59(1). 121–163. 3 indexed citations

7.

Giesl, Jürgen, Cornelius Aschermann, Marc Brockschmidt, et al.. (2016). Analyzing Program Termination and Complexity Automatically with AProVE. Journal of Automated Reasoning. 58(1). 3–31. 34 indexed citations

8.

Frohn, Florian, et al.. (2015). Inferring Lower Bounds for Runtime Complexity. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations

9.

Brockschmidt, Marc, et al.. (2014). Automated Termination Analysis for Programs with Pointer Arithmetic.

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