Two fast parallel prime number sieves
From MaRDI portal
Publication:1336051
DOI10.1006/inco.1994.1082zbMath0807.68049OpenAlexW1996893421MaRDI QIDQ1336051
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
Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Primality (11Y11)
Related Items (6)
Two compact incremental prime sieves ⋮ Statistical Evidence for Small Generating Sets ⋮ A space-efficient fast prime number sieve ⋮ A randomized sublinear time parallel GCD algorithm for the EREW PRAM ⋮ An improved sieve of Eratosthenes ⋮ Modular exponentiation via the explicit Chinese remainder theorem
This page was built for publication: Two fast parallel prime number sieves