A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, 1974.

D. Bini and V. Y. , Pan. Polynomial and Matrix Computations, vol.1, 1994.

J. Bunch and J. Hopcroft, Triangular factorization and inversion by fast matrix multiplication, Mathematics of Computation, vol.28, issue.125, pp.231-236, 1974.

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

J. Dumas, T. Gautier, P. Giorgi, and C. Pernet, Dense linear algebra over finite fields: the FFLAS and FFPACK packages, 2006.

J. Dumas, P. Giorgi, and C. Pernet, FFPACK: Finite Field Linear Algebra Package, Proc. International Symposium on Symbolic and Algebraic Computation, pp.119-126, 2004.
URL : https://hal.archives-ouvertes.fr/hal-02101818

G. H. Golub and C. F. Van-loan, Matrix Computations, 1996.

O. H. Ibarra, S. Moran, and R. Hui, A generalization of the fast LUP matrix decomposition algorithm and applications, Journal of Algorithms, vol.3, pp.45-56, 1982.

C. Pernet, Calcul du polynôme caractéristique sur des corps finis, 2003.

C. Pernet, Algèbre linéaire exacte efficace: le calcul du polynôme caractéristique, 2006.

A. Storjohann, Algorithms for Matrix Canonical Forms, 2000.