| Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices | 2 | 0.52 | 2007 |
| The Theory of Elimination Trees for Sparse Unsymmetric Matrices | 6 | 0.57 | 2005 |
| A Supernodal Approach to Sparse Partial Pivoting | 214 | 19.39 | 1999 |
| Exploiting structural symmetry in a sparse partial pivoting code | 12 | 2.92 | 1993 |
| The multifrontal method for sparse matrix solution: theory and practice | 97 | 14.91 | 1992 |
| Exploiting structural symmetry in unsymmetric sparse symbolic factorization | 15 | 3.20 | 1992 |
| A generalized envelope method for sparse factorization by rows | 9 | 2.59 | 1991 |
| A fan-in algorithm for distributed sparse numerical factorization | 23 | 7.69 | 1990 |
| The multifrontal method and paging in sparse Cholesky factorization | 15 | 5.09 | 1989 |
| The evolution of the minimum degree ordering algorithm | 111 | 23.99 | 1989 |
| A linear reordering algorithm for parallel pivoting of chordal graphs | 15 | 2.61 | 1989 |
| A graph partitioning algorithm by node separators | 20 | 8.06 | 1989 |
| On threshold pivoting in the multifrontal method for sparse indefinite systems | 2 | 1.80 | 1987 |
| A partial pivoting strategy for sparse symmetric matrix decomposition | 2 | 1.32 | 1987 |
| Symbolic Cholesky factorization on a local-memory multiprocessor | 32 | 5.05 | 1987 |
| On the storage requirement in the out-of-core multifrontal method for sparse factorization | 39 | 8.12 | 1986 |
| A compact row storage scheme for Cholesky factors using elimination trees | 43 | 13.54 | 1986 |
| Modification of the minimum-degree algorithm by multiple elimination | 121 | 43.08 | 1985 |
| A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs | 16 | 21.30 | 1980 |
| An Optimal Algorithm For Symbolic Factorization Of Symmetric-Matrices | 8 | 22.31 | 1980 |
| An Implementation of a Pseudoperipheral Node Finder | 11 | 3.42 | 1979 |
| The Design of a User Interface for a Sparse Matrix Package | 16 | 6.25 | 1979 |
