A linear sieve algorithm for finding prime numbers

DOI10.1145/359657.359660MaRDI QIDQ4168065zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Cited in

(6)

• An incremental primal sieve
• Space-time trade off in implementing certain set operations
• Fast algorithms for abelian periods in words and greatest common divisor queries
• DENSITY AND DISTRIBUTION OF PRIMES
• Empirical verification of a generalization of Goldbach's conjecture
• A space-efficient fast prime number sieve

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4168065)