Multiplication algorithms : bilinear complexity and fast asymptotic methods
Svyatoslav Covanov (2018).
PhD thesis, Université de Lorraine, Nancy, France. PhD directors: Emmanuel Thomé and Jérémie Detrey.
List of papers
Big Prime Field FFT on Multi-core Processors
Svyatoslav Covanov, Davood Mohajerani, Marc Moreno Maza, Lin-Xiao Wang (2017).
Accepted in: ISSAC '19 Proceedings of the 2019 ACM on International Symposium on Symbolic and Algebraic Computation
Improved method to find optimal formulae for bilinear maps
Svyatoslav Covanov (2019).
Published in: Theoretical Computer Science, 2019.
Fast integer multiplication using generalized Fermat primes
Svyatoslav Covanov, Emmanuel Thomé (2018).
Published in: Mathematics of Computation, 2018
Big Prime Field FFT on the GPU
Liangyu Chen, Svyatoslav Covanov, Davood Mohajerani, Marc Moreno Maza (2017).
ISSAC '17 Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation
Parallel Integer Polynomial Multiplication
Changbo Chen, Svyatoslav Covanov, Farnam Mansouri, Marc Moreno Maza, Ning Xie, Yuzhen Xie (2016).
Published in: Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2016 18th International Symposium
The Basic Polynomial Algebra Subprograms
Changbo Chen, Svyatoslav Covanov, Farnam Mansouri, Marc Moreno Maza, Ning Xie, Yuzhen Xie (2014).
Proceedings of ICMS 2014 - 4th International Congress,
Seoul, South Korea,
Lecture Notes in Computer Science, volume 8592, pages 669-676.
List of reports
Putting Fürer Algorithm into Practice
Svyatoslav Covanov, Marc Moreno Mazza (2014).
Research internship report made for the MPRI (Master of research in computer science), during my 4th year in the Ecole Polytechnique.
Efficient implementation of an algorithm multiplying big numbers (in french)
Svyatoslav Covanov, Emmanuel Thomé (2013).
Research internship report made for the third year of the Ecole Polytechnique.