John Leech

47 papers receiving 1.3k citations

John Leech's Hit Papers

Computational Problems in Abstract Algebra 1971 · 522 citations
5220+18+36Years since publication100200300400500

Peers

John Leech
Comparison fields: 5 of 110
  • Discrete Mathematics and Combinatorics 301
  • Geometry and Topology 360
  • Theoretical Computer Science 44
  • Computational Theory and Mathematics 453
  • Algebra and Number Theory 117
Replace G Szekeres with:
G Szekeres Australia
N.G. de Bruijn Netherlands
Andrew M. Gleason United States
J. L. Brenner United States
Srishti D. Chatterji Switzerland
G. H. Hardy United Kingdom
Leo Moser Canada
de Ng Dick Bruijn Netherlands
N. J. Fine United States
Steven Roman United States
John Leech relative to G Szekeres Australia G Szekeres's profile →
Citations per field
00.5×1.5×
G Szekeres · 1×
Citations per year

Countries citing papers authored by John Leech

Since Specialization
Citations

This map shows the geographic impact of John Leech'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 Leech with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John Leech more than expected).

Fields of papers citing papers by John Leech

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by John Leech. 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 Leech. The network helps show where John Leech may publish in the future.

Co-authors

The 8 scholars most cited alongside John Leech, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with John Leech Line = papers co-authored together John Leech links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 48 papers — load more, or switch the sort, to bring in the rest.

#Work
1
Computational Problems in Abstract Algebra
Hit paper breakdown →
1971522
2 1971165
3 1956129
4 1967116
5 199679
6 196474
7 195769
8 196337
9 196525
10 195722
11 197720
12 197019
13 199916
14 197715
15 196114
16 197712
17 196911
18 196611
19 195711
20 197711

About John Leech

John Leech is a scholar working on Geometry and Topology, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering and Civil and Structural Engineering, having authored 48 papers that have together received 1.5k indexed citations. Recurring topics across this work include Mathematics and Applications (10 papers), Finite Group Theory Research (7 papers), graph theory and CDMA systems (7 papers), Structural Analysis and Optimization (6 papers), Advanced Algebra and Logic (5 papers), History and Theory of Mathematics (4 papers), Coding theory and cryptography (4 papers) and Advanced Materials and Mechanics (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (301 citations), Geometry and Topology (360 citations), Theoretical Computer Science (44 citations), Computational Theory and Mathematics (453 citations) and Algebra and Number Theory (117 citations). John Leech has collaborated with scholars based in United Kingdom, United States and France. Frequent co-authors include Harold Chapman Brown, N. J. A. Sloane, Jan F. Prins, J. J. Hérmans, J. Mennicke, C. B. Haselgrove, J.M. Lagrange and T. H. H. Pian. Their work appears in journals such as Mathematical Proceedings of the Cambridge Philosophical Society, Mathematics of Computation, Canadian Journal of Mathematics, Journal of the London Mathematical Society and Proceedings of the Edinburgh Mathematical Society.

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