Carl Pomerance - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 36 from 36

2022

On the Critical Exponent for k-Primitive SetsTsz Ho Chan, Jared D. Lichtman, Carl Pomerance. combinatorica, 42(5):729-747, 2022. [doi]

Cyclotomic CoincidencesCarl Pomerance, Simon Rubinstein-Salzedo. em, 31(2):596-605, 2022. [doi]

2019

Symmetric Primes RevisitedWilliam Banks, Paul Pollack, Carl Pomerance. int, 19, 2019. [doi]

The reciprocal sum of the amicable numbersMy Hanh Nguyen, Carl Pomerance. moc, 88(317):1503-1526, 2019. [doi]

Proof of the Sheldon ConjectureCarl Pomerance, Chris Spicer. tamm, 126(8):688-698, 2019. [doi]

2018

Improved error bounds for the Fermat primality test on random inputsJared D. Lichtman, Carl Pomerance. moc, 87(314):2871-2890, 2018. [doi]

Density of Singular Pairs of IntegersRoman Nedela, Carl Pomerance. int, 18, 2018. [doi]

Connected Components of the Graph Generated by Power Maps in Prime Finite FieldsCarl Pomerance, Igor E. Shparlinski. int, 18A, 2018. [doi]

2016

Generating random factored Gaussian integers, easilyNoah Lebowitz-Lockard, Carl Pomerance. moc, 85(297):503-516, 2016. [doi]

2015

Divisors of the Middle Binomial CoefficientCarl Pomerance. tamm, 122(7):636-644, 2015. [doi]

2014

Variant of a theorem of Erdős on the sum-of-proper-divisors functionCarl Pomerance, Hee-Sung Yang. moc, 83(288):1903-1913, 2014. [doi]

2013

On Primes Recognizable in Deterministic Polynomial TimeSergei Konyagin, Carl Pomerance. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős I. pages 159-186, Springer, 2013. [doi]

On Balanced Subgroups of the Multiplicative GroupCarl Pomerance, Douglas Ulmer. In Jonathan M. Borwein, Igor Shparlinski, Wadim Zudilin, editors, Number Theory and Related Fields, In Memory of Alf van der Poorten. pages 253-270, Springer, 2013. [doi]

2012

On Sets of Integers Which Are Both Sum-Free and Product-FreePär Kurlberg, Jeffrey C. Lagarias, Carl Pomerance. int, 12B, 2012. [doi]

Prime-Perfect NumbersPaul Pollack, Carl Pomerance. int, 12A, 2012. [doi]

2011

Remarks on the Pólya-Vinogradov InequalityCarl Pomerance. int, 11A, 2011. [doi]

2010

On the asymptotic effectiveness of Weil descent attacksKoray Karabina, Alfred Menezes, Carl Pomerance, Igor E. Shparlinski. jmc, 4(2):175-191, 2010. [doi]

Fixed Points for Discrete LogarithmsMariana Levin, Carl Pomerance, K. Soundararajan. ants 2010: 6-15 [doi]

2003

Timed Fair Exchange of Standard SignaturesJuan A. Garay, Carl Pomerance. iacr, 2003:42, 2003. [doi]

Timed Fair Exchange of Standard Signatures: [Extended Abstract]Juan A. Garay, Carl Pomerance. fc 2003: 190-207 [doi]

2002

Two contradictory conjectures concerning Carmichael numbersAndrew Granville, Carl Pomerance. moc, 71(238):883-908, 2002.

Smooth Orders and Cryptographic ApplicationsCarl Pomerance, Igor Shparlinski. antsw 2002: 338-348 [doi]

The expected number of random elements to generate a finite abelian groupCarl Pomerance. pmh, 43(1-2):191-198, 2002. [doi]

2001

Period of the power generator and small values of Carmichael s functionJohn Friedlander, Carl Pomerance, Igor Shparlinski. moc, 70(236):1591-1605, 2001.

1997

A search for Wieferich and Wilson primesRichard E. Crandall, Karl Dilcher, Carl Pomerance. moc, 66(217):433-449, 1997.

Automaticity II: Descriptional Complexity in the Unary CaseCarl Pomerance, John Michael Robson, Jeffrey Shallit. TCS, 180(1-2):181-201, 1997. [doi]

1995

Counting the Integers Factorable via Cyclotomic MethodsCarl Pomerance, Jonathan Sorenson. jal, 19(2):250-265, 1995.

1994

On the difficulty of finding reliable witnessesW. R. Alford, Andrew Granville, Carl Pomerance. antsw 1994: 1-16

1992

Reduction of Huge, Sparse Matrices over Finite Fields Via Created CatastrophesCarl Pomerance, Jeffrey W. Smith. em, 1(2):89-94, 1992. [doi]

1988

The Generation of Random Numbers that Are Probably PrimePierre Beauchemin, Gilles Brassard, Claude Crépeau, Claude Goutier, Carl Pomerance. joc, 1(1):53-64, 1988.

A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve AlgorithmCarl Pomerance, Jeffrey W. Smith, Randy Tuler. SICOMP, 17(2):387-403, 1988.

1987

The smallets n-uniform hypergraph with positive discrepancyNoga Alon, Daniel J. Kleitman, Carl Pomerance, Michael E. Saks, Paul D. Seymour. combinatorica, 7(2):151-160, 1987.

1984

The Quadratic Sieve Factoring AlgorithmCarl Pomerance. eurocrypt 1984: 169-182 [doi]

1983

New Ideas for Factoring Large IntegersCarl Pomerance, Jeffrey W. Smith, Samuel S. Wagstaff Jr.. crypto 1983: 81-85

1980

Collinear Subsets of Lattice Point Sequences - An Analog of Szemerédi s TheoremCarl Pomerance. JCT, 28(2):140-149, 1980.

1977

On a tiling problem of R.B. EggletonCarl Pomerance. DM, 18(1):63-70, 1977. [doi]

Sign in or sign up to see more results.

runs on WebDSL