{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T21:18:02Z","timestamp":1649107082213},"reference-count":9,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":[[1993,7]]},"DOI":"10.1016\/0167-8191(93)90060-x","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"713-728","source":"Crossref","is-referenced-by-count":1,"title":["Computing dominators on a cube-connected machine"],"prefix":"10.1016","volume":"19","author":[{"given":"S.J","family":"Horng","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(93)90060-X_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0167-8191(93)90060-X_BIB2","series-title":"Compilers Principles, Techniques, and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/0167-8191(93)90060-X_BIB3","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TC.1984.1676437","article-title":"Generalized hypercube and hyperbus structures for a computer network","volume":"C-33","author":"Bhuyan","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(93)90060-X_BIB4","article-title":"Maximal parallelism in matrix multiplication","author":"Chandra","year":"1976","journal-title":"RC 6193, IBM Rept."},{"issue":"4","key":"10.1016\/0167-8191(93)90060-X_BIB5","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0210049","article-title":"Parallel matrix and graph algorithms","volume":"10","author":"Dekel","year":"1981","journal-title":"SIAM. J. Comput."},{"key":"10.1016\/0167-8191(93)90060-X_BIB6","series-title":"Proc. Eighth STOC","first-page":"55","article-title":"Parallel algorithms for the transitive closure and the connected component problem","author":"Hirschberg","year":"1976"},{"key":"10.1016\/0167-8191(93)90060-X_BIB7","series-title":"Proc. Internat. Conf. on Parallel Processing","first-page":"765","article-title":"Efficient image template matching on hypercube SIMD arrays","author":"Kumar","year":"1987"},{"issue":"4","key":"10.1016\/0167-8191(93)90060-X_BIB8","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(87)90136-0","article-title":"Computing dominators in parallel","volume":"24","author":"Pawagi","year":"1987","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/0167-8191(93)90060-X_BIB9","article-title":"Parallel algorithms for some graph problems","author":"Savage","year":"1977"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390060X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016781919390060X?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:27:58Z","timestamp":1551086878000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016781919390060X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":9,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["016781919390060X"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(93)90060-x","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}