{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,16]],"date-time":"2023-04-16T17:51:19Z","timestamp":1681667479832},"reference-count":31,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8843,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,5]]},"DOI":"10.1016\/0304-3975(89)90058-3","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T17:44:32Z","timestamp":1034271872000},"page":"135-157","source":"Crossref","is-referenced-by-count":12,"title":["Techniques for parallel manipulation of sparse matrices"],"prefix":"10.1016","volume":"64","author":[{"given":"Clyde P.","family":"Kruskal","sequence":"first","affiliation":[]},{"given":"Larry","family":"Rudolph","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Snir","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90058-3_BIB1","series-title":"Sparse Matrix Techniques","volume":"572","year":"1977"},{"key":"10.1016\/0304-3975(89)90058-3_BIB2","author":"Beigel","year":"1987","journal-title":"Unbounded searching algorithms"},{"key":"10.1016\/0304-3975(89)90058-3_BIB3","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/0020-0190(76)90071-5","article-title":"An almost optimal algorithm for unbounded searching","volume":"5","author":"Bentley","year":"1976","journal-title":"Information Processing Letters"},{"key":"10.1016\/0304-3975(89)90058-3_BIB4","unstructured":"G. Bilardi and A. Nicolau, Bitonic sorting with O(N log N) comparisons, SIAM J. Computing, to appear."},{"key":"10.1016\/0304-3975(89)90058-3_BIB5","series-title":"Sparse Matrix Computations","year":"1976"},{"key":"10.1016\/0304-3975(89)90058-3_BIB6","first-page":"478","article-title":"Approximate and exact parallel scheduling with applications to list, tree and graph problems","author":"Cole","year":"1986","journal-title":"27th Ann. Symp. on Foundation of Computer Science"},{"key":"10.1016\/0304-3975(89)90058-3_BIB7","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1137\/0205040","article-title":"Fast parallel matrix inversion algorithms","volume":"5","author":"Csanky","year":"1976","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0304-3975(89)90058-3_BIB8","series-title":"Sparse Matrix Proceedings 1978","year":"1979"},{"key":"10.1016\/0304-3975(89)90058-3_BIB9","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/TC.1983.1676201","article-title":"The NYU ultracomputer\u2014designing an MIMD shared memory parallel computer","volume":"C-32","author":"Gottlieb","year":"1983","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0304-3975(89)90058-3_BIB10","series-title":"A parallel algorithm for finding fill in a sparse symmetric matrix, TR 86-789","author":"Gilbert","year":"1986"},{"key":"10.1016\/0304-3975(89)90058-3_BIB11","series-title":"Computer Solutions of Large Sparse Positive Definite Systems","author":"George","year":"1981"},{"key":"10.1016\/0304-3975(89)90058-3_BIB12","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1145\/355791.355796","article-title":"Two fast algorithms for sparse matrices: Multiplication and permuted transposition","volume":"4","author":"Gustavson","year":"1978","journal-title":"ACM Trans. Mathematical Software"},{"key":"10.1016\/0304-3975(89)90058-3_BIB13","series-title":"Computer Architecture and Parallel Processing","author":"Hwang","year":"1984"},{"key":"10.1016\/0304-3975(89)90058-3_BIB14","series-title":"The Mathematical Gardener","first-page":"310","article-title":"Supernatural numbers","author":"Knuth","year":"1981"},{"key":"10.1016\/0304-3975(89)90058-3_BIB15","first-page":"278","article-title":"Parallel prefix on fully connected direct connection machines","author":"Kruskal","year":"1986","journal-title":"Proc. Int. Conf. on Parallel Processing"},{"key":"10.1016\/0304-3975(89)90058-3_BIB16","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TC.1985.6312202","article-title":"The power of parallel prefix","volume":"C-34","author":"Kruskal","year":"1985","journal-title":"IEEE Trans. on Computers"},{"key":"10.1016\/0304-3975(89)90058-3_BIB17","first-page":"869","article-title":"Efficient parallel algorithms for graph problems","author":"Kruskal","year":"1986","journal-title":"Proc. Int. Conf. on Parallel Processing"},{"key":"10.1016\/0304-3975(89)90058-3_BIB18","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1126\/science.231.4741.967","article-title":"Parallel supercomputing today and the Cedar approach","volume":"281","author":"Kuck","year":"1986","journal-title":"Science"},{"key":"10.1016\/0304-3975(89)90058-3_BIB19","first-page":"160","article-title":"Parallel hashing\u2014an efficient implementation of shared memory","author":"Karlin","year":"1986","journal-title":"Proc. 18th ACM STOC"},{"key":"10.1016\/0304-3975(89)90058-3_BIB20","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computations","volume":"27","author":"Ladner","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(89)90058-3_BIB21","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1287\/mnsc.3.3.255","article-title":"The elimination form of the inverse and its application to linear programming","volume":"3","author":"Markowitz","year":"1957","journal-title":"Management Sci."},{"key":"10.1016\/0304-3975(89)90058-3_BIB22","article-title":"Direct Methods for Sparse Matrices","volume":"157","author":"Osterby","year":"1983"},{"key":"10.1016\/0304-3975(89)90058-3_BIB23","first-page":"143","article-title":"Efficient parallel solution of linear systems","author":"Pan","year":"1985","journal-title":"Proc. 17th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(89)90058-3_BIB24","first-page":"764","article-title":"The IBM research parallel processor prototype (RP3): Introduction and architecture","author":"Pfister","year":"1985","journal-title":"Proc. Int. Conf. on Parallel Processing"},{"key":"10.1016\/0304-3975(89)90058-3_BIB25","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1145\/7902.7905","article-title":"Contention is no obstacle to shared-memory multiprocessing","volume":"29","author":"Rettberg","year":"1986","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(89)90058-3_BIB26","series-title":"Sparse Matrices and their Applications","year":"1972"},{"key":"10.1016\/0304-3975(89)90058-3_BIB27","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1145\/356004.356006","article-title":"A new implementation of sparse Gaussian elimination","volume":"8","author":"Schreiber","year":"1982","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0304-3975(89)90058-3_BIB28","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/357114.357116","article-title":"Ultracomputers","volume":"2","author":"Schwartz","year":"1980","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"10.1016\/0304-3975(89)90058-3_BIB29","first-page":"230","article-title":"Randomized speed-ups in parallel computations","author":"Vishkin","year":"1984","journal-title":"Proc. 16th Ann. ACM Symp. in Theory of Computing"},{"key":"10.1016\/0304-3975(89)90058-3_BIB30","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1137\/0717003","article-title":"On some pivotal strategies in Gaussian elimination by sparse techniques","volume":"17","author":"Zlatev","year":"1980","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/0304-3975(89)90058-3_BIB31","series-title":"A parallel algorithm for large sparse Cholesky factorization on a multiprocessor","author":"Zmijewski","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900583?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900583?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T18:20:09Z","timestamp":1555179609000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900583"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["0304397589900583"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90058-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}