J. M. Pollard

3.6k total citations
23 papers, 1.6k citations indexed

About

J. M. Pollard is a scholar working on Computational Theory and Mathematics, Information Systems and Geometry and Topology. According to data from OpenAlex, J. M. Pollard has authored 23 papers receiving a total of 1.6k indexed citations (citations by other indexed papers that have themselves been cited), including 11 papers in Computational Theory and Mathematics, 7 papers in Information Systems and 6 papers in Geometry and Topology. Recurrent topics in J. M. Pollard's work include Numerical Methods and Algorithms (7 papers), Cryptography and Residue Arithmetic (7 papers) and Digital Filter Design and Implementation (5 papers). J. M. Pollard is often cited by papers focused on Numerical Methods and Algorithms (7 papers), Cryptography and Residue Arithmetic (7 papers) and Digital Filter Design and Implementation (5 papers). J. M. Pollard collaborates with scholars based in United Kingdom, United States and Australia. J. M. Pollard's co-authors include Mark S. Manasse, Arjen K. Lenstra, H. W. Lenstra, Richard P. Brent, C. P. Schnorr and Steven D. Galbraith⋆ and has published in prestigious journals such as IEEE Transactions on Information Theory, Mathematics of Computation and Electronics Letters.

In The Last Decade

J. M. Pollard

20 papers receiving 1.4k citations

Peers

J. M. Pollard
Arjen K. Lenstra United States
Arnold Schönhage Germany
Jacques Stern France
Victor Shoup United States
Peter L. Montgomery United States
Fréderik Vercauteren Belgium
Steven D. Galbraith⋆ United Kingdom
S. Goldwasser United States
Gary L. Mullen United States
Samuel S. Wagstaff United States
Arjen K. Lenstra United States
J. M. Pollard
Citations per year, relative to J. M. Pollard J. M. Pollard (= 1×) peers Arjen K. Lenstra

Countries citing papers authored by J. M. Pollard

Since Specialization
Citations

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

Fields of papers citing papers by J. M. Pollard

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of J. M. Pollard

This figure shows the co-authorship network connecting the top 25 collaborators of J. M. Pollard. A scholar is included among the top collaborators of J. M. Pollard 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 J. M. Pollard. J. M. Pollard 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.
Galbraith⋆, Steven D., et al.. (2012). Computing discrete logarithms in an interval. Mathematics of Computation. 82(282). 1181–1195. 7 indexed citations
2.
Pollard, J. M.. (2000). 84.29 Kruskal’s card trick. The Mathematical Gazette. 84(500). 265–267.
3.
Pollard, J. M.. (2000). 84.30 Ceva = (Menelaus) 2. The Mathematical Gazette. 84(500). 268–271.
4.
Pollard, J. M.. (2000). Kangaroos, Monopoly and Discrete Logarithms. Journal of Cryptology. 13(4). 437–447. 50 indexed citations
5.
Pollard, J. M.. (1998). 82.5 Unforgettable Fermat factors. The Mathematical Gazette. 82(493). 77–79.
6.
Lenstra, Arjen K., H. W. Lenstra, Mark S. Manasse, & J. M. Pollard. (1993). The Factorization of the Ninth Fermat Number. Mathematics of Computation. 61(203). 319–319. 7 indexed citations
7.
Lenstra, Arjen K., H. W. Lenstra, Mark S. Manasse, & J. M. Pollard. (1993). The factorization of the ninth Fermat number. Mathematics of Computation. 61(203). 319–349. 34 indexed citations
8.
Lenstra, Arjen K., H. W. Lenstra, Mark S. Manasse, & J. M. Pollard. (1990). The number field sieve. 564–572. 119 indexed citations
9.
Pollard, J. M. & C. P. Schnorr. (1987). An efficient solution of the congruencex^2 + ky^2 = mpmod{n}. IEEE Transactions on Information Theory. 33(5). 702–709. 31 indexed citations
10.
Brent, Richard P. & J. M. Pollard. (1981). Factorization of the Eighth Fermat Number. Mathematics of Computation. 36(154). 627–627. 12 indexed citations
11.
Brent, Richard P. & J. M. Pollard. (1981). Factorization of the eighth Fermat number. Mathematics of Computation. 36(154). 627–630. 43 indexed citations
12.
Pollard, J. M.. (1979). On not storing the path of a random walk. BIT Numerical Mathematics. 19(4). 545–548. 1 indexed citations
13.
Pollard, J. M.. (1978). Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝). Mathematics of Computation. 32(143). 918–924. 337 indexed citations
14.
Pollard, J. M.. (1976). Implementation of number-theoretic transforms. Electronics Letters. 12(15). 378–379. 21 indexed citations
15.
Pollard, J. M.. (1975). A monte carlo method for factorization. BIT Numerical Mathematics. 15(3). 331–334. 157 indexed citations
16.
Pollard, J. M.. (1974). Theorems on factorization and primality testing. Mathematical Proceedings of the Cambridge Philosophical Society. 76(3). 521–528. 185 indexed citations
17.
Pollard, J. M.. (1974). A Generalisation of the Theorem of Cauchy and Davenport. Journal of the London Mathematical Society. s2-8(3). 460–462. 29 indexed citations
18.
Pollard, J. M.. (1971). The Fast Fourier Transform in a Finite Field. Mathematics of Computation. 25(114). 365–365. 148 indexed citations
19.
Pollard, J. M.. (1971). An Algorithm for Testing the Primality of any Integer. Bulletin of the London Mathematical Society. 3(3). 337–340. 4 indexed citations
20.
Pollard, J. M.. (1971). The fast Fourier transform in a finite field. Mathematics of Computation. 25(114). 365–374. 240 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

Breakdown of academic impact, for papers by Arjen K. Lenstra Breakdown of academic impact, for papers by Arnold Schönhage Breakdown of academic impact, for papers by Jacques Stern Breakdown of academic impact, for papers by Victor Shoup Breakdown of academic impact, for papers by Peter L. Montgomery Breakdown of academic impact, for papers by Fréderik Vercauteren Breakdown of academic impact, for papers by Steven D. Galbraith⋆ Breakdown of academic impact, for papers by S. Goldwasser Breakdown of academic impact, for papers by Gary L. Mullen Breakdown of academic impact, for papers by Samuel S. Wagstaff
Rankless by CCL
2026