Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Two fast parallel prime number sieves

From MaRDI portal
Publication:1336051
Jump to:navigation, search

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


zbMATH Keywords

globally shared memory


Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1336051&oldid=13466497"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:12.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki