A sublinear additive sieve for finding prime number
Communications of the ACM
A linear sieve algorithm for finding prime numbers
Communications of the ACM
Some new upper bounds on the generation of prime numbers
Communications of the ACM
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
An accurate computation of the hypergeometric distribution function
ACM Transactions on Mathematical Software (TOMS)
A SCOOPP Evaluation on Packing Parallel Objects in Run-Time
VECPAR '00 Selected Papers and Invited Talks from the 4th International Conference on Vector and Parallel Processing
| Hi-index | 48.22 |
Based on the sieve of Eratosthenes, a faster and more compact algorithm is presented for finding all primes between 2 and N.