B. Beckermann, A reliable method for computing M-Padé approximants on arbitrary staircases, J. Comput. Appl. Math, vol.40, issue.1, pp.19-42, 1992.

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 and G. Labahn, Recursiveness in matrix rational interpolation problems, J. Comput. Appl. Math, vol.77, pp.120-123, 1997.

B. Beckermann and G. Labahn, Fraction-free computation of matrix rational interpolants and matrix gcds, SIAM J. Matrix Anal. Appl, vol.22, issue.1, pp.114-144, 2000.

B. Beckermann, G. Labahn, and G. Villard, Shifted normal forms of polynomial matrices, ISSAC'99. ACM, pp.189-196, 1999.

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

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

D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput, vol.9, issue.3, pp.251-280, 1990.

D. S. Dummit and R. M. Foote, Abstract Algebra, 2004.

J. Forney and G. D. , Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems, SIAM Journal on Control, vol.13, issue.3, pp.493-520, 1975.

P. Giorgi, C. Jeannerod, and G. Villard, On the complexity of polynomial matrix computations, ISSAC'03. ACM, pp.135-142, 2003.
URL : https://hal.archives-ouvertes.fr/hal-02101878

S. Gupta and A. Storjohann, Computing Hermite forms of polynomial matrices, ISSAC'11. ACM, pp.155-162, 2011.

D. Harvey, J. Van-der-hoeven, and G. Lecerf, Faster polynomial multiplication over finite fields, J. ACM, vol.63, issue.6, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01022757

C. Jeannerod, V. Neiger, E. Schost, and G. Villard, Fast computation of minimal interpolation bases in Popov form for arbitrary shifts, ISSAC'16. ACM, pp.295-302, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01265983

C. Jeannerod, V. Neiger, E. Schost, and G. Villard, Computing minimal interpolation bases, J. Symbolic Comput, vol.83, pp.272-314, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01241781

T. Kailath, Linear Systems, 1980.

D. E. Knuth, The analysis of algorithms, Congrès int. Math, vol.3, pp.269-274, 1970.

L. Gall and F. , Powers of tensors and fast matrix multiplication, pp.296-303, 2014.

R. T. Moenck, Fast computation of GCDs, Proc. 5th ACM Symp. Theory Comp, pp.142-151, 1973.

T. Mulders and A. Storjohann, On lattice reduction for polynomial matrices, J. Symbolic Comput, vol.35, pp.139-145, 2003.

V. Neiger, Fast computation of shifted Popov forms of polynomial matrices via systems of modular polynomial equations, ISSAC'16. ACM, pp.365-372, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01266014

V. M. Popov, Invariant description of linear, time-invariant controllable systems, SIAM Journal on Control, vol.10, issue.2, pp.252-264, 1972.

J. Rosenkilde and A. Storjohann, Algorithms for simultaneous Padé approximations, ISSAC'16, pp.405-412, 2016.

S. Sarkar and A. Storjohann, Normalization of row reduced matrices, ISSAC'11. ACM, pp.297-304, 2011.

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

A. Storjohann, Algorithms for matrix canonical forms, 2000.

A. Storjohann, High-order lifting and integrality certification, J. Symbolic Comput, vol.36, issue.3-4, pp.613-648, 2003.

A. Storjohann, Notes on computing minimal approximant bases, Challenges in Symbolic Computation Software. Dagstuhl Seminar Proceedings, pp.1-6, 2006.

M. Van-barel and A. Bultheel, The computation of non-perfect Padé-Hermite approximants, Numer. Algorithms, vol.1, issue.3, pp.285-304, 1991.

M. Van-barel and A. Bultheel, A general module theoretic framework for vector M-Padé and matrix rational interpolation, Numer. Algorithms, vol.3, pp.451-462, 1992.

W. Zhou and G. Labahn, Efficient algorithms for order basis computation, J. Symbolic Comput, vol.47, issue.7, pp.793-819, 2012.