Követés
Carl Pomerance
Carl Pomerance
Dartmouth College, University of Georgia
E-mail megerősítve itt: dartmouth.edu - Kezdőlap
Cím
Hivatkozott rá
Hivatkozott rá
Év
Prime numbers: a computational perspective
RE Crandall, C Pomerance
Springer, 2005
16772005
There are infinitely many Carmichael numbers
WR Alford, A Granville, C Pomerance
Annals of Mathematics 139 (3), 703-722, 1994
6841994
On a problem of Oppenheim concerning “factorisatio numerorum”
ER Canfield, P Erdös, C Pomerance
Journal of number theory 17 (1), 1-28, 1983
4741983
A tale of two sieves
C Pomerance
Notices of the American Mathematical Society 43 (12), 1473-1485, 1996
4621996
The quadratic sieve factoring algorithm
C Pomerance
Advances in Cryptology: Proceedings of EUROCRYPT 84 A Workshop on the Theory …, 1985
4161985
Analysis and comparison of some integer factoring algorithms
C Pomerance
Computational methods in number theory, 89-139, 1982
3911982
Factoring integers with the number field sieve
JP Buhler, HW Lenstra, C Pomerance
The development of the number field sieve, 50-94, 1993
3531993
The pseudoprimes to 25⋅ 10⁹
C Pomerance, JL Selfridge, SS Wagstaff
Mathematics of Computation 35 (151), 1003-1026, 1980
3211980
The Riemann Zeta‐Function and the One‐Dimensional Weyl‐Berry Conjecture for Fractal Drums
ML Lapidus, C Pomerance
Proceedings of the London Mathematical Society 3 (1), 41-69, 1993
2511993
A search for Wieferich and Wilson primes
R Crandall, K Dilcher, C Pomerance
Mathematics of Computation 66 (217), 433-449, 1997
1761997
A rigorous time bound for factoring integers
HW Lenstra, C Pomerance
Journal of the American Mathematical Society 5 (3), 483-516, 1992
1761992
Carmichael’s lambda function
P Erdos, C Pomerance, E Schmutz
Acta Arith 58 (4), 363-385, 1991
1651991
Fast, rigorous factorization and discrete logarithm algorithms
C Pomerance
Discrete algorithms and complexity, 119-143, 1987
1551987
On the distribution of pseudoprimes
C Pomerance
Mathematics of Computation 37 (156), 587-593, 1981
1311981
Average case error estimates for the strong probable prime test
I Damgård, P Landrock, C Pomerance
Mathematics of computation 61 (203), 177-194, 1993
1271993
A pipeline architecture for factoring large integers with the quadratic sieve algorithm
C Pomerance, JW Smith, R Tuler
SIAM Journal on Computing 17 (2), 387-403, 1988
1131988
Recent developments in primality testing
C Pomerance
The Mathematical Intelligencer 3 (3), 97-105, 1981
1121981
On the normal behavior of the iterates of some arithmetic functions
P Erdös, A Granvilie, C Pomerance, C Spiro
Analytic Number Theory: Proceedings of a Conference in Honor of Paul T …, 1990
1101990
Period of the power generator and small values of Carmichael’s function
J Friedlander, C Pomerance, I Shparlinski
Mathematics of computation 70 (236), 1591-1605, 2001
1062001
Reduction of huge, sparse matrices over finite fields via created catastrophes
C Pomerance, JW Smith
Experimental Mathematics 1 (2), 89-94, 1992
1041992
A rendszer jelenleg nem tudja elvégezni a műveletet. Próbálkozzon újra később.
Cikkek 1–20