Emil Jeřábek

825 total citations
34 papers, 365 citations indexed

About

Emil Jeřábek is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Mathematical Physics. According to data from OpenAlex, Emil Jeřábek has authored 34 papers receiving a total of 365 indexed citations (citations by other indexed papers that have themselves been cited), including 34 papers in Computational Theory and Mathematics, 21 papers in Artificial Intelligence and 4 papers in Mathematical Physics. Recurrent topics in Emil Jeřábek's work include Logic, Reasoning, and Knowledge (16 papers), Advanced Algebra and Logic (16 papers) and Computability, Logic, AI Algorithms (15 papers). Emil Jeřábek is often cited by papers focused on Logic, Reasoning, and Knowledge (16 papers), Advanced Algebra and Logic (16 papers) and Computability, Logic, AI Algorithms (15 papers). Emil Jeřábek collaborates with scholars based in Czechia, Bulgaria and Canada. Emil Jeřábek's co-authors include Phuong Nguyen, Clemens Kupke, Tomáš Kepka and Daniel Hole and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Lecture notes in computer science.

In The Last Decade

Emil Jeřábek

31 papers receiving 346 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Emil Jeřábek Czechia 13 325 298 19 11 7 34 365
Juan Luis Esteban Spain 9 214 0.7× 190 0.6× 35 1.8× 5 0.5× 5 0.7× 14 258
Stephen J. Bellantoni Canada 8 299 0.9× 265 0.9× 52 2.7× 3 0.3× 9 1.3× 12 337
Neil Thapen Czechia 8 153 0.5× 116 0.4× 14 0.7× 5 0.5× 3 0.4× 38 174
Nathan Segerlind United States 8 220 0.7× 187 0.6× 42 2.2× 2 0.2× 9 1.3× 19 242
Andrew Drucker United States 8 179 0.6× 127 0.4× 61 3.2× 6 0.5× 11 1.6× 19 216
Srikanth Srinivasan India 9 165 0.5× 111 0.4× 12 0.6× 15 1.4× 17 2.4× 52 189
Pritish Kamath United States 7 124 0.4× 111 0.4× 16 0.8× 4 0.4× 12 1.7× 21 168
Ulrich Hertrampf Germany 7 189 0.6× 118 0.4× 20 1.1× 4 0.4× 12 1.7× 17 203
David Fernández–Duque Spain 8 104 0.3× 168 0.6× 15 0.8× 2 0.2× 4 0.6× 43 187
Nicola Galesi Italy 10 318 1.0× 212 0.7× 49 2.6× 6 0.5× 12 1.7× 36 349

Countries citing papers authored by Emil Jeřábek

Since Specialization
Citations

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

Fields of papers citing papers by Emil Jeřábek

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Emil Jeřábek. 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 Emil Jeřábek. The network helps show where Emil Jeřábek may publish in the future.

Co-authorship network of co-authors of Emil Jeřábek

This figure shows the co-authorship network connecting the top 25 collaborators of Emil Jeřábek. A scholar is included among the top collaborators of Emil Jeřábek 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 Emil Jeřábek. Emil Jeřábek 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.
Jeřábek, Emil. (2023). Elementary analytic functions in VTC0. Annals of Pure and Applied Logic. 174(6). 103269–103269.
2.
Jeřábek, Emil. (2019). Rigid models of Presburger arithmetic. Mathematical logic quarterly. 65(1). 108–115.
3.
Jeřábek, Emil. (2016). Proof complexity of intuitionistic implicational formulas. Annals of Pure and Applied Logic. 168(1). 150–190. 2 indexed citations
4.
Jeřábek, Emil. (2015). Integer factoring and modular square roots. Journal of Computer and System Sciences. 82(2). 380–394. 13 indexed citations
5.
Jeřábek, Emil. (2015). Rules with parameters in modal logic I. Annals of Pure and Applied Logic. 166(9). 881–933. 3 indexed citations
6.
Jeřábek, Emil. (2012). Root finding with threshold circuits. Theoretical Computer Science. 462. 59–69. 3 indexed citations
7.
Jeřábek, Emil, et al.. (2012). Real closures of models of weak arithmetic. Archive for Mathematical Logic. 52(1-2). 143–157. 1 indexed citations
8.
Jeřábek, Emil & Phuong Nguyen. (2011). Simulating non-prenex cuts in quantified propositional calculus. Mathematical logic quarterly. 57(5). 524–532. 3 indexed citations
9.
Jeřábek, Emil. (2010). On theories of bounded arithmetic forNC1. Annals of Pure and Applied Logic. 162(4). 322–340. 3 indexed citations
10.
Jeřábek, Emil. (2010). A sorting network in bounded arithmetic. Annals of Pure and Applied Logic. 162(4). 341–355. 3 indexed citations
11.
Jeřábek, Emil. (2010). Admissible Rules of Lukasiewicz Logic. Journal of Logic and Computation. 20(2). 425–447. 30 indexed citations
12.
Jeřábek, Emil. (2009). Approximate counting by hashing in bounded arithmetic. Journal of Symbolic Logic. 74(3). 829–860. 21 indexed citations
13.
Jeřábek, Emil. (2009). Canonical rules. Journal of Symbolic Logic. 74(4). 1171–1205. 15 indexed citations
14.
Jeřábek, Emil. (2008). Substitution Frege and extended Frege proof systems in non-classical logics. Annals of Pure and Applied Logic. 159(1-2). 1–48. 6 indexed citations
15.
Jeřábek, Emil. (2008). Proof Complexity of the Cut-free Calculus of Structures. Journal of Logic and Computation. 19(2). 323–339. 8 indexed citations
16.
Jeřábek, Emil. (2008). Independent Bases of Admissible Rules. Logic Journal of IGPL. 16(3). 249–267. 25 indexed citations
17.
Jeřábek, Emil. (2007). Approximate counting in bounded arithmetic. Journal of Symbolic Logic. 72(3). 959–993. 21 indexed citations
18.
Jeřábek, Emil. (2006). Frege systems for extensible modal logics. Annals of Pure and Applied Logic. 142(1-3). 366–379. 10 indexed citations
19.
Jeřábek, Emil. (2005). Weak Pigeonhole Principle, and Randomized Computation. 10 indexed citations
20.
Jeřábek, Emil. (2004). Dual weak pigeonhole principle, Boolean complexity, and derandomization. Annals of Pure and Applied Logic. 129(1-3). 1–37. 41 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

Breakdown of academic impact, for papers by Juan Luis Esteban Breakdown of academic impact, for papers by Stephen J. Bellantoni Breakdown of academic impact, for papers by Neil Thapen Breakdown of academic impact, for papers by Nathan Segerlind Breakdown of academic impact, for papers by Andrew Drucker Breakdown of academic impact, for papers by Srikanth Srinivasan Breakdown of academic impact, for papers by Pritish Kamath Breakdown of academic impact, for papers by Ulrich Hertrampf Breakdown of academic impact, for papers by David Fernández–Duque Breakdown of academic impact, for papers by Nicola Galesi
Rankless by CCL
2026