John Power
Impact in
- Artificial Intelligence top 0.5%
- Logic, programming, and type systems
- Logic, Reasoning, and Knowledge
- Mathematical Physics top 1%
- Homotopy and Cohomology in Algebraic Topology
Papers in
-
- Logic, programming, and type systems 116
- Logic, Reasoning, and Knowledge 4
-
- Advanced Algebra and Logic 31
- semigroups and automata theory 2
- Formal Methods in Verification 1
- Co-authors
- Gordon D. Plotkin (13 shared papers)Martin Hyland (13 shared papers)G. M. Kelly (3 shared papers)E. Powell Robinson (5 shared papers)Ross Street (3 shared papers)Hiroshi Watanabe (6 shared papers)Hayo Thielecke (3 shared papers)Paul Blain Levy (3 shared papers)
- Journals
- Journal of Pure and Applied Algebra (15 papers)Theoretical Computer Science (13 papers)Electronic Notes in Theoretical Computer Science (34 papers)Information and Computation (3 papers)Mathematical Structures in Computer Science (3 papers)
- Partner nations
- United KingdomJapanUnited States
In The Last Decade
John Power
128 papers receiving 3.1k citations
Peers
Comparison fields: 5 of 29
- Artificial Intelligence 2.7k
- Mathematical Physics 724
- Computational Theory and Mathematics 518
- Geometry and Topology 220
- Algebra and Number Theory 56
Countries citing papers authored by John Power
This map shows the geographic impact of John Power'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 John Power with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John Power more than expected).
Fields of papers citing papers by John Power
This network shows the impact of papers produced by John Power. 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 John Power. The network helps show where John Power may publish in the future.
Co-authors
The 25 scholars most cited alongside John Power, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 131 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1995 | 226 | |
| 2 | 2002 | 213 | |
| 3 | 2003 | 202 | |
| 4 | 1989 | 184 | |
| 5 | 1997 | 174 | |
| 6 | 1993 | 138 | |
| 7 | 2006 | 138 | |
| 8 | 2003 | 112 | |
| 9 | 2001 | 103 | |
| 10 | 2004 | 81 | |
| 11 | 2007 | 75 | |
| 12 | 2002 | 65 | |
| 13 | 1990 | 59 | |
| 14 | 1989 | 55 | |
| 15 | 2000 | 51 | |
| 16 | 1999 | 49 | |
| 17 | 2001 | 49 | |
| 18 | 1989 | 47 | |
| 19 | 2002 | 41 | |
| 20 | 2006 | 41 |
About John Power
John Power is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Mathematical Physics, Software and Geometry and Topology, having authored 131 papers that have together received 3.4k indexed citations. Recurring topics across this work include Logic, programming, and type systems (116 papers), Advanced Algebra and Logic (31 papers), Homotopy and Cohomology in Algebraic Topology (27 papers), Algebraic structures and combinatorial models (6 papers), Model-Driven Software Engineering Techniques (6 papers), Logic, Reasoning, and Knowledge (4 papers), semigroups and automata theory (2 papers) and Formal Methods in Verification (1 paper). The work is most often cited by research in Artificial Intelligence (2.7k citations), Mathematical Physics (724 citations), Computational Theory and Mathematics (518 citations), Geometry and Topology (220 citations) and Algebra and Number Theory (56 citations). John Power has collaborated with scholars based in United Kingdom, Japan and United States. Frequent co-authors include Gordon D. Plotkin, Martin Hyland, G. M. Kelly, E. Powell Robinson, Ross Street, Hiroshi Watanabe, Hayo Thielecke, Paul Blain Levy, Robert D. Tennent and Marina Lenisa. Their work appears in journals such as Journal of Pure and Applied Algebra, Theoretical Computer Science, Electronic Notes in Theoretical Computer Science, Information and Computation and Mathematical Structures in Computer Science.
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.