Two fast parallel prime number sieves

DOI10.1006/INCO.1994.1082MaRDI QIDQ1336051zbMATH OpenOpenAlexFDO

Authors Ian Parberry, Jonathan P. Sorenson

Publication date 12 October 1994

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1994.1082

zbMATH Keywords

globally shared memory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Primality (11Y11)

Recommendations

• A space-efficient fast prime number sieve
• Fast compact prime number sieves (among others)
• Linear prime-number sieves: A family tree
• scientific article; zbMATH DE number 1186941
• Cache optimized sieve

Cited in

(11)

• Statistical Evidence for Small Generating Sets
• Modular exponentiation via the explicit Chinese remainder theorem
• The I/O complexity of computing prime tables
• An improved sieve of Eratosthenes
• Linear prime-number sieves: A family tree
• A space-efficient fast prime number sieve
• scientific article; zbMATH DE number 5670033 (Why is no real title available?)
• Prime numbers as a tool to design distributed algorithms
• Two compact incremental prime sieves
• Parallel implementations of Brunotte's algorithm
• A randomized sublinear time parallel GCD algorithm for the EREW PRAM

This page was built for publication: Two fast parallel prime number sieves

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