Basic Polynomial Algebra Subprograms. - Changbo Chen; Svyatoslav Covanov; Farnam Mansouri; Marc Moreno Maza; Ning Xie 001; Yuzhen Xie (ACM Commun. Comput. Algebra, 2014)

Fast arithmetic for faster integer multiplication. - Svyatoslav Covanov; Emmanuel Thomé (CoRR, 2015)

Parallel Integer Polynomial Multiplication. - Changbo Chen; Svyatoslav Covanov; Farnam Mansouri; Marc Moreno Maza; Ning Xie 001; Yuzhen Xie (SYNASC, 2016)

The basic polynomial algebra subprograms. - Changbo Chen; Svyatoslav Covanov; Farnam Mansouri; Robert H. C. Moir; Marc Moreno Maza; Ning Xie 001; Yuzhen Xie (ACM Commun. Comput. Algebra, 2016)

Big Prime Field FFT on the GPU. - Liangyu Chen 001; Svyatoslav Covanov; Davood Mohajerani; Marc Moreno Maza (ISSAC, 2017)

Improved method to find optimal formulae for bilinear maps. - Svyatoslav Covanov (CoRR, 2017)

Putting Fürer Algorithm into Practice with the BPAS Library. - Sviatoslav Covanov; Davood Mohajerani; Marc Moreno Maza; Lin-Xiao Wang (CoRR, 2018)

Multiplication algorithms : bilinear complexity and fast asymptotic methods. (Algorithmes de multiplication : complexité bilinéaire et méthodes asymptotiquement rapides). - Svyatoslav Covanov (2018)

Big Prime Field FFT on Multi-core Processors. - Svyatoslav Covanov; Davood Mohajerani; Marc Moreno Maza; Lin-Xiao Wang (ISSAC, 2019)

Fast integer multiplication using goodbreak generalized Fermat primes. - Svyatoslav Covanov; Emmanuel Thomé (Math. Comput., 2019)

Improved method for finding optimal formulas for bilinear maps in a finite field. - Svyatoslav Covanov (Theor. Comput. Sci., 2019)