The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
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
Riemann's Hypothesis and tests for primality
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
A practical sieve algorithm finding prime numbers
Communications of the ACM
An Exercise in Program Explanation
ACM Transactions on Programming Languages and Systems (TOPLAS)
A sublinear additive sieve for finding prime number
Communications of the ACM
CGCExplorer: a semi-automated search procedure for provably correct concurrent collectors
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
A general framework for certifying garbage collectors and their mutators
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
| Hi-index | 48.25 |
A new algorithm is presented for finding all primes between 2 and n. The algorithm executes in time proportional to n (assuming that multiplication of integers not larger than n can be performed in unit time). The method has the same arithmetic complexity as the algorithm presented by Mairson [6]; however, our version is perhaps simpler and more elegant. It is also easily extended to find the prime factorization of all integers between 2 and n in time proportional to n.