Svyatoslav Covanov

Affiliations:
  • University of Lorraine, France


According to our database1, Svyatoslav Covanov authored at least 11 papers between 2014 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Improved method for finding optimal formulas for bilinear maps in a finite field.
Theor. Comput. Sci., 2019

Fast integer multiplication using \goodbreak generalized Fermat primes.
Math. Comput., 2019

Big Prime Field FFT on Multi-core Processors.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

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

Putting Fürer Algorithm into Practice with the BPAS Library.
CoRR, 2018

2017
Improved method to find optimal formulae for bilinear maps.
CoRR, 2017

Big Prime Field FFT on the GPU.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016
The basic polynomial algebra subprograms.
ACM Commun. Comput. Algebra, 2016

Parallel Integer Polynomial Multiplication.
Proceedings of the 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2016

2015
Fast arithmetic for faster integer multiplication.
CoRR, 2015

2014
Basic Polynomial Algebra Subprograms.
ACM Commun. Comput. Algebra, 2014


  Loading...