{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T08:36:08Z","timestamp":1649147768667},"reference-count":17,"publisher":"Informa UK Limited","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1080\/00207160008804948","type":"journal-article","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T20:24:30Z","timestamp":1182803070000},"page":"361-377","source":"Crossref","is-referenced-by-count":2,"title":["On evaluating elimination tree based parallel sparse cholesky factorizations"],"prefix":"10.1080","volume":"74","author":[{"given":"Wen-Yang","family":"Lin","sequence":"first","affiliation":[]},{"given":"Chuen-Liang","family":"Chen","sequence":"additional","affiliation":[]}],"member":"301","reference":[{"key":"CIT0001","first-page":"159","volume-title":"Graph Theory and Sparse Matrix Computation, The IMA Volumes in Mathematics and its Applications","volume":"56","author":"Ashcraft C.","year":"1993"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1137\/1026003"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1145\/356044.356047"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(86)90019-0"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(86)90167-9"},{"key":"CIT0006","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"George A.","year":"1981"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1137\/0913067"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1137\/1033099"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1137\/0910070"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1675979"},{"key":"CIT0011","unstructured":"Lin, W.Y. and Chen, C.L. 1993.Proc. International Conference on Parallel Processing. Minimum completion time criterion for parallel sparse Cholesky factorization. 1993, St. Charles, IL, USA. Vol. III, pp.107\u2013114."},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(86)90014-1"},{"key":"CIT0013","unstructured":"Gupta, R. and Kumar, V. 1995.Proc. the Seventh SIAM Conference on Parallel Processing for Scientific Computing. Optimally scalable parallel sparse Cholesky factorization. 1995. pp.442\u2013447. SIAM."},{"key":"CIT0014","first-page":"183","volume-title":"Graph Theory and Computing","author":"Rose D. J."},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1137\/S106482759426715X"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1145\/356004.356006"},{"key":"CIT0017","first-page":"191","volume-title":"Graph Theory and Sparse Matrix Computation, The IMA Volumes in Mathematics and its Applications","author":"Schreiber R."}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160008804948","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,12,14]],"date-time":"2016-12-14T00:59:07Z","timestamp":1481677147000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207160008804948"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["10.1080\/00207160008804948"],"URL":"https:\/\/doi.org\/10.1080\/00207160008804948","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}