J. Zur-gathen and J. Gerhard, Modern Computer Algebra, 2003.
DOI : 10.1017/CBO9781139856065

R. D. Jenks and R. S. Sutor, Axiom, the scientific computation system, 1992.

W. Bosma, J. Cannon, and C. Playoust, The Magma Algebra System I: The User Language, Journal of Symbolic Computation, vol.24, issue.3-4, pp.3-4, 1997.
DOI : 10.1006/jsco.1996.0125

V. Shoup, NTL: A library for doing number theory

W. Hart, F. Johansson, and S. Pancratz, FLINT: Fast Library for Number Theory
DOI : 10.1007/978-3-642-15582-6_18
URL : http://wrap.warwick.ac.uk/41629/1/WRAP_Hart_0584144-ma-270913-flint-extended-abstract.pdf

M. Püschel, J. M. Moura, J. Johnson, D. Padua, M. Veloso et al., SPIRAL: Code Generation for DSP Transforms, Proceedings of the IEEE, pp.232-275, 2005.
DOI : 10.1109/JPROC.2004.840306

M. Frigo and S. G. Johnson, The Design and Implementation of FFTW3, Proceedings of the IEEE, pp.216-231, 2005.
DOI : 10.1109/JPROC.2004.840301

M. Gastineau and J. Laskar, Highly Scalable Multiplication for Distributed Sparse Multivariate Polynomials on Many-Core Systems, CASC, 2013, pp.100-115
DOI : 10.1007/978-3-319-02297-0_8
URL : http://arxiv.org/abs/1303.7425

M. B. Monagan and R. Pearce, Parallel sparse polynomial multiplication using heaps, Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pp.263-270, 2009.
DOI : 10.1145/1576702.1576739
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.9078

M. , M. Maza, and Y. Xie, FFT-based dense polynomial arithmetic on multi-cores, HPCS, ser, pp.378-399, 2009.

D. Harvey, Faster polynomial multiplication via multipoint Kronecker substitution, Journal of Symbolic Computation, vol.44, issue.10, pp.1502-1510, 2009.
DOI : 10.1016/j.jsc.2009.05.004
URL : http://doi.org/10.1016/j.jsc.2009.05.004

M. Bodrato and A. Zanoni, Integer and polynomial multiplication, Proceedings of the 2007 international symposium on Symbolic and algebraic computation , ISSAC '07, pp.17-24, 2007.
DOI : 10.1145/1277548.1277552

A. Schönhage and V. Strassen, Fast multiplication of large numbers, Computing, vol.150, issue.3-4, pp.281-292, 1971.
DOI : 10.1007/BF02242355

T. Granlund, GNU MP 6.0 Multiple Precision Arithmetic Library. Samurai Media Limited, 2015.

P. Gaudry, A. Kruppa, and P. Zimmermann, A GMP-based implementation of Schönhage-Strassen's large integer multiplication algorithm, ISSAC, pp.167-174, 2007.

L. Meng, Y. Voronenko, J. R. Johnson, M. Moreno-maza, F. Franchetti et al., Spiral-generated modular FFT algorithms, Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, PASCO '10, pp.169-170, 2010.
DOI : 10.1145/1837210.1837235

A. Chmielowiec, Parallel algorithm for multiplying integer polynomials and integers, " in IAENG Transactions on Engineering Technologies, ser. Lecture Notes in Electrical Engineering, pp.605-616, 2013.

M. Fürer, Faster Integer Multiplication, SIAM Journal on Computing, vol.39, issue.3, pp.979-1005, 2009.
DOI : 10.1137/070711761

F. Mansouri, On the parallelization of integer polynomial multiplication Master's thesis, The University of Western Ontario

C. Chen, M. M. Maza, and Y. Xie, Cache complexity and multicore implementation for univariate real root isolation, J. of Physics: Conference Series, vol.341, 2011.
DOI : 10.1145/1940475.1940483
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.6393

J. Zur-gathen and J. Gerhard, Fast algorithms for Taylor shifts and certain difference equations, Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.40-47, 1997.
DOI : 10.1145/258726.258745

C. Chen, S. Covanov, F. Mansouri, M. Moreno-maza, N. Xie et al., The basic polynomial algebra subprograms, International Congress on Mathematical Software, pp.669-676, 2014.
DOI : 10.1145/3015306.3015312
URL : https://hal.archives-ouvertes.fr/hal-01404718

R. D. Blumofe and C. E. Leiserson, Space-Efficient Scheduling of Multithreaded Computations, SIAM Journal on Computing, vol.27, issue.1, pp.202-229, 1998.
DOI : 10.1137/S0097539793259471

A. Schönhage, A. F. Grotefeld, and E. Vetter, Fast algorithms -a multitape Turing machine implementation. BI- Wissenschaftsverlag, 1994.

C. E. Leiserson, The Cilk++ concurrency platform, The Journal of Supercomputing, vol.8, issue.2, pp.244-257, 2010.
DOI : 10.1007/s11227-010-0405-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.462.8573

L. J. Stockmeyer and U. Vishkin, Simulation of Parallel Random Access Machines by Circuits, SIAM Journal on Computing, vol.13, issue.2, pp.409-422, 1984.
DOI : 10.1137/0213027

P. B. Gibbons, A more practical PRAM model, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures , SPAA '89, pp.158-168, 1989.
DOI : 10.1145/72935.72953
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.564.6271

M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran, Cache-oblivious algorithms, ACM Transactions on Algorithms, vol.8, issue.1, p.4, 2012.
DOI : 10.1109/sffcs.1999.814600

D. Harvey, J. Van-der-hoeven, and G. Lecerf, Even faster integer multiplication, Journal of Complexity, vol.36, 2016.
DOI : 10.1016/j.jco.2016.03.001
URL : https://hal.archives-ouvertes.fr/hal-01022749

S. Covanov and M. M. Maza, Putting Fürer algorithm into practice, Tech. Rep, 2014.

S. Covanov and E. Thomé, Fast integer multiplication using generalized Fermat primes Available: https, 2016.

A. Pospelov, Faster polynomial multiplication via discrete Fourier transforms, " in CSR, ser. Lecture Notes in Computer Science, pp.91-104, 2011.
DOI : 10.1007/978-3-642-20712-9_8
URL : http://arxiv.org/abs/1010.1101

A. De, P. P. Kurur, C. Saha, and R. Saptharishi, Fast Integer Multiplication Using Modular Arithmetic, SIAM Journal on Computing, vol.42, issue.2, pp.685-699, 2013.
DOI : 10.1137/100811167
URL : http://arxiv.org/abs/0801.1416

L. Meng and J. R. Johnson, Automatic Parallel Library Generation for General-Size Modular FFT Algorithms, CASC, 2013, pp.243-256
DOI : 10.1007/978-3-319-02297-0_21