Jan Johannsen

561 total citations
21 papers, 185 citations indexed

About

Jan Johannsen is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Jan Johannsen has authored 21 papers receiving a total of 185 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Computational Theory and Mathematics, 12 papers in Artificial Intelligence and 4 papers in Geometry and Topology. Recurrent topics in Jan Johannsen's work include Logic, programming, and type systems (9 papers), semigroups and automata theory (7 papers) and Formal Methods in Verification (7 papers). Jan Johannsen is often cited by papers focused on Logic, programming, and type systems (9 papers), semigroups and automata theory (7 papers) and Formal Methods in Verification (7 papers). Jan Johannsen collaborates with scholars based in Germany, United States and Spain. Jan Johannsen's co-authors include Marı́a Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Michael Alekhnovich, Toniann Pitassi, Alasdair Urquhart, Klaus Aehlig, Sam Buss, Seamus Ross and Arnold Beckmann and has published in prestigious journals such as SIAM Journal on Computing, Journal of Artificial Intelligence Research and Journal of Automated Reasoning.

In The Last Decade

Jan Johannsen

20 papers receiving 161 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Jan Johannsen Germany	8	155	135	33	11	9	21	185
Grigori Mint︠s︡ United States	9	194 1.3×	250 1.9×	29 0.9×	7 0.6×	6 0.7×	30	283
Michał Walicki Norway	8	77 0.5×	111 0.8×	10 0.3×	5 0.5×	13 1.4×	35	145
Christian G. Fermüller Austria	11	225 1.5×	274 2.0×	41 1.2×	3 0.3×	14 1.6×	29	322
Gianluigi Bellin Italy	9	201 1.3×	287 2.1×	29 0.9×	7 0.6×	17 1.9×	19	302
Massimiliano Goldwurm Italy	6	119 0.8×	88 0.7×	16 0.5×	19 1.7×	2 0.2×	24	163
Fairouz Kamareddine United Kingdom	10	167 1.1×	246 1.8×	28 0.8×	5 0.5×	5 0.6×	48	260
W. Thomas Germany	5	86 0.6×	76 0.6×	6 0.2×	9 0.8×	15 1.7×	13	149
Valentin Shehtman Russia	8	105 0.7×	175 1.3×	42 1.3×	7 0.6×	3 0.3×	28	200
R. A. Bull United Kingdom	13	351 2.3×	456 3.4×	33 1.0×	11 1.0×	18 2.0×	29	511
Assia Mahboubi France	5	98 0.6×	110 0.8×	22 0.7×	7 0.6×	1 0.1×	14	146

Countries citing papers authored by Jan Johannsen

Since Specialization

Citations

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

Fields of papers citing papers by Jan Johannsen

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Jan Johannsen

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

Buss, Sam & Jan Johannsen. (2017). On Linear Resolution. 10(1). 23–35.

Bonet, Marı́a Luisa, Sam Buss, & Jan Johannsen. (2014). Improved Separations of Regular Resolution from Clause Learning Proof Systems. Journal of Artificial Intelligence Research. 49. 669–703. 5 indexed citations

Johannsen, Jan. (2013). Exponential Incomparability of Tree-like and Ordered Resolution. 2 indexed citations

Alekhnovich, Michael, Jan Johannsen, Toniann Pitassi, & Alasdair Urquhart. (2007). . Theory of Computing. 3(1). 81–102. 22 indexed citations

Johannsen, Jan, et al.. (2006). Bounded Model Checking for All Regular Properties. Electronic Notes in Theoretical Computer Science. 144(1). 3–18. 3 indexed citations

Johannsen, Jan. (2005). The Complexity of Pure Literal Elimination. Journal of Automated Reasoning. 35(1-3). 89–95. 4 indexed citations

Johannsen, Jan, et al.. (2005). A speech spectrogram expert. 8. 746–749. 7 indexed citations

Beckmann, Arnold & Jan Johannsen. (2005). An unexpected separation result in Linearly Bounded Arithmetic. Mathematical logic quarterly. 51(2). 191–200. 1 indexed citations

Aehlig, Klaus & Jan Johannsen. (2005). An elementary fragment of second-order lambda calculus. ACM Transactions on Computational Logic. 6(2). 468–480. 3 indexed citations

10.

Johannsen, Jan. (2003). Weak bounded arithmetic, the Diffie-Hellman problem and Constable's Class K. 960. 268–274. 1 indexed citations

11.

Alekhnovich, Michael, Jan Johannsen, Toniann Pitassi, & Alasdair Urquhart. (2002). An exponential separation between regular and general resolution. 6 indexed citations

12.

Johannsen, Jan, et al.. (2002). On proofs about threshold circuits and counting hierarchies. 444–452. 8 indexed citations

13.

Bonet, Marı́a Luisa, Juan Luis Esteban, Nicola Galesi, & Jan Johannsen. (2002). Exponential separations between restricted resolution and cutting planes proof systems. IRIS Research product catalog (Sapienza University of Rome). 638–647. 15 indexed citations

14.

Alekhnovich, Michael, Jan Johannsen, Toniann Pitassi, & Alasdair Urquhart. (2002). An exponential separation between regular and general resolution. 448–456. 22 indexed citations

15.

Johannsen, Jan. (2001). Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits. RAIRO - Theoretical Informatics and Applications. 35(3). 277–286. 7 indexed citations

16.

Johannsen, Jan, et al.. (2000). Cumulative Higher-Order Logic as a Foundation for Set Theory. Mathematical logic quarterly. 46(2). 147–170. 8 indexed citations

17.

Bonet, Marı́a Luisa, Juan Luis Esteban, Nicola Galesi, & Jan Johannsen. (2000). On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems. SIAM Journal on Computing. 30(5). 1462–1484. 53 indexed citations

18.

Johannsen, Jan. (1998). A Remark on Independence Results for Sharply Bounded Arithmetic. Mathematical logic quarterly. 44(4). 568–570. 2 indexed citations

19.

Johannsen, Jan. (1998). A Model‐Theoretic Property of Sharply Bounded Formulae, with some Applications. Mathematical logic quarterly. 44(2). 205–215. 5 indexed citations

20.

Johannsen, Jan. (1994). A note on sharply bounded arithmetic. Archive for Mathematical Logic. 33(2). 159–165. 3 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