Dissecting a sieve to cut its need for space

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1838, Issue , 2000, Pages 297-312

  Galway, William F ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NUMBER THEORY;

ARITHMETIC OPERATIONS; DIRICHLET; EXPECTED RUNNING TIME;

DISSECTION;

EID: 84910147434     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722028_17     Document Type: Conference Paper

References (20)

1. A. O. L. Atkin and D. J. Bernstein, Prime sieves using binary quadratic forms, Dep. of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, 60607-7045. Preprint available at http://pobox.com/~djb/papers/primesieves.dvi, 1999.
2. M. Deléglise and J. Rivat, Computing ϕ(x): the Meissel, Lehmer, Lagarias, Miller, Odlyzko method, Mathematics of Computation 65 (1996), no. 213, 235-245.
3. Kevin Dowd and Charles R. Severance, High performance computing, secon ed., O’Reilly and Associates, Inc., 101 Morris Street, Sebastopol, CA 95472, 1998.
4. William F. Galway, Robert Bennion’s "hopping sieve", Algorithmic Number Theory (ANTS-III) (Joe P. Buhler, ed.), Lecture Notes in Computer Science, vol. 1423, Springer, Berlin, June 1998, pp. 169-178.
5. William F. Galway, Analytic computation of the prime-counting function, Ph.D. thesis, University of Illinois at Urbana-Champaign, 2000, (expected).
6. G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, fifth ed., Oxford University Press, Oxford, 1979.
7. M. N. Huxley, Area, lattice points, and exponential sums, London Mathematical Society Monographs, New Series, vol. 13, The Clarendon Press, Oxford University Press, New York, 1996, Oxford Science Publications.
8. Aleksandar Ivić, The Riemann zeta-function, John Wiley & Sons, New York, 1985.
9. Donald E. Knuth, The art of computer programming, second ed., vol. 1: Fundamental Algorithms, Addison-Wesley, Reading, Massachusetts, 1973.
10. J. C. Lagarias, V. S. Miller, and A. M. Odlyzko, Computing ϕ(x): The Meissel Lehmer method, Mathematics of Computation 44 (1985), no. 170, 537-560.
11. J. C. Lagarias and A. M. Odlyzko, Computing ϕ(x): an analytic method, Journal of Algorithms 8 (1987), no. 2, 173-191.
12. D. H. Lehmer and Emma Lehmer, A new factorization technique using quadratic forms, Mathematics of Computation 28 (1974), 625-635.
13. 14 of the twin primes and Brun’s constant, Virginia J. Sci. 46 (1995), no. 3, 195-204.
14. Thomas R. Nicely, New maximal prime gaps and first occurrences, Mathematics of Computation 68 (1999), no. 227, 1311-1315.
15. Hans Riesel, Prime numbers and computer methods for factorization, second ed., Progress in Mathematics, vol. 126, Birkhäuser, Boston, MA, 1994.
16. Wacław Sierpiński, Sur un problème du calcul des fonctions asymptotiques, 1906, Oeuvres choisies, Tome I, PWN-Éditions Scientifiques de Pologne, Warsaw, 1974, pp. 73-108.
17. Jonathan P. Sorenson, Trading time for space in prime number sieves, Algorithmic Number Theory (ANTS-III) (Joe P. Buhler, ed.), Lecture Notes in Computer Science, vol. 1423, Springer, Berlin, June 1998, pp. 179-195.
18. Gérald Tenenbaum, Introduction to analytic and probabilistic number theory, Cam-bridge University Press, Cambridge, 1995.
19. J. G. van der Corput, Über Gitterpunkte in der Ebene, Mathematische Annalen 81 (1920), 1-20.
20. Georges Voronoï, Sur un problème du calcul des fonctions asymptotiques, J. Reine Angew. Math. 126 (1903), 241-282.