On the Complexity of Approximate Realization of Continuous Functions by Schemes and Formulas in Continuous Bases. - Sergej B. Gashkov (FCT, 1987)

The Berlekamp-Massey Algorithm. A Sight from Theory of Pade Approximants and Orthogonal Polynomials. - Sergej B. Gashkov; Igor Gashkov (International Conference on Computational Science, 2004)

On Hardware and Software Implementation of Arithmetic in Finite Fields of Characteristic 7 for Calculation of Pairings. - Sergej B. Gashkov; Anatoli A. Bolotov; Alexej A. Burtzev; Alexander Frolov; Sergei Zhebet (DepCoS-RELCOMEX, 2009)

Some Remarks on Testing Irreducibility of Polynomials and Normality of Bases in Finite Fields. - Sergej B. Gashkov; Igor Gashkov (Fundam. Informaticae, 2010)

Arithmetic in the Finite Fields Using Optimal Normal and Polynomial Bases in Combination. - Sergej B. Gashkov; Alexander Frolov; Sergej Lukin; Olga Sukhanova (DepCoS-RELCOMEX, 2015)

Arithmetic in Finite Fields Supporting Type-2 or Type-3 Optimal Normal Bases. - Sergej B. Gashkov; Alexander Frolov; Igor Sergeev (DepCoS-RELCOMEX, 2016)