Prime Numbers

REFERENCES 561
[Kuipers and Niederreiter 1974] L. Kuipers and H. Niederreiter. Uniform
Distribution of Sequences. John Wiley and Sons, 1974.
[Kurlberg and Pomerance 2004] P. Kurlberg and C. Pomerance. On the periods of
the linear congruential and power generators. Preprint, 2004.
[Lagarias 1990] J. Lagarias. Pseudorandom number generators in cryptography
and number theory. In C. Pomerance, editor, Cryptology and
computational number theory, volume 42 of Proc. Sympos. Appl. Math.,
pages 115–143. Amer. Math. Soc., 1990.
[Lagarias 1999] J. Lagarias. On a positivity property of the Riemann ξ-function.
Acta Arith., 89:217–234, 1999.
[Lagarias et al. 1985] J. Lagarias, V. Miller, and A. Odlyzko. Computing π(x): the
Meissel-Lehmer method. Math. Comp., 44:537–560, 1985.
[Lagarias and Odlyzko 1987] J. Lagarias and A. Odlyzko. Computing π(x): an
analytic method. J. Algorithms, 8:173–191, 1987.
[Languasco 2000] A. Languasco. Some refinements of error terms estimates for
certain additive problems with primes. J. Number Theory, 81:149–161,
2000.
[Lavenier and Saouter 1998] D. Lavenier and Y. Saouter. Computing Goldbach
Partitions Using Pseudo-random Bit Generator Operators on a FPGA
Systolic Array. Lecture Notes in Computer Science, Springer–Verlag,
1482:316, 1998.
[L’Ecuyer and Simard 1999] P. L’Ecuyer and R. Simard. Beware of linear
congruential generators with multipliers of the form a = ±2 q ± 2 r . ACM
Trans. Math. Soft., 25:367–374, 1999.
[Lehman 1974] R. Lehman. Factoring large integers. Math. Comp., 28:637–646,
1974.
[Lehmer 1964] E. Lehmer. On the infinitude of Fibonacci pseudo-primes.
Fibonacci Quart., 2:229–230, 1964.
[Lenstra 1983] A. Lenstra. Factoring polynomials over algebraic number fields. In
Computer algebra (London, 1983), volume 162 of Lecture Notes in
Computer Science, pages 245–254. Springer—Verlag, 1983.
[Lenstra and Lenstra 1993] A. Lenstra and H. Lenstra, Jr., editors. The
development of the number field sieve, volume 1554 of Lecture Notes in
Mathematics. Springer—Verlag, 1993.
[Lenstra et al. 1982] A. Lenstra, H. Lenstra, Jr., and L. Lovasz. Factoring
polynomials with rational coefficients. Math. Ann., 261:515–534, 1982.
[Lenstra et al. 1993a] A. Lenstra, H. Lenstra, Jr., M. Manasse, and J. Pollard. The
factorization of the ninth Fermat number. Math. Comp., 61:319–349,
1993.
[Lenstra and Manasse 1994] A. Lenstra and M. Manasse. Factoring with two large
primes. Math. Comp., 63:785–798, 1994.