| 1989 |
|---|
| 10 | | Alan George,
Joseph W. H. Liu,
Esmond G. Ng:
Communication results for parallel sparse Cholesky factorization on a hypercube.
Parallel Computing 10(3): 287-298 (1989) |
| 9 | | Joseph W. H. Liu:
Reordering sparse matrices for parallel elimination.
Parallel Computing 11(1): 73-91 (1989) |
| 8 | | Joseph W. H. Liu,
Andranik Mirzaian:
A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs.
SIAM J. Discrete Math. 2(1): 100-107 (1989) |
| 1987 |
|---|
| 7 | EE | Alan George,
Michael T. Heath,
Esmond G. Ng,
Joseph W. H. Liu:
Symbolic Cholesky factorization on a local-memory multiprocessor.
Parallel Computing 5(1-2): 85-95 (1987) |
| 1986 |
|---|
| 6 | EE | Joseph W. H. Liu:
Computational models and task scheduling for parallel sparse Cholesky factorization.
Parallel Computing 3(4): 327-342 (1986) |
| 1985 |
|---|
| 5 | EE | Joseph W. H. Liu:
Modification of the Minimum-Degree Algorithm by Multiple Elimination.
ACM Trans. Math. Softw. 11(2): 141-153 (1985) |
| 1980 |
|---|
| 4 | EE | Alan George,
Joseph W. H. Liu:
A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs.
ACM Trans. Math. Softw. 6(3): 337-358 (1980) |
| 3 | | Alan George,
Joseph W. H. Liu:
An Optimal Algorithm for Symbolic Factorization of Symmetric Matrices.
SIAM J. Comput. 9(3): 583-593 (1980) |
| 1979 |
|---|
| 2 | EE | Alan George,
Joseph W. H. Liu:
The Design of a User Interface for a Sparse Matrix Package.
ACM Trans. Math. Softw. 5(2): 139-162 (1979) |
| 1 | EE | Alan George,
Joseph W. H. Liu:
An Implementation of a Pseudoperipheral Node Finder.
ACM Trans. Math. Softw. 5(3): 284-295 (1979) |
