Joseph W. H. Liu

Affiliations:
  • York University, Department of Computer Science, North York, ON, Canada


According to our database1, Joseph W. H. Liu authored at least 31 papers between 1979 and 2007.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2007
Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices.
SIAM J. Matrix Anal. Appl., 2007

2005
The Theory of Elimination Trees for Sparse Unsymmetric Matrices.
SIAM J. Matrix Anal. Appl., 2005

1999
An Object-Oriented Approach to the Design of a User Interface for a Sparse Matrix Package.
SIAM J. Matrix Anal. Appl., 1999

A Supernodal Approach to Sparse Partial Pivoting.
SIAM J. Matrix Anal. Appl., 1999

1998
Robust Ordering of Sparse Matrices using Multisection.
SIAM J. Matrix Anal. Appl., July, 1998

Applications of the Dulmage-Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement.
SIAM J. Matrix Anal. Appl., April, 1998

1993
Elimination Structures for Unsymmetric Sparse $LU$ Factors.
SIAM J. Matrix Anal. Appl., April, 1993

On Finding Supernodes for Sparse Matrix Computations.
SIAM J. Matrix Anal. Appl., January, 1993

Exploiting Structural Symmetry in a Sparse Partial Pivoting Code.
SIAM J. Sci. Comput., 1993

1992
The Multifrontal Method for Sparse Matrix Solution: Theory and Practice.
SIAM Rev., 1992

Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization.
SIAM J. Matrix Anal. Appl., 1992

1991
A generalized envelope method for sparse factorization by rows.
ACM Trans. Math. Softw., 1991

1990
A Fan-In Algorithm for Distributed Sparse Numerical Factorization.
SIAM J. Sci. Comput., 1990

1989
The multifrontal method and paging in sparse Cholesky factorization.
ACM Trans. Math. Softw., 1989

A graph partitioning algorithm by node separators.
ACM Trans. Math. Softw., 1989

The Evolution of the Minimum Degree Ordering Algorithm.
SIAM Rev., 1989

A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs.
SIAM J. Discret. Math., 1989

Reordering sparse matrices for parallel elimination.
Parallel Comput., 1989

Communication results for parallel sparse Cholesky factorization on a hypercube.
Parallel Comput., 1989

Comparisons of Three Distributed Algorithms for Sparse Cholesky Factorization.
Proceedings of the Fourth SIAM Conference on Parallel Processing for Scientific Computing, 1989

1987
On threshold pivoting in the multifrontal method for sparse indefinite systems.
ACM Trans. Math. Softw., 1987

A partial pivoting strategy for sparse symmetric matrix decomposition.
ACM Trans. Math. Softw., 1987

Symbolic Cholesky factorization on a local-memory multiprocessor.
Parallel Comput., 1987

1986
On the storage requirement in the out-of-core multifrontal method for sparse factorization.
ACM Trans. Math. Softw., 1986

Computational models and task scheduling for parallel sparse Cholesky factorization.
Parallel Comput., 1986

Solution of sparse positive definite systems on a shared-memory multiprocessor.
Int. J. Parallel Program., 1986

1985
Modification of the Minimum-Degree Algorithm by Multiple Elimination.
ACM Trans. Math. Softw., 1985

1980
A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs.
ACM Trans. Math. Softw., 1980

An Optimal Algorithm for Symbolic Factorization of Symmetric Matrices.
SIAM J. Comput., 1980

1979
An Implementation of a Pseudoperipheral Node Finder.
ACM Trans. Math. Softw., 1979

The Design of a User Interface for a Sparse Matrix Package.
ACM Trans. Math. Softw., 1979


  Loading...