John Staples

445 total citations
25 papers, 216 citations indexed

About

John Staples is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, John Staples has authored 25 papers receiving a total of 216 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Artificial Intelligence, 16 papers in Computational Theory and Mathematics and 9 papers in Computer Networks and Communications. Recurrent topics in John Staples's work include Logic, programming, and type systems (11 papers), Logic, Reasoning, and Knowledge (8 papers) and Advanced Algebra and Logic (5 papers). John Staples is often cited by papers focused on Logic, programming, and type systems (11 papers), Logic, Reasoning, and Knowledge (8 papers) and Advanced Algebra and Logic (5 papers). John Staples collaborates with scholars based in Australia and United Kingdom. John Staples's co-authors include Ralph A. Shaw, Leslie M. Goldschlager, Peter Eades, Peter Robinson, Alistair Moffat, Naoki Katoh, Philip Robinson, Ross Paterson and Yaowei Liu and has published in prestigious journals such as Journal of the ACM, Theoretical Computer Science and Bulletin of the London Mathematical Society.

In The Last Decade

John Staples

23 papers receiving 188 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
John Staples Australia 8 151 113 60 35 18 25 216
Oded Lachish United Kingdom 8 112 0.7× 79 0.7× 44 0.7× 19 0.5× 24 1.3× 26 164
Miki Hermann France 7 185 1.2× 126 1.1× 63 1.1× 23 0.7× 16 0.9× 24 251
Richard P. Hopkins United Kingdom 5 81 0.5× 83 0.7× 141 2.4× 129 3.7× 16 0.9× 9 241
Stephen R. Mahaney United States 12 427 2.8× 248 2.2× 105 1.8× 34 1.0× 3 0.2× 21 529
Peter van Emde Boas Netherlands 9 128 0.8× 120 1.1× 78 1.3× 9 0.3× 3 0.2× 25 229
Monika Rauch United States 6 134 0.9× 54 0.5× 114 1.9× 12 0.3× 7 0.4× 9 202
Gregory E. Shannon United States 7 185 1.2× 76 0.7× 150 2.5× 24 0.7× 3 0.2× 16 261
Detlef Sieling Germany 7 226 1.5× 139 1.2× 40 0.7× 69 2.0× 75 4.2× 20 293
Axel Poigné Germany 8 98 0.6× 87 0.8× 43 0.7× 25 0.7× 13 0.7× 23 165
C. Barry Jay Australia 9 91 0.6× 232 2.1× 69 1.1× 61 1.7× 41 2.3× 28 289

Countries citing papers authored by John Staples

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of John Staples

This figure shows the co-authorship network connecting the top 25 collaborators of John Staples. A scholar is included among the top collaborators of John Staples 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 John Staples. John Staples 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.
Staples, John, Peter Eades, Naoki Katoh, & Alistair Moffat. (1995). Proceedings of the 6th International Symposium on Algorithms and Computation. 8 indexed citations
2.
Staples, John, et al.. (1994). A functional logic for higher level reasoning about computation. Formal Aspects of Computing. 6(1). 1–38. 7 indexed citations
3.
Liu, Yaowei & John Staples. (1991). btC: A Backtracking Procedural Language. 245. 1 indexed citations
4.
Staples, John, et al.. (1991). An extensional fixed-point semantics for nondeterministic data flow. Theoretical Computer Science. 91(2). 129–179. 3 indexed citations
5.
Staples, John, et al.. (1990). Higher level meta programming in Qu-Prolog 3.0. Queensland's institutional digital repository (The University of Queensland). 285–298. 2 indexed citations
6.
Staples, John & Peter Robinson. (1990). Structure sharing for quantified terms: Fundamentals. Journal of Automated Reasoning. 6(2). 115–145. 2 indexed citations
7.
Staples, John, et al.. (1988). Qu-Prolog: An Extended Prolog for Meta Level Programming.. MIT Press eBooks. 435–452. 6 indexed citations
8.
Staples, John, et al.. (1988). Efficient unification of quantified terms. The Journal of Logic Programming. 5(2). 133–149. 4 indexed citations
9.
Staples, John, et al.. (1988). QU-PROLOG-AN EXTENDED PROLOG FOR SYMBOLIC COMPUTATION.. Queensland's institutional digital repository (The University of Queensland). 10(1). 194–203. 1 indexed citations
10.
Staples, John, et al.. (1985). A fixpoint semantics for nondeterministic data flow. Journal of the ACM. 32(2). 411–444. 20 indexed citations
11.
Staples, John, et al.. (1983). Computing the behaviour of asynchronous processes. Theoretical Computer Science. 26(3). 343–353. 5 indexed citations
12.
Goldschlager, Leslie M., Ralph A. Shaw, & John Staples. (1982). The maximum flow problem is log space complete for P. Theoretical Computer Science. 21(1). 105–111. 86 indexed citations
13.
Staples, John. (1981). Efficient Combinatory Reduction. Mathematical logic quarterly. 27(25-30). 391–402. 2 indexed citations
14.
Eades, Peter & John Staples. (1981). On optimal trees. Journal of Algorithms. 2(4). 369–384. 2 indexed citations
15.
Staples, John. (1980). Computation on graph-like expressions. Theoretical Computer Science. 10(2). 171–185. 21 indexed citations
16.
Staples, John. (1980). Optimal evaluations of graph-like expressions. Theoretical Computer Science. 10(3). 297–316. 13 indexed citations
17.
Staples, John. (1980). Speeding up subtree replacement systems. Theoretical Computer Science. 11(1). 39–47. 9 indexed citations
18.
Staples, John. (1979). A lambda calculus with naive substitution. Journal of the Australian Mathematical Society. 28(3). 269–282. 1 indexed citations
19.
Staples, John. (1977). Optimal reduction in replacement systems. Bulletin of the Australian Mathematical Society. 16(3). 341–349. 2 indexed citations
20.
Staples, John. (1969). A Non-Standard Representatiion of Boolean Algebras, and Applications. Bulletin of the London Mathematical Society. 1(3). 315–320. 2 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

Rankless by CCL
2026