Carl Pomerance

According to our database1, Carl Pomerance authored at least 35 papers between 1977 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Proof of the Sheldon Conjecture.
Am. Math. Mon., 2019

The reciprocal sum of the amicable numbers.
Math. Comput., 2019

Symmetric Primes Revisited.
Integers, 2019

2018
Improved error bounds for the Fermat primality test on random inputs.
Math. Comput., 2018

Connected Components of the Graph Generated by Power Maps in Prime Finite Fields.
Integers, 2018

Density of Singular Pairs of Integers.
Integers, 2018

2016
Generating random factored Gaussian integers, easily.
Math. Comput., 2016

2015
Divisors of the Middle Binomial Coefficient.
Am. Math. Mon., 2015

2014
Variant of a theorem of Erdős on the sum-of-proper-divisors function.
Math. Comput., 2014

2013
On Balanced Subgroups of the Multiplicative Group.
Proceedings of the Number Theory and Related Fields, In Memory of Alf van der Poorten, 2013

On Primes Recognizable in Deterministic Polynomial Time.
Proceedings of the Mathematics of Paul Erdős I, 2013

2012
Prime-Perfect Numbers.
Integers, 2012

On Sets of Integers Which Are Both Sum-Free and Product-Free.
Integers, 2012

2011
Remarks on the Pólya-Vinogradov Inequality.
Integers, 2011

2010
On the asymptotic effectiveness of Weil descent attacks.
J. Math. Cryptol., 2010

Fixed Points for Discrete Logarithms.
Proceedings of the Algorithmic Number Theory, 9th International Symposium, 2010

2003
Timed Fair Exchange of Standard Signatures.
IACR Cryptol. ePrint Arch., 2003

Timed Fair Exchange of Standard Signatures: [Extended Abstract].
Proceedings of the Financial Cryptography, 2003

2002
The expected number of random elements to generate a finite abelian group.
Period. Math. Hung., 2002

Two contradictory conjectures concerning Carmichael numbers.
Math. Comput., 2002

Smooth Orders and Cryptographic Applications.
Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

2001
Period of the power generator and small values of Carmichael's function.
Math. Comput., 2001

1999
Number Theory.
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999

1997
Automaticity II: Descriptional Complexity in the Unary Case.
Theor. Comput. Sci., 1997

A search for Wieferich and Wilson primes.
Math. Comput., 1997

1995
Counting the Integers Factorable via Cyclotomic Methods.
J. Algorithms, 1995

1994
On the difficulty of finding reliable witnesses.
Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1992
Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes.
Exp. Math., 1992

1988
A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm.
SIAM J. Comput., 1988

The Generation of Random Numbers that Are Probably Prime.
J. Cryptol., 1988

1987
The smallets n-uniform hypergraph with positive discrepancy.
Comb., 1987

1984
The Quadratic Sieve Factoring Algorithm.
Proceedings of the Advances in Cryptology: Proceedings of EUROCRYPT 84, 1984

1983
New Ideas for Factoring Large Integers.
Proceedings of the Advances in Cryptology, 1983

1980
Collinear Subsets of Lattice Point Sequences - An Analog of Szemerédi's Theorem.
J. Comb. Theory, Ser. A, 1980

1977
On a tiling problem of R.B. Eggleton.
Discret. Math., 1977


  Loading...