An introduction to chordal graphs and clique trees JRS Blair, B Peyton Graph theory and sparse matrix computation, 1-29, 1993 | 590 | 1993 |

Parallel algorithms for sparse linear systems MT Heath, E Ng, BW Peyton SIAM review 33 (3), 420-460, 1991 | 395 | 1991 |

A user's guide to PICL a portable instrumented communication library GA Geist, MT Heath, BW Peyton, PH Worley Oak Ridge National Lab., TN (USA), 1990 | 304 | 1990 |

Block sparse Cholesky algorithms on advanced uniprocessor computers EG Ng, BW Peyton SIAM Journal on Scientific Computing 14 (5), 1034-1056, 1993 | 298 | 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 | 200 | 1987 |

Maximum cardinality search for computing minimal triangulations of graphs A Berry, JRS Blair, P Heggernes, BW Peyton Algorithmica 39 (4), 287-298, 2004 | 126 | 2004 |

Parallel algorithms for matrix computations K Gallivan, M Heath, E Ng, B Peyton, R Plemmons, C Romine, A Sameh, ... Siam, 1990 | 125 | 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 | 122 | 1989 |

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 | 121 | 1993 |

PICL: a portable instrumented communication library, C reference manual GA Geist, MT Heath, BW Peyton, PH Worley ORNL Technical Report ORNL/TM-11130, 1990 | 99 | 1990 |

A supernodal Cholesky factorization algorithm for shared-memory multiprocessors E Ng, BW Peyton SIAM Journal on scientific computing 14 (4), 761-769, 1993 | 86 | 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 | 77 | 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 | 48 | 1997 |

Minimal orderings revisited BW Peyton SIAM journal on matrix analysis and applications 23 (1), 271-294, 2001 | 36 | 2001 |

A machine-independent communication library GA Geist, MT Heath, BW Peyton, PH Worley Oak Ridge National Lab., TN (USA), 1989 | 31 | 1989 |

On finding minimum-diameter clique trees JRS Blair, BW Peyton Oak Ridge National Lab., TN (United States), 1991 | 30 | 1991 |

Computing row and column counts for sparse QR and LU factorization JR Gilbert, XS Li, EG Ng, BW Peyton BIT Numerical Mathematics 41 (4), 693-710, 2001 | 27 | 2001 |

Some applications of clique trees to the solution of sparse linear systems BW Peyton | 27 | 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 | 26 | 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 | 25 | 1999 |