DBLP: Joseph W. H. Liu

	2007
j19		Stanley C. Eisenstat, Joseph W. H. Liu: Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices. SIAM J. Matrix Analysis Applications 29(4): 1363-1381 (2007)
	2005
j18		Stanley C. Eisenstat, Joseph W. H. Liu: The Theory of Elimination Trees for Sparse Unsymmetric Matrices. SIAM J. Matrix Analysis Applications 26(3): 686-705 (2005)
	1991
j17		Joseph W. H. Liu: A generalized envelope method for sparse factorization by rows. ACM Trans. Math. Softw. 17(1): 112-129 (1991)
	1989
j16		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)
j15		Joseph W. H. Liu: Reordering sparse matrices for parallel elimination. Parallel Computing 11(1): 73-91 (1989)
j14		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)
j13		Joseph W. H. Liu: A graph partitioning algorithm by node separators. ACM Trans. Math. Softw. 15(3): 198-219 (1989)
j12		Joseph W. H. Liu: The multifrontal method and paging in sparse Cholesky factorization. ACM Trans. Math. Softw. 15(4): 310-325 (1989)
	1987
j11		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)
j10		Joseph W. H. Liu: A partial pivoting strategy for sparse symmetric matrix decomposition. ACM Trans. Math. Softw. 13(2): 173-182 (1987)
j9		Joseph W. H. Liu: On threshold pivoting in the multifrontal method for sparse indefinite systems. ACM Trans. Math. Softw. 13(3): 250-261 (1987)
	1986
j8		Alan George, Michael T. Heath, Joseph W. H. Liu, Esmond G. Ng: Solution of sparse positive definite systems on a shared-memory multiprocessor. International Journal of Parallel Programming 15(4): 309-325 (1986)
j7		Joseph W. H. Liu: Computational models and task scheduling for parallel sparse Cholesky factorization. Parallel Computing 3(4): 327-342 (1986)
j6		Joseph W. H. Liu: On the storage requirement in the out-of-core multifrontal method for sparse factorization. ACM Trans. Math. Softw. 12(3): 249-264 (1986)
	1985
j5		Joseph W. H. Liu: Modification of the Minimum-Degree Algorithm by Multiple Elimination. ACM Trans. Math. Softw. 11(2): 141-153 (1985)
	1980
j4		Alan George, Joseph W. H. Liu: An Optimal Algorithm for Symbolic Factorization of Symmetric Matrices. SIAM J. Comput. 9(3): 583-593 (1980)
j3		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)
	1979
j2		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)
j1		Alan George, Joseph W. H. Liu: An Implementation of a Pseudoperipheral Node Finder. ACM Trans. Math. Softw. 5(3): 284-295 (1979)

2007

j19

Stanley C. Eisenstat, Joseph W. H. Liu: Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices. SIAM J. Matrix Analysis Applications 29(4): 1363-1381 (2007)

2005

j18

Stanley C. Eisenstat, Joseph W. H. Liu: The Theory of Elimination Trees for Sparse Unsymmetric Matrices. SIAM J. Matrix Analysis Applications 26(3): 686-705 (2005)

1991

j17

Joseph W. H. Liu: A generalized envelope method for sparse factorization by rows. ACM Trans. Math. Softw. 17(1): 112-129 (1991)

1989

j16

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)

j15

Joseph W. H. Liu: Reordering sparse matrices for parallel elimination. Parallel Computing 11(1): 73-91 (1989)

j14

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)

j13

Joseph W. H. Liu: A graph partitioning algorithm by node separators. ACM Trans. Math. Softw. 15(3): 198-219 (1989)

j12

Joseph W. H. Liu: The multifrontal method and paging in sparse Cholesky factorization. ACM Trans. Math. Softw. 15(4): 310-325 (1989)

1987

j11

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)

j10

Joseph W. H. Liu: A partial pivoting strategy for sparse symmetric matrix decomposition. ACM Trans. Math. Softw. 13(2): 173-182 (1987)

Joseph W. H. Liu: On threshold pivoting in the multifrontal method for sparse indefinite systems. ACM Trans. Math. Softw. 13(3): 250-261 (1987)

1986

Alan George, Michael T. Heath, Joseph W. H. Liu, Esmond G. Ng: Solution of sparse positive definite systems on a shared-memory multiprocessor. International Journal of Parallel Programming 15(4): 309-325 (1986)

Joseph W. H. Liu: Computational models and task scheduling for parallel sparse Cholesky factorization. Parallel Computing 3(4): 327-342 (1986)

Joseph W. H. Liu: On the storage requirement in the out-of-core multifrontal method for sparse factorization. ACM Trans. Math. Softw. 12(3): 249-264 (1986)

1985

Joseph W. H. Liu: Modification of the Minimum-Degree Algorithm by Multiple Elimination. ACM Trans. Math. Softw. 11(2): 141-153 (1985)

1980

Alan George, Joseph W. H. Liu: An Optimal Algorithm for Symbolic Factorization of Symmetric Matrices. SIAM J. Comput. 9(3): 583-593 (1980)

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)

1979

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)

Alan George, Joseph W. H. Liu: An Implementation of a Pseudoperipheral Node Finder. ACM Trans. Math. Softw. 5(3): 284-295 (1979)

1	Stanley C. Eisenstat	[j19] [j18]
2	Alan George	[j16] [j11] [j8] [j4] [j3] [j2] [j1]
3	Michael T. Heath	[j11] [j8]
4	Andranik Mirzaian (Andy Mirzaian)	[j14]
5	Esmond G. Ng	[j16] [j11] [j8]

Joseph W. H. Liu

Coauthor Index