P. Amestoy, F. Pellegrini, and J. Roman, Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering, Proceeding of IRREGULAR'99, vol.1225, pp.986-995, 1999.

P. R. Amestoy, T. A. Davis, and I. S. Duff, An approximate minimum degree ordering algorithm, SIAM Journal on Matrix Analysis and Applications, vol.17, issue.4, pp.886-905, 1996.

E. Babson, A. Björner, S. Linusson, J. Shareshian, and V. Welker, Complexes of not i-connected graphs, Topology, vol.38, issue.2, pp.271-299, 1999.

P. Berman and G. Schnitger, On the performance of the minimum degree ordering for Gaussian elimination, SIAM Journal on Matrix Analysis and Applications, vol.11, issue.1, pp.83-88, 1990.

A. Björner, L. Lovász, S. T. Vre´cicavre´cica, and R. T. Zivaljevi´czivaljevi´c, Chessboard complexes and matching complexes, Journal of the London Mathematical Society, vol.49, issue.1, pp.25-39, 1994.

S. Cavallar, Centrum voor Wiskunde en Informatica, Strategies in filtering in the number field sieve, 2000.

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, pp.119-146, 2002.
URL : https://hal.archives-ouvertes.fr/hal-02101893

I. S. Duff, A. M. Erisman, and J. K. Reid, Direct Methods for Sparse Matrices, 1986.

J. Dumas, Algorithmesparalì eles efficaces pour le calcul formel : algèbre linéaire creuse et extensions algébriques, 2000.

J. Dumas, Calculparalì ele du polynôme minimal entier en Athapascan-1 et Linbox, RenPar'2000. Actes desdouzì emes rencontres francophones du parallélisme, pp.119-124, 2000.

J. Dumas, T. Gautier, and C. Pernet, Finite field linear algebra subroutines, Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, 2002.
URL : https://hal.archives-ouvertes.fr/hal-02018841

J. Dumas and J. Roch, A fast parallel block algorithm for exact triangularization of rectangular matrices, SPAA'01. Proceedings of the Thirteenth ACM Symposium on Parallel Algorithms and Architectures, pp.324-325, 2001.

J. Dumas, B. D. Saunders, and G. Villard, Integer Smith form via the Valence: experience with large sparse matrices from Homology, pp.95-105

J. Dumas, B. D. Saunders, and G. Villard, On efficient sparse integer matrix Smith normal form computations, Journal of Symbolic Computations, vol.32, issue.1, pp.71-99, 2001.
URL : https://hal.archives-ouvertes.fr/hal-02018782

W. Eberly and E. Kaltofen, On randomized Lanczos algorithms, Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, pp.176-183, 1997.

J. Faugère, Parallelization of Gröbner basis, First International Symposium on Parallel Symbolic Computation, PASCO '94, vol.5, pp.124-132, 1994.

F. R. Gantmacher, The Theory of Matrices, 1959.

B. Hendrickson and E. Rothberg, Improving the run time and quality of nested dissection ordering, SIAM Journal on Scientific Computing, vol.20, issue.2, pp.468-489, 1999.

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

E. Kaltofen, W. Lee, and A. A. Lobo, Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm, pp.192-201

E. Kaltofen and A. Lobo, Distributed matrix-free solution of large sparse linear systems over finite fields, Proceedings of High Performance Computing, 1996.

E. Kaltofen and B. D. Saunders, On Wiedemann's method of solving sparse linear systems, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC '91), vol.539, pp.29-38, 1991.

G. Karypis and V. Kumar, A fast and high quality mutilevel scheme for partitioning irregular graphs, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.359-392, 1999.

B. A. Lamacchia and A. M. Odlyzko, Solving large sparse linear systems over finite fields, Lecture Notes in Computer Science, vol.537, pp.109-133, 1991.

R. Lambert, Computational aspects of discrete logarithms, 1996.

J. L. Massey, Shift-register synthesis and BCH decoding, IEEE Transactions on Information Theory, IT, vol.15, pp.122-127, 1969.

J. R. Munkres, Elements of algebraic topology, chapter The computability of homology groups, pp.53-61, 1994.

M. Pouzet and N. M. Thiéry, Invariants algébriques de graphes et reconstruction. Comptes Rendus de l'Académie des Sciences, vol.333, pp.821-826, 2001.

V. Reiner and J. Roberts, Minimal resolutions and the homology of matching and chessboard complexes, Journal of Algebraic Combinatorics, vol.11, issue.2, pp.135-154, 2000.

E. Rothberg and S. C. Eisenstat, Node selection strategies for bottom-up sparse matrix ordering, SIAM Journal on Matrix Analysis and Applications, vol.19, issue.3, pp.682-695, 1998.

C. Traverso, Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000.

G. Villard, A study of Coppersmith's block Wiedemann algorithm using matrix polynomials, 1997.

W. D. Wallis, A. P. Street, and J. S. Wallis, Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices, Lecture Notes in Mathematics, vol.292, 1972.

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

M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM Journal on Algebraic and Discrete Methods, vol.2, issue.1, pp.77-79, 1981.

R. Zippel, Effective Polynomial Computation, chapter Zero Equivalence Testing, pp.189-206, 1993.

Z. Zlatev, Computational Methods for General Sparse Matrices, chapter Pivotal Strategies for Gaussian Elimination, pp.67-86, 1992.