Prime Numbers

548 REFERENCES
[Apostol 1986] T. Apostol. Introduction to Analytic Number Theory, 3rd printing.
Springer–Verlag, 1986.
[Arazi 1994] B. Arazi. On primality testing using purely divisionless operations.
The Computer Journal, 37:219–222, 1994.
[Archibald 1949] R. Archibald. Outline of the history of mathematics. Amer.
Math. Monthly, 56, 1949. The second Herbert Ellsworth Slaught
Memorial Paper: supplement to no. 1 issue, 114 pp.
[Ares and Castro 2004] S. Ares and M. Castro. Hidden structure in the
randomness in the prime number sequence. Condensed Matter Abstracts,
2004. http://arxiv.org/abs/cond-mat/0310148.
[Arney and Bender 1982] J. Arney and E. Bender. Random mappings with
constraints on coalescence and number of origins. Pacific J. Math.
103:269–294, 1982.
[Artjuhov 1966/67] M. Artjuhov. Certain criteria for the primality of numbers
connected with the little Fermat theorem (Russian). Acta Arith.,
12:355–364, 1966/67.
[Ashworth and Lyne 1988] M. Ashworth and A. Lyne. A segmented FFT
algorithm for vector computers. Parallel Computing, 6:217–224, 1988.
[Atkin 1986] A. Atkin. Schoof’s algorithm. Unpublished manuscript, 1986.
[Atkin 1988] A. Atkin. The number of points on an elliptic curve modulo a prime
(i). Unpublished manuscript, 1988.
[Atkin 1992] A. Atkin. The number of points on an elliptic curve modulo a prime
(ii). Unpublished manuscript, 1992.
[Atkin and Bernstein 2004] A. Atkin and D. Bernstein. Prime sieves using binary
quadratic forms. Math. Comp., 73:1023–1030, 2004.
[Atkin and Morain 1993a] A. Atkin and F. Morain. Finding suitable curves for the
elliptic curve method of factorization. Math. Comp., 60:399–405, 1993.
[Atkin and Morain 1993b] A. Atkin and F. Morain. Elliptic curves and primality
proving. Math. Comp., 61:29–68, 1993.
[Bach 1985] E. Bach. Analytic Methods in the Analysis and Design of
Number-Theoretic Algorithms. A 1984 ACM Distinguished Dissertation.
The MIT Press, 1985.
[Bach 1990] E. Bach. Explicit bounds for primality testing and related problems.
Math. Comp., pages 355–380, 1990.
[Bach 1991] E. Bach. Toward a theory of Pollard’s rho method. Inform. and
Comput., 90:139–155, 1991.
[Bach 1997a] E. Bach. The complexity of number-theoretic constants. Inform.
Process. Lett., 62:145–152, 1997.
[Bach 1997b] E. Bach. Comments on search procedures for primitive roots. Math.
Comp., 66(220):1719–1727, 1997.