A linear sieve algorithm for finding prime numbers

DOI10.1145/359657.359660zbMath0387.68030OpenAlexW1964428590WikidataQ56112620 ScholiaQ56112620MaRDI QIDQ4168065

David Gries, Jayadev Misra

Publication date: 1978

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/6407

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Primes (11A41) Algorithms in computer science (68W99)

Related Items (5)

An incremental primal sieve ⋮ Fast algorithms for abelian periods in words and greatest common divisor queries ⋮ DENSITY AND DISTRIBUTION OF PRIMES ⋮ A space-efficient fast prime number sieve ⋮ Space-time trade off in implementing certain set operations

This page was built for publication: A linear sieve algorithm for finding prime numbers