The Prime Page's Links++: programs/sieves

Eratosthenes (13): The Sieve of Eratosthenes is perhaps the quickest way to find all of the primes in a range (such as all the primes below 1000000). This page contains links to information about, and various versions of, the Sieve of Eratosthenes.

binary quadratic (1): It is possible to generalize the Sieve of Eratosthenes using irreducible quadratic forms. Atkin and Bernstein have shown that such sieves compete favorably with the Sieve of Eratosthenes both theoretically and in practice.