Neil Thapen

607 total citations
38 papers, 174 citations indexed

About

Neil Thapen is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Neil Thapen has authored 38 papers receiving a total of 174 indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Computational Theory and Mathematics, 22 papers in Artificial Intelligence and 5 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Neil Thapen's work include Complexity and Algorithms in Graphs (19 papers), Logic, Reasoning, and Knowledge (13 papers) and Formal Methods in Verification (10 papers). Neil Thapen is often cited by papers focused on Complexity and Algorithms in Graphs (19 papers), Logic, Reasoning, and Knowledge (13 papers) and Formal Methods in Verification (10 papers). Neil Thapen collaborates with scholars based in Czechia, Canada and United Kingdom. Neil Thapen's co-authors include Alan Skelley, Stephen Cook, Nicola Galesi, Pavel Pudlák, Jan Krajı́ček, Samuel R. Buss, Phuong Nguyen, Massimo Lauria, Jakob Nordstr”öm and Yuval Filmus and has published in prestigious journals such as SIAM Journal on Computing, Proceedings of the London Mathematical Society and Journal of Symbolic Logic.

In The Last Decade

Neil Thapen

36 papers receiving 163 citations

Peers

Neil Thapen
Srikanth Srinivasan India
Massimo Lauria Italy
Szymon Toruńczyk Poland
Ulrich Hertrampf Germany
Michael Alekhnovich United States
Kanstantsin Pashkovich Canada
Dor Minzer United States
Emil Jeřábek Czechia
Piotr Micek Poland
Sebastian Siebertz Germany
Srikanth Srinivasan India
Neil Thapen
Citations per year, relative to Neil Thapen Neil Thapen (= 1×) peers Srikanth Srinivasan

Countries citing papers authored by Neil Thapen

Since Specialization
Citations

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

Fields of papers citing papers by Neil Thapen

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Neil Thapen

This figure shows the co-authorship network connecting the top 25 collaborators of Neil Thapen. A scholar is included among the top collaborators of Neil Thapen 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 Neil Thapen. Neil Thapen 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.
Thapen, Neil, et al.. (2024). First-order reasoning and efficient semi-algebraic proofs. Annals of Pure and Applied Logic. 176(1). 103496–103496.
2.
Galesi, Nicola, et al.. (2019). Polynomial calculus space and resolution width.. 26. 52. 2 indexed citations
3.
Pudlák, Pavel & Neil Thapen. (2016). Random resolution refutations.. ASEP. 23. 175. 1 indexed citations
4.
Thapen, Neil. (2016). . Theory of Computing. 12(1). 1–14. 3 indexed citations
5.
Lauria, Massimo, Pavel Pudlák, Vojtěch Rödl, & Neil Thapen. (2016). The complexity of proving that a graph is Ramsey. COMBINATORICA. 37(2). 253–268. 3 indexed citations
6.
Galesi, Nicola, Pavel Pudlák, & Neil Thapen. (2015). The space complexity of cutting planes refutations. 33. 433–447. 3 indexed citations
7.
Beckmann, Arnold, Sam Buss, Sy‐David Friedman, Moritz Müller, & Neil Thapen. (2015). Cobham recursive set functions. Annals of Pure and Applied Logic. 167(3). 335–369. 1 indexed citations
8.
Filmus, Yuval, et al.. (2015). Space Complexity in Polynomial Calculus. SIAM Journal on Computing. 44(4). 1119–1153. 4 indexed citations
9.
Galesi, Nicola, Pavel Pudlák, & Neil Thapen. (2015). The Space Complexity of Cutting Planes Refutations. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 21. 138. 1 indexed citations
10.
Thapen, Neil. (2014). A trade-off between length and width in resolution.. Electronic colloquium on computational complexity. 21. 137. 4 indexed citations
11.
Buss, Samuel R., et al.. (2014). FRAGMENTS OF APPROXIMATE COUNTING. Journal of Symbolic Logic. 79(2). 496–525. 16 indexed citations
12.
Filmus, Yuval, et al.. (2012). Space Complexity in Polynomial Calculus. 19(132). 132.
13.
Nguyen, Phuong, et al.. (2011). The provably total NP search problems of weak second order bounded arithmetic. Annals of Pure and Applied Logic. 162(6). 419–446. 11 indexed citations
14.
Pudlák, Pavel & Neil Thapen. (2011). Alternating minima and maxima, Nash equilibria and Bounded Arithmetic. Annals of Pure and Applied Logic. 163(5). 604–614. 4 indexed citations
15.
Thapen, Neil. (2011). Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem. Archive for Mathematical Logic. 50(7-8). 665–680. 3 indexed citations
16.
Cook, Stephen & Neil Thapen. (2006). The strength of replacement in weak arithmetic. ACM Transactions on Computational Logic. 7(4). 749–764. 1 indexed citations
17.
Thapen, Neil. (2005). Structures interpretable in models of bounded arithmetic. Annals of Pure and Applied Logic. 136(3). 247–266. 6 indexed citations
18.
Galesi, Nicola & Neil Thapen. (2004). The Complexity of Treelike Systems over -Local Formulae. 68–74. 3 indexed citations
19.
Cook, Stephen & Neil Thapen. (2004). The strength of replacement in weak arithmetic. 256–264. 3 indexed citations
20.
Thapen, Neil. (2002). A model-theoretic characterization of the weak pigeonhole principle. Annals of Pure and Applied Logic. 118(1-2). 175–195. 13 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 Srikanth Srinivasan Breakdown of academic impact, for papers by Massimo Lauria Breakdown of academic impact, for papers by Szymon Toruńczyk Breakdown of academic impact, for papers by Ulrich Hertrampf Breakdown of academic impact, for papers by Michael Alekhnovich Breakdown of academic impact, for papers by Kanstantsin Pashkovich Breakdown of academic impact, for papers by Dor Minzer Breakdown of academic impact, for papers by Emil Jeřábek Breakdown of academic impact, for papers by Piotr Micek Breakdown of academic impact, for papers by Sebastian Siebertz
Rankless by CCL
2026