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

A. Bostan and E. 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. 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

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 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

J. D. Dixon, Exact solution of linear equations usingP-adic expansions, Numerische Mathematik, vol.82, issue.1, pp.137-141, 1982.
DOI : 10.1007/BF01459082

J. Dumas, T. Gautier, M. Giesbrecht, P. Giorgi, B. Hovinen et al., LINBOX: A GENERIC LIBRARY FOR EXACT LINEAR ALGEBRA, Mathematical Software, pp.40-50, 2002.
DOI : 10.1142/9789812777171_0005

J. Dumas, B. D. Saunders, and G. Villard, Integer Smith form via the valence, Proceedings of the 2000 international symposium on Symbolic and algebraic computation symbolic and algebraic computation , ISSAC '00, pp.95-105, 2000.
DOI : 10.1145/345542.345590

W. Eberly, Processor-efficient parallel matrix inversion over abstract fields, Proceedings of the second international symposium on Parallel symbolic computation , PASCO '97, pp.38-45, 1997.
DOI : 10.1145/266670.266684

W. Eberly, M. Giesbrecht, P. Giorgi, A. Storjohann, and G. Villard, Solving sparse rational linear systems, Proceedings of the 2006 international symposium on Symbolic and algebraic computation , ISSAC '06, pp.63-70, 2006.
DOI : 10.1145/1145768.1145785

Z. Ioannis, V. Y. Emiris, and . Pan, Improved algorithms for computing determinants and resultants, J. Complex, vol.21, issue.1, pp.43-71, 2005.

M. Giesbrecht, Efficient parallel solution of sparse systems of linear diophantine equations, Proceedings of the second international symposium on Parallel symbolic computation , PASCO '97, pp.1-10, 1997.
DOI : 10.1145/266670.266678

M. Giesbrecht, Fast computation of the Smith form of a sparse integer matrix, Computational Complexity, vol.10, issue.1, pp.41-69, 2004.
DOI : 10.1007/PL00001611

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

X. Huang and V. Y. Pan, Fast Rectangular Matrix Multiplication and Applications, Journal of Complexity, vol.14, issue.2, pp.257-299, 1998.
DOI : 10.1006/jcom.1998.0476

E. Kaltofen18-]-e, B. D. Kaltofen, and . Saunders, Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems On Wiedemann's method of solving sparse linear systems, Proc. AAECC-9, pp.777-806, 1991.

E. Kaltofen, Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems, Mathematics of Computation, vol.64, issue.210, pp.777-806, 1995.

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

G. Labahn, D. K. Chio, and S. Cabay, The Inverses of Block Hankel and Block Toeplitz Matrices, SIAM Journal on Computing, vol.19, issue.1, pp.98-123, 1990.
DOI : 10.1137/0219006

J. T. Schwartz, Fast Probabilistic Algorithms for Verification of Polynomial Identities, Journal of the ACM, vol.27, issue.4, pp.701-717, 1980.
DOI : 10.1145/322217.322225

H. Douglas and . Wiedemann, Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, vol.32, issue.1, pp.54-62, 1986.