Artin prime producing quadratics

Fix an integer g. The primes p such that g is a primitive root for p are called Artin primes. Using a mixture of heuristics, well-known conjectures and rigorous arguments an algorithm is given to find quadratics that produce many Artin primes. Using this algorithm Y. GALLOT has found a g and a quadratic f such that the first 31082 primes produced by f have g as a primitive root. There is a connection with finding integers d such that L(2, (d/.)) is small.