Linear prime-number sieves: A family tree

DOI10.1016/0167-6423(87)90024-4zbMath0627.68033OpenAlexW1997209544MaRDI QIDQ1092658

Paul A. Pritchard

Publication date: 1987

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(87)90024-4

zbMATH Keywords

prime listing algorithmsprime-number sieves

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Algorithms in computer science (68W99) Sieves (11N35)

Related Items (7)

Two compact incremental prime sieves ⋮ The Genuine Sieve of Eratosthenes ⋮ Finite Automata, Palindromes, Powers, and Patterns ⋮ A space-efficient fast prime number sieve ⋮ Iterated Absolute Values of Differences of Consecutive Primes ⋮ Opportunistic algorithms for eliminating supersets ⋮ Detecting palindromes, patterns and borders in regular languages

This page was built for publication: Linear prime-number sieves: A family tree