This paper describes a sieving algorithm which in a cached memory environment may be superior to familiar "cross out bits" versions of the sieve of Eratosthenes. The algorithm also seems to show some advantages over "classical" versions of the sieve of Eratosthenes when adapted to the problem of factoring numbers in an interval.
CITATION STYLE
Galway, W. F. (1998). Robert bennion’s “hopping sieve.” In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1423, pp. 169–178). Springer Verlag. https://doi.org/10.1007/bfb0054860
Mendeley helps you to discover research relevant for your work.