Brian Dunten, Julie Jones, Jonathan Sorenson  Home/Search
Context Related
| ssrnet.snu.ac.kr/~parkmj/math_...pns.ps abyss.snu.ac.kr/~parkmj/math_p...pns.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ssrnet.snu.ac.kr/~parkmj...survey (more) From: abyss.snu.ac.kr/~parkmj/survey (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a new algorithm that finds all primes up to n using at most O(n= log log n) arithmetic operations and O(n=(log n log log n)) space. This algorithm is an improvement of a linear prime number sieve due to Pritchard. Our new algorithm matches the running time of the best previous prime number sieve, but uses less space by a factor of \Theta(log n). In addition, we present the results of our implementations of most known prime number sieves. Key Words: prime number sieve, sieve of... (Update)
Context of citations to this paper: More
...sieve of Pritchard [11] which uses O(n= log log n) arithmetic operations and O(n= log log n) bits of space. Dunten, Jones, and Sorenson [6] gave an algorithm with the same asymptotic running time, while using only O(n= log n log log n) bits of space. Pritchard also invented a...
Cited by: More
Trading Time for Space in Prime Number Sieves - Sorenson (Correct)
Active bibliography (related documents): More All
0.7: Iterated Absolute Values of Differences of Consecutive Primes - Odlyzko (Correct)
0.2: Prime Sieves Using Binary Quadratic Forms - Atkin, Bernstein (1999) (Correct)
0.2: Results And Estimates On Pseudopowers - Bach, Lukes, Shallit, Williams (1996) (Correct)
Similar documents based on text: More All
0.8: Sieve Methods - Charles (Correct)
0.5: The Combinatorics Behind Number-Theoretic Sieves - Chow (Correct)
0.5: Dense Admissible Sets - Gordon, Rodemich (Correct)
BibTeX entry: (Update)
Dunten, B., Jones, J., Sorenson, J. P.: A space-efficient fast prime number sieve. Information Processing Letters 59 (1996) 79--84 http://citeseer.ist.psu.edu/dunten96spaceefficient.html More
@article{ dunten96spaceefficient,
author = "Brian Dunten and Julie Jones and Jonathan Sorenson",
title = "A Space-Efficient Fast Prime Number Sieve",
journal = "Information Processing Letters",
volume = "59",
number = "2",
pages = "79-84",
year = "1996",
url = "citeseer.ist.psu.edu/dunten96spaceefficient.html" }
Citations (may not include all citations):16 An experiment in knowledge-based automatic programming (context) - Barstow - 1979
5 The segmented sieve of Eratosthenes and primes in arithmetic.. (context) - Bays, Hudson - 1977
2 An incremental primal sieve (context) - Bengelloun - 1986
1 Nicomachus of Gerasa: Introduction to Arithmetic (context) - D'ooge, Robbins et al. - 1926
Documents on the same site (http://ssrnet.snu.ac.kr/~parkmj/survey.html): More
The Loading Time Scheduling Problem - Bhatia, Khuller, Naor (1995) (Correct)
Operating System Support for Distributed Multimedia Applications; .. - Burkow (1994) (Correct)
Making Paths Explicit in the Scout Operating System - Mosberger, Peterson (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC