| An introduction to chordal graphs and clique trees JRS Blair, B Peyton Graph theory and sparse matrix computation, 1-29, 1993 | 762 | 1993 |
| Parallel algorithms for sparse linear systems MT Heath, E Ng, BW Peyton SIAM review 33 (3), 420-460, 1991 | 444 | 1991 |
| A user's guide to PICL a portable instrumented communication library GA Geist, MT Heath, BW Peyton, PH Worley Oak Ridge National Lab.(ORNL), Oak Ridge, TN (United States), 1990 | 421 | 1990 |
| Block sparse Cholesky algorithms on advanced uniprocessor computers EG Ng, BW Peyton SIAM Journal on Scientific Computing 14 (5), 1034-1056, 1993 | 342 | 1993 |
| Progress in sparse matrix methods for large linear systems on vector supercomputers C Cleveland Ashcraft, RG Grimes, JG Lewis, BW Peyton, HD Simon, ... The International Journal of Supercomputing Applications 1 (4), 10-30, 1987 | 218 | 1987 |
| Maximum cardinality search for computing minimal triangulations of graphs A Berry, JRS Blair, P Heggernes, BW Peyton Algorithmica 39, 287-298, 2004 | 167 | 2004 |
| On finding supernodes for sparse matrix computations JWH Liu, EG Ng, BW Peyton SIAM Journal on Matrix Analysis and Applications 14 (1), 242-252, 1993 | 148 | 1993 |
| Parallel algorithms for matrix computations K Gallivan, M Heath, E Ng, B Peyton, R Plemmons, J Ortega, C Romine, ... Siam, 1990 | 143 | 1990 |
| A fast algorithm for reordering sparse matrices for parallel factorization JG Lewis, BW Peyton, A Pothen SIAM Journal on Scientific and Statistical Computing 10 (6), 1146-1173, 1989 | 139 | 1989 |
| A supernodal Cholesky factorization algorithm for shared-memory multiprocessors E Ng, BW Peyton SIAM Journal on scientific computing 14 (4), 761-769, 1993 | 102 | 1993 |
| An efficient algorithm to compute row and column counts for sparse Cholesky factorization JR Gilbert, EG Ng, BW Peyton SIAM Journal on Matrix Analysis and Applications 15 (4), 1075-1091, 1994 | 84 | 1994 |
| Computing connection coefficients of compactly supported wavelets on bounded intervals CH Romine, BW Peyton Oak Ridge National Lab., Mathematical Sciences Section, TN (United States), 1997 | 53 | 1997 |
| Minimal orderings revisited BW Peyton SIAM journal on matrix analysis and applications 23 (1), 271-294, 2001 | 38 | 2001 |
| PICL: A portable instrumented communications library, C reference manual GA Geist, MT Heath, BW Peyton, PH Worley Technical Report TM-11130, Oak Ridge National Laboratory, Oak Ridge, TN, 1990 | 38 | 1990 |
| A machine-independent communication library GA Geist, MT Heath, BW Peyton, PH Worley Oak Ridge National Lab., TN (USA), 1989 | 35 | 1989 |
| Computing Row and Column Counts for Sparse QR and LU Factorization JR Gilbert, XS Li, EG Ng, BW Peyton BIT Numerical Mathematics 41, 693-710, 2001 | 34 | 2001 |
| On finding minimum-diameter clique trees JRS Blair, BW Peyton Oak Ridge National Lab.(ORNL), Oak Ridge, TN (United States), 1991 | 34 | 1991 |
| Some applications of clique trees to the solution of sparse linear systems BW Peyton | 32 | 1986 |
| Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution BW Peyton, A Pothen, X Yuan Linear algebra and its applications 192, 329-353, 1993 | 29 | 1993 |
| A blocked incomplete Cholesky preconditioner for hierarchical-memory computers EG Ng, BW Peyton, P Raghavan Iterative methods in scientific computation IV, DR Kincaid and AC Elster …, 1999 | 26 | 1999 |
