D. J. Bernstein, Fast multiplication and its applications

A. Bostan, F. Chyzak, and N. L. Roux, Skew-polynomial products by evaluation and interpolation

A. Bostan, F. Chyzak, Z. Li, and B. Salvy, Common multiples of linear ordinary differential and difference operators

A. Bostan and . Schost, Polynomial evaluation and interpolation on special sets of points, Journal of Complexity, vol.21, issue.4, pp.420-446, 2005.
DOI : 10.1016/j.jco.2004.09.009

D. G. Cantor and E. Kaltofen, On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.7, issue.7, pp.693-701, 1991.
DOI : 10.1007/BF01178683

D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.251-280, 1990.
DOI : 10.1145/28395.28396
URL : http://doi.org/10.1016/s0747-7171(08)80013-2

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

J. Zur-gathen and J. Gerhard, Modern computer algebra, 1999.
DOI : 10.1017/CBO9781139856065

J. Gerhard, Modular algorithms for polynomial basis conversion and greatest factorial factorization, RWCA'00, pp.125-141, 2000.

J. Van-der-hoeven, FFT-like Multiplication of Linear Differential Operators, Journal of Symbolic Computation, vol.33, issue.1, pp.123-127, 2002.
DOI : 10.1006/jsco.2000.0496

I. Kaporin, The aggregation and cancellation techniques as a practical tool for faster matrix multiplication, Theoretical Computer Science, vol.315, issue.2-3, pp.469-510, 2004.
DOI : 10.1016/j.tcs.2004.01.004

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

V. Strassen, Gaussian elimination is not optimal, Numerische Mathematik, vol.13, issue.4, pp.354-356, 1969.
DOI : 10.1007/BF02165411