180 citations · 274 across the 40 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.NT2013★ 1 cited
Quadratic Non-residues in Short Intervals
Sergei V. Konyagin, Igor E. Shparlinski
We use the Burgess bound and combinatorial sieve to obtain an upper bound on the number of primes in a dyadic interval for which a given interval does n…
math.NT2013
Character Sums and Deterministic Polynomial Root Finding in Finite Fields
Jean Bourgain, Sergei Konyagin, Igor Shparlinski
We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding r…
math.NT2013
Functional Graphs of Polynomials over Finite Fields
Sergei V. Konyagin, Florian Luca, Bernard Mans +3
Given a function in a finite field of elements, we define the functional graph of as a directed graph on nodes labelled by the elements of ${\mathbb…