Carl Pomerance

7.0k total citations
182 papers, 2.5k citations indexed

About

Carl Pomerance is a scholar working on Algebra and Number Theory, Geometry and Topology and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Carl Pomerance has authored 182 papers receiving a total of 2.5k indexed citations (citations by other indexed papers that have themselves been cited), including 111 papers in Algebra and Number Theory, 47 papers in Geometry and Topology and 46 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Carl Pomerance's work include Analytic Number Theory Research (101 papers), Advanced Mathematical Identities (48 papers) and Limits and Structures in Graph Theory (33 papers). Carl Pomerance is often cited by papers focused on Analytic Number Theory Research (101 papers), Advanced Mathematical Identities (48 papers) and Limits and Structures in Graph Theory (33 papers). Carl Pomerance collaborates with scholars based in United States, United Kingdom and Canada. Carl Pomerance's co-authors include Richard E. Crandall, Paul Erdős, Michel L. Lapidus, Andrew Granville, E. Rodney Canfield, Leonard M. Adleman, Robert Rumely, H. W. Lenstra, P. Erdös and J. L. Selfridge and has published in prestigious journals such as Mathematics of Computation, Annals of Mathematics and Scientific American.

In The Last Decade

Carl Pomerance

163 papers receiving 2.1k citations

Peers

Carl Pomerance
D. R. Heath‐Brown United States
Lowell Schoenfeld United States
Ivan Niven United States
Carl Pomerance
Citations per year, relative to Carl Pomerance Carl Pomerance (= 1×) peers Henri Cohen

Countries citing papers authored by Carl Pomerance

Since Specialization
Citations

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

Fields of papers citing papers by Carl Pomerance

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Carl Pomerance

This figure shows the co-authorship network connecting the top 25 collaborators of Carl Pomerance. A scholar is included among the top collaborators of Carl Pomerance 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 Carl Pomerance. Carl Pomerance 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.
Pollack, Paul & Carl Pomerance. (2016). Some problems of Erdős on the sum-of-divisors function. 3(1). 1–26. 6 indexed citations
2.
Banks, William D., et al.. (2014). Sierpiński and Carmichael numbers. Transactions of the American Mathematical Society. 367(1). 355–376. 1 indexed citations
3.
Pomerance, Carl, et al.. (2013). Variant of a theorem of Erdős on the sum-of-proper-divisors function. Mathematics of Computation. 83(288). 1903–1913. 4 indexed citations
4.
Lapidus, Michel L. & Carl Pomerance. (1996). Counterexamples to the modified Weyl–Berry conjecture on fractal drums. Mathematical Proceedings of the Cambridge Philosophical Society. 119(1). 167–178. 32 indexed citations
5.
Balog, Antal & Carl Pomerance. (1992). The distribution of smooth numbers in arithmetic progressions. Proceedings of the American Mathematical Society. 115(1). 33–43. 14 indexed citations
6.
Lenstra, H. W. & Carl Pomerance. (1992). A Rigorous Time Bound for Factoring Integers. Journal of the American Mathematical Society. 5(3). 483–483. 13 indexed citations
7.
Lenstra, H. W. & Carl Pomerance. (1992). A rigorous time bound for factoring integers. Journal of the American Mathematical Society. 5(3). 483–516. 41 indexed citations
8.
Gordon, Daniel M. & Carl Pomerance. (1991). The Distribution of Lucas and Elliptic Pseudoprimes. Mathematics of Computation. 57(196). 825–825. 2 indexed citations
9.
Gordon, Daniel M. & Carl Pomerance. (1991). The distribution of Lucas and elliptic pseudoprimes. Mathematics of Computation. 57(196). 825–838. 13 indexed citations
10.
Maier, Helmut & Carl Pomerance. (1990). Unusually large gaps between consecutive primes. Transactions of the American Mathematical Society. 322(1). 201–237. 24 indexed citations
11.
Maier, Helmut & Carl Pomerance. (1990). Unusually Large Gaps Between Consecutive Primes. Transactions of the American Mathematical Society. 322(1). 201–201. 8 indexed citations
12.
Pomerance, Carl, et al.. (1989). The probability that a random probable prime is composite. Mathematics of Computation. 53(188). 721–741. 5 indexed citations
13.
Pomerance, Carl. (1987). Very short primality proofs. Mathematics of Computation. 48(177). 315–322. 9 indexed citations
14.
Pomerance, Carl. (1987). Very Short Primality Proofs. Mathematics of Computation. 48(177). 315–315. 6 indexed citations
15.
Pomerance, Carl. (1985). The Quadratic Sieve Algorithm. 2 indexed citations
16.
Pomerance, Carl. (1981). On the distribution of pseudoprimes. Mathematics of Computation. 37(156). 587–593. 36 indexed citations
17.
Penney, David E. & Carl Pomerance. (1975). Three elliptic curves with rank at least seven. Mathematics of Computation. 29(131). 965–967. 6 indexed citations
18.
Penney, David E. & Carl Pomerance. (1975). Three Elliptic Curves with Rank at Least Seven. Mathematics of Computation. 29(131). 965–965. 1 indexed citations
19.
Penney, David E. & Carl Pomerance. (1974). A search for elliptic curves with large rank. Mathematics of Computation. 28(127). 851–853. 5 indexed citations
20.
Penney, David E. & Carl Pomerance. (1974). A Search for Elliptic Curves With Large Rank. Mathematics of Computation. 28(127). 851–851. 6 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