A. V. Aho, K. Steiglitz, and J. D. Ullman, Evaluating Polynomials at Fixed Sets of Points, SIAM Journal on Computing, vol.4, issue.4, pp.533-539, 1975.
DOI : 10.1137/0204045

A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The design and analysis of computer algorithms, 1974.

A. Benoit, A. Bostan, and J. Van-der-hoeven, Fast multiplication of skew polynomials

D. Bini and V. Y. Pan, Polynomial and matrix computations, Progress in Theoretical Computer Science, 1994.
DOI : 10.1007/978-1-4612-0265-3

A. Bostan, F. Chyzak, Z. Li, and B. Salvy, Fast computation of common left multiples of linear ordinary differential operators
URL : https://hal.archives-ouvertes.fr/hal-00698610

A. Bostan, F. Chyzak, and N. L. Roux, Products of ordinary differential operators by evaluation and interpolation, Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, ISSAC '08, pp.23-30, 2008.
DOI : 10.1145/1390768.1390775
URL : https://hal.archives-ouvertes.fr/inria-00273148

E. Brassinne, Analogie des équations différentielles linéaires à coefficients variables, avec les équations algébriques, Note III du Tome 2 du Cours d'analyse de Ch. Sturm, École polytechnique, 2ème édition, pp.331-347, 1864.

P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic complexity theory, 1997.
DOI : 10.1007/978-3-662-03338-8

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

Y. Francis and . Chin, A generalized asymptotic upper bound on fast polynomial evaluation and interpolation, SIAM J. Comput, vol.5, issue.4, pp.682-690, 1976.

W. James, J. W. Cooley, and . Tukey, An algorithm for the machine calculation of complex Fourier series, Mathematics of Computation, vol.19, pp.297-301, 1965.

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

S. S. Demidov, On the history of the theory of linear differential equations, Archive for History of Exact Sciences, vol.2, issue.3, pp.369-387, 1983.
DOI : 10.1007/BF00328044

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

D. Yu and . Grigor-ev, Complexity of factoring and calculating the GCD of linear ordinary differential operators, J. Symbolic Comput, vol.10, issue.1, pp.7-37, 1990.

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

J. Van-der-hoeven, On the complexity of skew arithmetic, Applicable Algebra in Engineering, Communication and Computing, vol.34, issue.1, 2011.
DOI : 10.1007/s00200-015-0269-0
URL : https://hal.archives-ouvertes.fr/hal-00557750

G. Libri, Mémoire sur la résolution des équations algébriques dont les racines ont entre elles un rapport donné, et sur l'intégration des équations différentielles linéaires dont les intégrales particulières peuvent s'exprimer les unes par les autres, J. Reine Angew. Math, vol.10, pp.167-194, 1833.

R. T. Moenck, Another polynomial homomorphism, Acta Informatica, vol.9, issue.2, pp.153-169, 1976.
DOI : 10.1007/BF00268498

V. Olshevsky and A. Shokrollahi, Matrix-vector product for confluent Cauchylike matrices with application to confluent rational interpolation, Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp.573-581, 2000.

O. Ore, Formale Theorie der linearen Differentialgleichungen, J. Reine Angew. Math, vol.167, pp.221-234, 1932.

O. Ore, Theory of Non-Commutative Polynomials, The Annals of Mathematics, vol.34, issue.3, pp.480-508, 1933.
DOI : 10.2307/1968173

V. Pan, How to multiply matrices faster, Lecture Notes in Computer Science, vol.179, 1984.
DOI : 10.1007/3-540-13866-8

Y. Victor and . Pan, Structured matrices and polynomials, Birkhäuser Boston Inc, 2001.

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

A. Stothers, On the Complexity of Matrix Multiplication, 2010.

V. Strassen, Gaussian elimination is not optimal, Numerische Mathematik, vol.13, issue.4, pp.354-356, 1969.
DOI : 10.1007/BF02165411
URL : http://www.digizeitschriften.de/download/PPN362160546_0013/PPN362160546_0013___log38.pdf

V. and V. Williams, Multiplying matrices faster than coppersmith-winograd, Proceedings of the 44th symposium on Theory of Computing, STOC '12, 2012.
DOI : 10.1145/2213977.2214056
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.2680

U. Pierre and M. Curie, France) E-mail address: Alexandre.Benoit@lip6.fr INRIA (France) E-mail address: Alin.Bostan@inria.fr CNRS & École polytechnique (France) E-mail address: vdhoeven@lix.polytechnique