John P. May
Impact in
-
- Polynomial and algebraic computation
- Numerical Methods and Algorithms
- Matrix Theory and Algorithms
Papers in
-
- Polynomial and algebraic computation 8
- Numerical Methods and Algorithms 4
- Matrix Theory and Algorithms 2
- Computability, Logic, AI Algorithms 2
- Formal Methods in Verification 2
-
- Logic, programming, and type systems 2
- Coding theory and cryptography 2
- Co-authors
- Erich Kaltofen (3 shared papers)Zhengfeng Yang (2 shared papers)Lihong Zhi (2 shared papers)Shuhong Gao (1 shared paper)Marc Moreno Maza (3 shared papers)Bican Xia (3 shared papers)Changbo Chen (3 shared papers)Rong Xiao (3 shared papers)
- Journals
- Journal of Symbolic Computation (2 papers)Dialnet (Universidad de la Rioja) (1 paper)NCSU Libraries Repository (North Carolina State University Libraries) (1 paper)Association for Computing Machinery eBooks (1 paper)
- Partner nations
- United StatesChinaCanada
In The Last Decade
John P. May
11 papers receiving 221 citations
Peers
Comparison fields: 5 of 42
- Computational Mathematics 8
- Computational Theory and Mathematics 183
- Algebra and Number Theory 33
- Geometry and Topology 42
- Numerical Analysis 23
Countries citing papers authored by John P. May
This map shows the geographic impact of John P. May'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 P. May with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John P. May more than expected).
Fields of papers citing papers by John P. May
This network shows the impact of papers produced by John P. May. 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 P. May. The network helps show where John P. May may publish in the future.
Co-authors
The 12 scholars most cited alongside John P. May, 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 | ISSAC 2009 : proceedings of the 2009 international symposium on symbolic and algebraic computation | 2009 | 74 |
| 2 | 2004 | 47 | |
| 3 | 2007 | 34 | |
| 4 | 2011 | 21 | |
| 5 | 2003 | 21 | |
| 6 | 2010 | 14 | |
| 7 | 2007 | 9 | |
| 8 | ISSAC 2009: International Symposium on Symbolic and Algebraic Computation | 2009 | 6 |
| 9 | Approximate Factorization of Polynomials in Many Variables and Other Problems in Approximate Algebra via Singular Value Decomposition Methods | 2005 | 2 |
| 10 | User interface design for geometrical decomposition algorithms in Maple | 2009 | 1 |
| 11 | 2007 | 1 |
About John P. May
John P. May is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Numerical Analysis, Discrete Mathematics and Combinatorics and Information Systems, having authored 11 papers that have together received 230 indexed citations. Recurring topics across this work include Polynomial and algebraic computation (8 papers), Numerical Methods and Algorithms (4 papers), Logic, programming, and type systems (2 papers), Coding theory and cryptography (2 papers), Matrix Theory and Algorithms (2 papers), Computability, Logic, AI Algorithms (2 papers), Formal Methods in Verification (2 papers) and Numerical methods for differential equations (1 paper). The work is most often cited by research in Computational Mathematics (8 citations), Computational Theory and Mathematics (183 citations), Algebra and Number Theory (33 citations), Geometry and Topology (42 citations) and Numerical Analysis (23 citations). John P. May has collaborated with scholars based in United States, China and Canada. Frequent co-authors include Erich Kaltofen, Zhengfeng Yang, Lihong Zhi, Shuhong Gao, Marc Moreno Maza, Bican Xia, Changbo Chen, Rong Xiao, James H. Davenport and David Saunders. Their work appears in journals such as Journal of Symbolic Computation, Dialnet (Universidad de la Rioja), NCSU Libraries Repository (North Carolina State University Libraries) and Association for Computing Machinery eBooks.
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.