default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarl Pomerance
Person information
- affiliation: Dartmouth College, Department of Mathematics, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j27]Tsz Ho Chan, Jared D. Lichtman
, Carl Pomerance:
On the Critical Exponent for k-Primitive Sets. Comb. 42(5): 729-747 (2022)- [j26]Carl Pomerance, Simon Rubinstein-Salzedo:
Cyclotomic Coincidences. Exp. Math. 31(2): 596-605 (2022)
2010 – 2019
- 2019
- [j25]William Banks, Paul Pollack, Carl Pomerance:
Symmetric Primes Revisited. Integers 19: A54 (2019) - [j24]My Hanh Nguyen, Carl Pomerance:
The reciprocal sum of the amicable numbers. Math. Comput. 88(317): 1503-1526 (2019) - [j23]Carl Pomerance, Chris Spicer:
Proof of the Sheldon Conjecture. Am. Math. Mon. 126(8): 688-698 (2019) - 2018
- [j22]Carl Pomerance, Igor E. Shparlinski:
Connected Components of the Graph Generated by Power Maps in Prime Finite Fields. Integers 18A: A16 (2018) - [j21]Roman Nedela, Carl Pomerance:
Density of Singular Pairs of Integers. Integers 18: A82 (2018) - [j20]Jared D. Lichtman, Carl Pomerance:
Improved error bounds for the Fermat primality test on random inputs. Math. Comput. 87(314): 2871-2890 (2018) - 2016
- [j19]Noah Lebowitz-Lockard, Carl Pomerance:
Generating random factored Gaussian integers, easily. Math. Comput. 85(297): 503-516 (2016) - 2015
- [j18]Carl Pomerance:
Divisors of the Middle Binomial Coefficient. Am. Math. Mon. 122(7): 636-644 (2015) - 2014
- [j17]Carl Pomerance, Hee-Sung Yang:
Variant of a theorem of Erdős on the sum-of-proper-divisors function. Math. Comput. 83(288): 1903-1913 (2014) - 2013
- [p2]Sergei Konyagin, Carl Pomerance:
On Primes Recognizable in Deterministic Polynomial Time. The Mathematics of Paul Erdős I 2013: 159-186 - [p1]Carl Pomerance, Douglas Ulmer:
On Balanced Subgroups of the Multiplicative Group. Number Theory and Related Fields 2013: 253-270 - 2012
- [j16]Paul Pollack, Carl Pomerance:
Prime-Perfect Numbers. Integers 12A: A14 (2012) - [j15]Pär Kurlberg, Jeffrey C. Lagarias, Carl Pomerance:
On Sets of Integers Which Are Both Sum-Free and Product-Free. Integers 12B: A4 (2012) - 2011
- [j14]Carl Pomerance:
Remarks on the Pólya-Vinogradov Inequality. Integers 11A: Article19 (2011) - 2010
- [j13]Koray Karabina, Alfred Menezes, Carl Pomerance, Igor E. Shparlinski:
On the asymptotic effectiveness of Weil descent attacks. J. Math. Cryptol. 4(2): 175-191 (2010) - [c6]Mariana Levin, Carl Pomerance, K. Soundararajan:
Fixed Points for Discrete Logarithms. ANTS 2010: 6-15
2000 – 2009
- 2003
- [c5]Juan A. Garay, Carl Pomerance:
Timed Fair Exchange of Standard Signatures: [Extended Abstract]. Financial Cryptography 2003: 190-207 - [i1]Juan A. Garay, Carl Pomerance:
Timed Fair Exchange of Standard Signatures. IACR Cryptol. ePrint Arch. 2003: 42 (2003) - 2002
- [j12]Andrew Granville, Carl Pomerance:
Two contradictory conjectures concerning Carmichael numbers. Math. Comput. 71(238): 883-908 (2002) - [j11]Carl Pomerance:
The expected number of random elements to generate a finite abelian group. Period. Math. Hung. 43(1-2): 191-198 (2002) - [c4]Carl Pomerance, Igor E. Shparlinski:
Smooth Orders and Cryptographic Applications. ANTS 2002: 338-348 - 2001
- [j10]John B. Friedlander, Carl Pomerance, Igor E. Shparlinski:
Period of the power generator and small values of Carmichael's function. Math. Comput. 70(236): 1591-1605 (2001)
1990 – 1999
- 1999
- [r1]Jon Grantham, Carl Pomerance, Bart Goddard, Jeffrey O. Shallit:
Number Theory. Handbook of Discrete and Combinatorial Mathematics 1999 - 1997
- [j9]Richard E. Crandall, Karl Dilcher, Carl Pomerance:
A search for Wieferich and Wilson primes. Math. Comput. 66(217): 433-449 (1997) - [j8]Carl Pomerance, John Michael Robson, Jeffrey O. Shallit:
Automaticity II: Descriptional Complexity in the Unary Case. Theor. Comput. Sci. 180(1-2): 181-201 (1997) - 1995
- [j7]Carl Pomerance, Jonathan P. Sorenson:
Counting the Integers Factorable via Cyclotomic Methods. J. Algorithms 19(2): 250-265 (1995) - 1994
- [c3]W. R. Alford, Andrew Granville, Carl Pomerance:
On the difficulty of finding reliable witnesses. ANTS 1994: 1-16 - 1992
- [j6]Carl Pomerance, Jeffrey W. Smith:
Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes. Exp. Math. 1(2): 89-94 (1992)
1980 – 1989
- 1988
- [j5]Pierre Beauchemin, Gilles Brassard, Claude Crépeau, Claude Goutier, Carl Pomerance:
The Generation of Random Numbers that Are Probably Prime. J. Cryptol. 1(1): 53-64 (1988) - [j4]Carl Pomerance, Jeffrey W. Smith, Randy Tuler:
A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm. SIAM J. Comput. 17(2): 387-403 (1988) - [e1]Carl Pomerance:
Advances in Cryptology - CRYPTO '87, A Conference on the Theory and Applications of Cryptographic Techniques, Santa Barbara, California, USA, August 16-20, 1987, Proceedings. Lecture Notes in Computer Science 293, Springer 1988, ISBN 3-540-18796-0 [contents] - 1987
- [j3]Noga Alon, Daniel J. Kleitman, Carl Pomerance, Michael E. Saks, Paul D. Seymour:
The smallets n-uniform hypergraph with positive discrepancy. Comb. 7(2): 151-160 (1987) - 1984
- [c2]Carl Pomerance:
The Quadratic Sieve Factoring Algorithm. EUROCRYPT 1984: 169-182 - 1983
- [c1]Carl Pomerance, Jeffrey W. Smith, Samuel S. Wagstaff Jr.:
New Ideas for Factoring Large Integers. CRYPTO 1983: 81-85 - 1980
- [j2]Carl Pomerance:
Collinear Subsets of Lattice Point Sequences - An Analog of Szemerédi's Theorem. J. Comb. Theory A 28(2): 140-149 (1980)
1970 – 1979
- 1977
- [j1]Carl Pomerance:
On a tiling problem of R.B. Eggleton. Discret. Math. 18(1): 63-70 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
