Barry W. Peyton - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 14 from 14

2021

Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within SupernodesMathias Jacquelin, Esmond G. Ng, Barry W. Peyton. siammax, 42(3):1337-1364, 2021. [doi]

2018

Fast and effective reordering of columns within supernodes using partition refinementMathias Jacquelin, Esmond G. Ng, Barry W. Peyton. siamcsc 2018: 76-86 [doi]

2008

Fast Computation of Minimal Fill Inside A Given Elimination OrderingPinar Heggernes, Barry W. Peyton. siammax, 30(4):1424-1444, 2008. [doi]

2004

Maximum Cardinality Search for Computing Minimal Triangulations of GraphsAnne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton. algorithmica, 39(4):287-298, 2004. [doi]

2001

Minimal Orderings RevisitedBarry W. Peyton. siammax, 23(1):271-294, 2001. [doi]

Large-Scale Normal Coordinate Analysis for Molecular StructuresChao Yang, Barry W. Peyton, Donald W. Noid, Bobby G. Sumpter, Robert E. Tuzun. siamsc, 23(2):563-582, 2001. [doi]

1996

Some Results on Structure Prediction in Sparse QR FactorizationEsmond G. Ng, Barry W. Peyton. siammax, 17(2):443-459, 1996. [doi]

1994

On Finding Minimum-Diameter Clique TreesJean R. S. Blair, Barry W. Peyton. njc, 1(2):173-201, 1994.

An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky FactorizationJohn R. Gilbert, Esmond G. Ng, Barry W. Peyton. siammax, 15(4):1075-1091, October 1994. [doi]

1993

1991

Parallel Algorithms for Sparse Linear SystemsMichael T. Heath, Esmond G. Ng, Barry W. Peyton. siamrev, 33(3):420-460, 1991. [doi]

Sign in or sign up to see more results.

runs on WebDSL