Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering, Proceeding of IRREGULAR'99, vol.1225, pp.986-995, 1999. ,
An approximate minimum degree ordering algorithm, SIAM Journal on Matrix Analysis and Applications, vol.17, issue.4, pp.886-905, 1996. ,
Complexes of not i-connected graphs, Topology, vol.38, issue.2, pp.271-299, 1999. ,
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. ,
Chessboard complexes and matching complexes, Journal of the London Mathematical Society, vol.49, issue.1, pp.25-39, 1994. ,
Centrum voor Wiskunde en Informatica, Strategies in filtering in the number field sieve, 2000. ,
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
, Direct Methods for Sparse Matrices, 1986.
Algorithmesparalì eles efficaces pour le calcul formel : algèbre linéaire creuse et extensions algébriques, 2000. ,
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. ,
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
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. ,
Integer Smith form via the Valence: experience with large sparse matrices from Homology, pp.95-105 ,
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
On randomized Lanczos algorithms, Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, pp.176-183, 1997. ,
Parallelization of Gröbner basis, First International Symposium on Parallel Symbolic Computation, PASCO '94, vol.5, pp.124-132, 1994. ,
The Theory of Matrices, 1959. ,
Improving the run time and quality of nested dissection ordering, SIAM Journal on Scientific Computing, vol.20, issue.2, pp.468-489, 1999. ,
A generalization of the fast LUP matrix decomposition algorithm and applications, Journal of Algorithms, vol.3, issue.1, pp.45-56, 1982. ,
Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm, pp.192-201 ,
Distributed matrix-free solution of large sparse linear systems over finite fields, Proceedings of High Performance Computing, 1996. ,
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. ,
A fast and high quality mutilevel scheme for partitioning irregular graphs, SIAM Journal on Scientific Computing, vol.20, issue.1, pp.359-392, 1999. ,
Solving large sparse linear systems over finite fields, Lecture Notes in Computer Science, vol.537, pp.109-133, 1991. ,
Computational aspects of discrete logarithms, 1996. ,
Shift-register synthesis and BCH decoding, IEEE Transactions on Information Theory, IT, vol.15, pp.122-127, 1969. ,
Elements of algebraic topology, chapter The computability of homology groups, pp.53-61, 1994. ,
, Invariants algébriques de graphes et reconstruction. Comptes Rendus de l'Académie des Sciences, vol.333, pp.821-826, 2001.
Minimal resolutions and the homology of matching and chessboard complexes, Journal of Algebraic Combinatorics, vol.11, issue.2, pp.135-154, 2000. ,
Node selection strategies for bottom-up sparse matrix ordering, SIAM Journal on Matrix Analysis and Applications, vol.19, issue.3, pp.682-695, 1998. ,
, Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000.
A study of Coppersmith's block Wiedemann algorithm using matrix polynomials, 1997. ,
Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices, Lecture Notes in Mathematics, vol.292, 1972. ,
Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, vol.32, issue.1, pp.54-62, 1986. ,
Computing the minimum fill-in is NP-complete, SIAM Journal on Algebraic and Discrete Methods, vol.2, issue.1, pp.77-79, 1981. ,
Effective Polynomial Computation, chapter Zero Equivalence Testing, pp.189-206, 1993. ,
Computational Methods for General Sparse Matrices, chapter Pivotal Strategies for Gaussian Elimination, pp.67-86, 1992. ,