Barry W. Peyton
According to our database1,
Barry W. Peyton
authored at least 17 papers
between 1991 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2024
CoRR, 2024
2021
Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes.
SIAM J. Matrix Anal. Appl., 2021
2018
Fast and effective reordering of columns within supernodes using partition refinement.
Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, 2018
2008
SIAM J. Matrix Anal. Appl., 2008
2004
Algorithmica, 2004
2001
SIAM J. Sci. Comput., 2001
1999
Proceedings of the Handbook of Discrete and Combinatorial Mathematics., 1999
1996
SIAM J. Matrix Anal. Appl., 1996
1994
An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization.
SIAM J. Matrix Anal. Appl., October, 1994
On Finding Minimum-Diameter Clique Trees.
Nord. J. Comput., 1994
1993
SIAM J. Matrix Anal. Appl., January, 1993
SIAM J. Sci. Comput., 1993
SIAM J. Sci. Comput., 1993
Toward a Parallel Recursive Spectral Bisection Mapping Tool.
Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, 1993
1991