default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoseph W. H. Liu
Person information
- affiliation: York University, Department of Computer Science, North York, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j30]Stanley C. Eisenstat, Joseph W. H. Liu:
Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices. SIAM J. Matrix Anal. Appl. 29(4): 1363-1381 (2007)- 2005
- [j29]Stanley C. Eisenstat, Joseph W. H. Liu:
The Theory of Elimination Trees for Sparse Unsymmetric Matrices. SIAM J. Matrix Anal. Appl. 26(3): 686-705 (2005)
1990 – 1999
- 1999
- [j28]James Weldon Demmel, Stanley C. Eisenstat, John R. Gilbert, Xiaoye S. Li, Joseph W. H. Liu:
A Supernodal Approach to Sparse Partial Pivoting. SIAM J. Matrix Anal. Appl. 20(3): 720-755 (1999) - [j27]Alan George, Joseph W. H. Liu:
An Object-Oriented Approach to the Design of a User Interface for a Sparse Matrix Package. SIAM J. Matrix Anal. Appl. 20(4): 953-969 (1999) - 1998
- [j26]Cleve Ashcraft, Joseph W. H. Liu:
Applications of the Dulmage-Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement. SIAM J. Matrix Anal. Appl. 19(2): 325-354 (1998) - [j25]Cleve Ashcraft, Joseph W. H. Liu:
Robust Ordering of Sparse Matrices using Multisection. SIAM J. Matrix Anal. Appl. 19(3): 816-832 (1998) - 1993
- [j24]Joseph W. H. Liu, Esmond G. Ng, Barry W. Peyton:
On Finding Supernodes for Sparse Matrix Computations. SIAM J. Matrix Anal. Appl. 14(1): 242-252 (1993) - [j23]John R. Gilbert, Joseph W. H. Liu:
Elimination Structures for Unsymmetric Sparse $LU$ Factors. SIAM J. Matrix Anal. Appl. 14(2): 334-352 (1993) - [j22]Stanley C. Eisenstat, Joseph W. H. Liu:
Exploiting Structural Symmetry in a Sparse Partial Pivoting Code. SIAM J. Sci. Comput. 14(1): 253-257 (1993) - 1992
- [j21]Stanley C. Eisenstat, Joseph W. H. Liu:
Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization. SIAM J. Matrix Anal. Appl. 13(1): 202-211 (1992) - [j20]Joseph W. H. Liu:
The Multifrontal Method for Sparse Matrix Solution: Theory and Practice. SIAM Rev. 34(1): 82-109 (1992) - 1991
- [j19]Joseph W. H. Liu:
A generalized envelope method for sparse factorization by rows. ACM Trans. Math. Softw. 17(1): 112-129 (1991) - 1990
- [j18]Cleve Ashcraft, Stanley C. Eisenstat, Joseph W. H. Liu:
A Fan-In Algorithm for Distributed Sparse Numerical Factorization. SIAM J. Sci. Comput. 11(3): 593-599 (1990)
1980 – 1989
- 1989
- [j17]Alan George, Joseph W. H. Liu, Esmond G. Ng:
Communication results for parallel sparse Cholesky factorization on a hypercube. Parallel Comput. 10(3): 287-298 (1989) - [j16]Joseph W. H. Liu:
Reordering sparse matrices for parallel elimination. Parallel Comput. 11(1): 73-91 (1989) - [j15]Joseph W. H. Liu, Andranik Mirzaian:
A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs. SIAM J. Discret. Math. 2(1): 100-107 (1989) - [j14]Alan George, Joseph W. H. Liu:
The Evolution of the Minimum Degree Ordering Algorithm. SIAM Rev. 31(1): 1-19 (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) - [c1]Cleve Ashcraft, Stanley C. Eisenstat, Joseph W. H. Liu, Andrew H. Sherman:
Comparisons of Three Distributed Algorithms for Sparse Cholesky Factorization. PP 1989: 55-56 - 1987
- [j11]Alan George, Michael T. Heath, Esmond G. Ng, Joseph W. H. Liu:
Symbolic Cholesky factorization on a local-memory multiprocessor. Parallel Comput. 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. Int. J. Parallel Program. 15(4): 309-325 (1986) - [j7]Joseph W. H. Liu:
Computational models and task scheduling for parallel sparse Cholesky factorization. Parallel Comput. 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)
1970 – 1979
- 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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
