B. Beckermann and G. Labahn, A uniform approach for the fast computation of matrix-type Padé approximants, SIAM J. Matrix Anal. Appl, vol.15, issue.3, pp.804-823, 1994.

B. Beckermann, G. Labahn, and G. Villard, Normal forms for general polynomial matrices, Journal of Symbolic Computation
DOI : 10.1016/j.jsc.2006.02.001

URL : https://hal.archives-ouvertes.fr/hal-02101933

A. Bostan and . Schost, Polynomial evaluation and interpolation on special sets of points, Journal of Complexity, vol.21, issue.4, pp.420-446, 2005.

B. Bürgisser, C. Clausen, and M. A. Shokrollahi, Algebraic Complexity Theory, volume 315 of Grundlehren der mathematischen Wissenschaften, 1997.

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

G. D. Forney, Minimal bases of rational vector spaces, with applications to multivariable linear systems, SIAM J. Control, vol.13, pp.493-520, 1975.

J. Zur-gathen and J. Gerhard, Modern Computer Algebra, 1999.

P. Giorgi, C. Jeannerod, and G. Villard, On the complexity of polynomial matrix computations, Proc. International Symposium on Symbolic and Algebraic Computation, pp.135-142, 2003.
URL : https://hal.archives-ouvertes.fr/hal-02101878

C. Jeannerod and G. Villard, Essentially optimal computation of the inverse of generic polynomial matrices, Journal of Complexity, vol.21, issue.1, pp.72-86, 2005.

T. Kailath, Linear Systems, 1980.

E. Kaltofen, On computing determinants without divisions, International Symposium on Symbolic and Algebraic Computation, pp.342-349, 1992.
DOI : 10.1145/143242.143350

E. Kaltofen and G. Villard, On the complexity of computing determinants, Computational Complexity, vol.13, pp.91-130, 2004.
URL : https://hal.archives-ouvertes.fr/hal-02102099

D. E. Knuth, The analysis of algorithms, Proc. International Congress of Mathematicians, vol.3, pp.269-274, 1970.

C. Oar?aoar?a and A. Varga, Minimal degree coprime factorization of rational matrices, SIAM J. Matrix Anal. Appl, vol.21, pp.245-278, 1999.

A. Schönhage, Schnelle Berechnung von Kettenbruchenwicklungen, Acta Informatica, vol.1, pp.139-144, 1971.

A. Storjohann, High-order lifting and integrality certification, Special issue International Symposium on Symbolic and Algebraic Computation, vol.36, pp.613-648, 2002.
DOI : 10.1016/s0747-7171(03)00097-x

URL : https://doi.org/10.1016/s0747-7171(03)00097-x

A. Storjohann and G. Villard, Computing the rank and a small nullspace basis of a polynomial matrix, Proc. International Symposium on Symbolic and Algebraic Computation, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00004832