John Staples
Impact in
-
- Complexity and Algorithms in Graphs
- semigroups and automata theory
- Computability, Logic, AI Algorithms
- Formal Methods in Verification
- Advanced Graph Theory Research
- Artificial Intelligence top 5%
- Logic, programming, and type systems
Papers in
-
- Logic, programming, and type systems 27
- Logic, Reasoning, and Knowledge 2
-
- semigroups and automata theory 4
- Complexity and Algorithms in Graphs 2
- Co-authors
- Leslie M. Goldschlager (1 shared paper)Peter Robinson (3 shared papers)Peter Eades (2 shared papers)Alistair Moffat (1 shared paper)Naoki Katoh (1 shared paper)Yaowei Liu (1 shared paper)Ross Paterson (1 shared paper)
- Journals
- Theoretical Computer Science (7 papers)Lecture notes in mathematics (2 papers)The Journal of Logic Programming (1 paper)Bulletin of the London Mathematical Society (1 paper)Journal of Algorithms (1 paper)
- Partner nations
- AustraliaUnited KingdomGermany
In The Last Decade
John Staples
31 papers receiving 332 citations
Peers
Comparison fields: 5 of 23
- Computational Theory and Mathematics 143
- Artificial Intelligence 234
- Theoretical Computer Science 7
- Hardware and Architecture 19
- Geometry and Topology 15
Countries citing papers authored by John Staples
This map shows the geographic impact of John Staples'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 Staples with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John Staples more than expected).
Fields of papers citing papers by John Staples
This network shows the impact of papers produced by John Staples. 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 Staples. The network helps show where John Staples may publish in the future.
Co-authors
The 7 scholars most cited alongside John Staples, 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 36 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1982 | 100 | |
| 2 | 1993 | 41 | |
| 3 | 1980 | 32 | |
| 4 | 1985 | 30 | |
| 5 | 1975 | 27 | |
| 6 | 1980 | 17 | |
| 7 | 1980 | 16 | |
| 8 | 1971 | 15 | |
| 9 | 1977 | 13 | |
| 10 | 1994 | 10 | |
| 11 | Proceedings of the 6th International Symposium on Algorithms and Computation | 1995 | 9 |
| 12 | Qu-Prolog: An Extended Prolog for Meta Level Programming. | 1988 | 8 |
| 13 | 1973 | 7 | |
| 14 | 1977 | 5 | |
| 15 | 1983 | 5 | |
| 16 | 1988 | 5 | |
| 17 | Higher level meta programming in Qu-Prolog 3.0 | 1990 | 4 |
| 18 | 1969 | 3 | |
| 19 | 1976 | 3 | |
| 20 | 1981 | 3 |
About John Staples
John Staples is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Geometry and Topology, Mathematical Physics and Theoretical Computer Science, having authored 36 papers that have together received 375 indexed citations. Recurring topics across this work include Logic, programming, and type systems (27 papers), semigroups and automata theory (4 papers), Advanced Topology and Set Theory (4 papers), Mathematical and Theoretical Analysis (3 papers), Logic, Reasoning, and Knowledge (2 papers), Complexity and Algorithms in Graphs (2 papers), History and Theory of Mathematics (1 paper) and Rings, Modules, and Algebras (1 paper). The work is most often cited by research in Computational Theory and Mathematics (143 citations), Artificial Intelligence (234 citations), Theoretical Computer Science (7 citations), Hardware and Architecture (19 citations) and Geometry and Topology (15 citations). John Staples has collaborated with scholars based in Australia, United Kingdom and Germany. Frequent co-authors include Leslie M. Goldschlager, Peter Robinson, Peter Eades, Alistair Moffat, Naoki Katoh, Yaowei Liu and Ross Paterson. Their work appears in journals such as Theoretical Computer Science, Lecture notes in mathematics, The Journal of Logic Programming, Bulletin of the London Mathematical Society and Journal of Algorithms.
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.