B. Beckermann and G. Labahn, A Uniform Approach for the Fast Computation of Matrix-Type Pad?? Approximants, SIAM Journal on Matrix Analysis and Applications, vol.15, issue.3, pp.804-823, 1994.
DOI : 10.1137/S0895479892230031

B. Beckermann, G. Labahn, and G. Villard, Shifted normal forms of polynomial matrices, Proceedings of the 1999 international symposium on Symbolic and algebraic computation , ISSAC '99, pp.189-196, 1999.
DOI : 10.1145/309831.309929

J. Berthomieu, J. Hoeven, and G. Lecerf, Relaxed algorithms for p-adic numbers, Journal de Th??orie des Nombres de Bordeaux, vol.23, issue.3, pp.541-577, 2011.
DOI : 10.5802/jtnb.777

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

L. Chen, W. Eberly, E. Kaltofen, B. D. Saunders, W. J. Turner et al., Efficient matrix preconditioners for black box linear algebra, Linear Algebra and its Applications, vol.343, issue.344, pp.343-344119, 2002.
DOI : 10.1016/S0024-3795(01)00472-4

D. Coppersmith, Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm, Mathematics of Computation, vol.62, issue.205, pp.333-350, 1994.
DOI : 10.2307/2153413

J. Dumas, P. Giorgi, P. Elbaz-vincent, and A. Uba?ska, Parallel computation of the rank of large sparse matrices from algebraic K-theory, Proceedings of the 2007 international workshop on Parallel symbolic computation, PASCO '07, pp.43-52, 2007.
DOI : 10.1145/1278177.1278186

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

J. Dumas, P. Giorgi, and C. Pernet, Dense Linear Algebra over Word-Size Prime Fields, ACM Transactions on Mathematical Software, vol.35, issue.3, pp.1-1942, 2008.
DOI : 10.1145/1391989.1391992

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

P. Giorgi, C. Jeannerod, and G. Villard, On the complexity of polynomial matrix computations, Proceedings of the 2003 international symposium on Symbolic and algebraic computation , ISSAC '03, pp.135-142, 2003.
DOI : 10.1145/860854.860889

F. C. Hennie, On-line Turing machine computations. Electronic Computers, IEEE Transactions, issue.1, pp.1535-1579, 1966.

J. V. Hoeven, Relax, but Don???t be Too Lazy, Journal of Symbolic Computation, vol.34, issue.6, pp.479-542, 2002.
DOI : 10.1006/jsco.2002.0562

J. V. Hoeven, Relaxed multiplication using the middle product, ISSAC'03, pp.143-147, 2003.

C. Jeannerod, C. Pernet, and A. Storjohann, Rank-profile revealing Gaussian elimination and the CUP matrix decomposition, Journal of Symbolic Computation, vol.56, pp.46-68, 2013.
DOI : 10.1016/j.jsc.2013.04.004

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

C. Jeannerod and G. Villard, Asymptotically fast polynomial matrix algorithms for multivariable systems, International Journal of Control, vol.36, issue.11, pp.1359-1367, 2006.
DOI : 10.1007/BF00289520

E. Kaltofen and W. Lee, Early termination in sparse interpolation algorithms, Journal of Symbolic Computation, vol.36, issue.3-4, pp.365-400, 2003.
DOI : 10.1016/S0747-7171(03)00088-9

E. Kaltofen and G. Villard, On the complexity of computing determinants, computational complexity, vol.13, issue.3-4, pp.91-130, 2004.
DOI : 10.1007/s00037-004-0185-3

E. Kaltofen and G. Yuhasz, On the matrix berlekamp-massey algorithm, ACM Transactions on Algorithms, vol.9, issue.4, p.2013
DOI : 10.1145/2500122

E. Thomé, Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm, Journal of Symbolic Computation, vol.33, issue.5, pp.757-775, 2002.
DOI : 10.1006/jsco.2002.0533

W. J. Turner, Black Box Linear Algebra with the LinBox Library, 2002.

W. J. Turner, A block Wiedemann rank algorithm, Proceedings of the 2006 international symposium on Symbolic and algebraic computation , ISSAC '06, pp.332-339, 2006.
DOI : 10.1145/1145768.1145822

V. and V. Williams, Multiplying matrices faster than coppersmith-winograd, Proceedings of the 44th symposium on Theory of Computing, STOC '12, pp.887-898, 2012.
DOI : 10.1145/2213977.2214056

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

G. Villard, A study of coppersmith's block Wiedemann algorithm using matrix polynomials, Research Report, vol.975, 1997.

W. Zhou, Fast Order Basis and Kernel Basis Computation and Related Problems, 2013.

W. Zhou and G. Labahn, Efficient algorithms for order basis computation, Journal of Symbolic Computation, vol.47, issue.7, pp.793-819, 2012.
DOI : 10.1016/j.jsc.2011.12.009

W. Zhou, G. Labahn, and A. Storjohann, Computing minimal nullspace bases, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pp.366-373, 2012.
DOI : 10.1145/2442829.2442881

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=