Neil Thapen
-
- Complexity and Algorithms in Graphs 19
- Formal Methods in Verification 10
- Computability, Logic, AI Algorithms 10
- Polynomial and algebraic computation 6
- semigroups and automata theory 3
- Artificial Intelligence top 10%
- Logic, Reasoning, and Knowledge 13
- Logic, programming, and type systems 7
-
- Optimization and Search Problems 3
- Co-authors
- Alan SkelleyStephen CookNicola GalesiPavel PudlákJan Krajı́čekSamuel R. BussPhuong NguyenMassimo Lauria
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Graphics and Computer-Aided Design
- Journals
- SIAM Journal on Computing (1 paper)Proceedings of the London Mathematical Society (1 paper)Journal of Symbolic Logic (3 papers)
- Partner nations
- CzechiaCanadaUnited Kingdom
In The Last Decade
Neil Thapen
36 papers receiving 163 citations
Peers
Comparison fields: 5 of 20
- Computational Theory and Mathematics 153
- Discrete Mathematics and Combinatorics 16
- Computer Graphics and Computer-Aided Design 15
- Artificial Intelligence 116
- Algebra and Number Theory 5
Countries citing papers authored by Neil Thapen
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
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
The 17 scholars most cited alongside Neil Thapen, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 0 | |
| 2 | Polynomial calculus space and resolution width. | 2019 | 2 |
| 3 | 2016 | 1 | |
| 4 | 2016 | 3 | |
| 5 | 2016 | 3 | |
| 6 | 2015 | 3 | |
| 7 | 2015 | 1 | |
| 8 | 2015 | 4 | |
| 9 | 2015 | 1 | |
| 10 | A trade-off between length and width in resolution. | 2014 | 4 |
| 11 | 2014 | 16 | |
| 12 | Space Complexity in Polynomial Calculus | 2012 | 0 |
| 13 | 2011 | 11 | |
| 14 | 2011 | 4 | |
| 15 | 2011 | 3 | |
| 16 | 2006 | 1 | |
| 17 | 2005 | 6 | |
| 18 | 2004 | 3 | |
| 19 | 2004 | 3 | |
| 20 | 2002 | 13 |
About Neil Thapen
Neil Thapen is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Artificial Intelligence, having authored 38 papers that have together received 174 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (19 papers), Logic, Reasoning, and Knowledge (13 papers), Formal Methods in Verification (10 papers), Computability, Logic, AI Algorithms (10 papers), Logic, programming, and type systems (7 papers), Polynomial and algebraic computation (6 papers), Optimization and Search Problems (3 papers) and semigroups and automata theory (3 papers). The work is most often cited by research in Computational Theory and Mathematics (153 citations), Discrete Mathematics and Combinatorics (16 citations) and Computer Graphics and Computer-Aided Design (15 citations). Neil Thapen has collaborated with scholars based in Czechia, Canada and United Kingdom. Frequent 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. Their work appears in journals such as SIAM Journal on Computing, Proceedings of the London Mathematical Society and Journal of Symbolic Logic.
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.