{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T12:39:36Z","timestamp":1704717576220},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1016\/0167-8191(90)90104-h","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"151-162","source":"Crossref","is-referenced-by-count":10,"title":["Parallel symbolic factorization of sparse linear systems"],"prefix":"10.1016","volume":"14","author":[{"given":"John R","family":"Gilbert","sequence":"first","affiliation":[]},{"given":"Hj\u00e1lmt\u00fdr","family":"Hafsteinsson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(90)90104-H_BIB1","series-title":"Proc. 27th IEEE Symposium on Foundations of Computer Science","first-page":"511","article-title":"Parallel sort","author":"Cole","year":"1986"},{"key":"10.1016\/0167-8191(90)90104-H_BIB2","series-title":"Proc. 27th IEEE Symposium on Foundations of Computer Science","first-page":"478","article-title":"Approximate and exact scheduling with applications to list, tree and graph problems","author":"Cole","year":"1986"},{"key":"10.1016\/0167-8191(90)90104-H_BIB3","series-title":"Computer Solutions of Large Sparse Positive Definite Systems","author":"George","year":"1981"},{"key":"10.1016\/0167-8191(90)90104-H_BIB4","series-title":"Technical Report CS-86-789","article-title":"A parallel algorithm for finding fill in a sparse symmetric matrix","author":"Gilbert","year":"1986"},{"key":"10.1016\/0167-8191(90)90104-H_BIB5","series-title":"Technical Report CS-87-893","article-title":"Parallel Cholesky factorization of sparse matrices","author":"Gilbert","year":"1987"},{"key":"10.1016\/0167-8191(90)90104-H_BIB6","article-title":"Parallel sparse Cholesky factorization","author":"Hafsteinsson","year":"1989"},{"key":"10.1016\/0167-8191(90)90104-H_BIB7","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0167-8191(90)90104-H_BIB8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/6497.6499","article-title":"A compact row storage scheme for Cholesky factors using elimination trees","volume":"12","author":"Liu","year":"1986","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0167-8191(90)90104-H_BIB9","series-title":"Technical Report CS-87-12","article-title":"The role of elimination trees in sparse factorization","author":"Liu","year":"1987"},{"key":"10.1016\/0167-8191(90)90104-H_BIB10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/1003021","article-title":"The use of linear graphs in Gauss elimination","volume":"3","author":"Parter","year":"1961","journal-title":"SIAM Rev."},{"key":"10.1016\/0167-8191(90)90104-H_BIB11","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8191(90)90104-H_BIB12","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1145\/356004.356006","article-title":"A new implementation of sparse Guassian elimination","volume":"8","author":"Schreiber","year":"1982","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0167-8191(90)90104-H_BIB13","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","article-title":"An O(log n) parallel connectivity algorithm","volume":"3","author":"Shiloach","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0167-8191(90)90104-H_BIB14","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/0167-8191(90)90104-H_BIB15","series-title":"Proc. 25th IEEE Symposium on Foundations of Computer Science","first-page":"12","article-title":"Finding biconnected components and computing tree functions in logarithmic parallel time","author":"Tarjan","year":"1984"},{"key":"10.1016\/0167-8191(90)90104-H_BIB16","article-title":"Sparse Cholesky factorization on a multiprocessor","author":"Zmijewski","year":"1987"},{"issue":"2","key":"10.1016\/0167-8191(90)90104-H_BIB17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0167-8191(88)90039-7","article-title":"A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor","volume":"7","author":"Zmijewski","year":"1988","journal-title":"Parallel Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090104H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919090104H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:25:46Z","timestamp":1551086746000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919090104H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["016781919090104H"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90104-h","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}