A space-efficient fast prime number sieve
From MaRDI portal
Publication:671385
DOI10.1016/0020-0190(96)00099-3zbMath0873.11071MaRDI QIDQ671385
Brian Dunten, Jonathan P. Sorenson, Julie C. Jones
Publication date: 27 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(96)00099-3
analysis of algorithms; design of algorithms; number theoretic algorithms; sieve of Eratosthenes; prime number sieve
Related Items
Prime sieves using binary quadratic forms, Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸, Two compact incremental prime sieves
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An incremental primal sieve
- Linear prime-number sieves: A family tree
- Explaining the wheel sieve
- Two fast parallel prime number sieves
- Fast compact prime number sieves (among others)
- A sublinear additive sieve for finding prime number
- The segmented sieve of eratosthenes and primes in arithmetic progressions to 1012
- A linear sieve algorithm for finding prime numbers
- Two Fast GCD Algorithms