A space-efficient fast prime number sieve

DOI10.1016/0020-0190(96)00099-3zbMath0873.11071OpenAlexW2058710356WikidataQ127373020 ScholiaQ127373020MaRDI 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

zbMATH Keywords

analysis of algorithmsdesign of algorithmsnumber theoretic algorithmssieve of Eratosthenesprime number sieve

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Primes (11A41) Primality (11Y11)

Related Items (3)

Two compact incremental prime sieves ⋮ Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸ ⋮ Prime sieves using binary quadratic forms

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

This page was built for publication: A space-efficient fast prime number sieve