A variant of the large sieve inequality with explicit constants

We give an effective version with explicit constants of the large sieve inequality for imaginary quadratic fields. Explicit results of this kind are useful for estimating the computational complexity of algorithms which generate elements, whose norm is a rational prime, in an arithmetic progression of the corresponding ring of integers.

The large sieve inequality with square moduli for quadratic extensions of function fields

In this paper, we establish a version of the large sieve inequality with square moduli for imaginary quadratic extensions of rational function fields of odd characteristics.