W. Baur and V. Strassen, The complexity of partial derivatives, Theoretical Computer Science, vol.22, issue.3, pp.317-330, 1983.
DOI : 10.1016/0304-3975(83)90110-X

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

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, Faster inversion and other black box matrix computations using efficient block projections, Proceedings of the 2007 international symposium on Symbolic and algebraic computation , ISSAC '07, pp.143-150, 2007.
DOI : 10.1145/1277548.1277569

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

M. Giesbrecht, W. Eberly, and G. Villard, Fast computations of integer determinants, The 6th International IMACS Conference on Applications of Computer Algebra, 2000.

X. Huang and V. Y. Pan, Fast rectangular matrix multiplications and improving parallel matrix computations, Proceedings of the second international symposium on Parallel symbolic computation , PASCO '97, pp.11-23, 1997.
DOI : 10.1145/266670.266679

C. P. 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, On computing determinants without divisions, International Symposium on Symbolic and Algebraic Computation, pp.342-349, 1992.

E. Kaltofen and V. Y. Pan, Processor efficient parallel solution of linear systems over an abstract field, Proceedings of the third annual ACM symposium on Parallel algorithms and architectures , SPAA '91, pp.180-191, 1991.
DOI : 10.1145/113379.113396

E. Kaltofen and B. D. Saunders, On wiedemann's method of solving sparse linear systems, Proc. AAECC-9, pp.29-38, 1991.
DOI : 10.1007/3-540-54522-0_93

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

S. Linnainmaa, The representation of the cumulative rounding error of an algorithm as a Taylor expansion of the local rounding errors (in Finnish) Master's thesis, 1970.

S. Linnainmaa, Taylor expansion of the accumulated rounding error, BIT, vol.12, issue.2, pp.146-160, 1976.
DOI : 10.1007/BF01931367

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

A. Storjohann, The shifted number system for fast linear algebra on integer matrices, Journal of Complexity, vol.21, issue.4, pp.609-650, 2005.
DOI : 10.1016/j.jco.2005.04.002

V. Strassen, Vermeidung von Divisionen, J. Reine Angew. Math, vol.264, pp.182-202, 1973.

D. Wiedemann, Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, vol.32, issue.1, pp.54-62, 1986.
DOI : 10.1109/TIT.1986.1057137