{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T20:10:46Z","timestamp":1781381446946,"version":"3.54.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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":6864,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0167-6423(94)00013-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:19:32Z","timestamp":1027642772000},"page":"1-18","source":"Crossref","is-referenced-by-count":27,"title":["Efficient parallel algorithms for tree accumulations"],"prefix":"10.1016","volume":"23","author":[{"given":"Jeremy","family":"Gibbons","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wentong","family":"Cai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David B.","family":"Skillicorn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(94)00013-1_BIB1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","article-title":"A simple parallel tree contraction algorithm","volume":"10","author":"Abrahamson","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0167-6423(94)00013-1_BIB2","series-title":"Design and Analysis of Parallel Algorithms","author":"Akl","year":"1989"},{"issue":"11","key":"10.1016\/0167-6423(94)00013-1_BIB3","doi-asserted-by":"crossref","first-page":"1526","DOI":"10.1109\/12.42122","article-title":"Scans as primitive parallel operations","volume":"38","author":"Blelloch","year":"1989","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/0167-6423(94)00013-1_BIB4","first-page":"201","article-title":"The parallel evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(94)00013-1_BIB5","first-page":"478","article-title":"Approximate and exact parallel scheduling with applications to list, tree and graph problems","author":"Cole","year":"1986","journal-title":"Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science"},{"key":"10.1016\/0167-6423(94)00013-1_BIB6","series-title":"D. Phil. thesis","article-title":"Algebras for tree algorithms","author":"Gibbons","year":"1991"},{"key":"10.1016\/0167-6423(94)00013-1_BIB7","first-page":"122","article-title":"Upwards and downwards accumulations on trees","volume":"669","author":"Gibbons","year":"1993"},{"key":"10.1016\/0167-6423(94)00013-1_BIB8","first-page":"685","article-title":"Computing downwards accumulations on trees quickly","author":"Gibbons","year":"1993","journal-title":"Proceedings of the 16th Australian Computer Science Conference"},{"key":"10.1016\/0167-6423(94)00013-1_BIB9","first-page":"777","article-title":"Efficient parallel algorithms for solving some tree problems","author":"He","year":"1986","journal-title":"Proceedings of the 24th Allerton Conference on Communication, Control and Computing"},{"issue":"4","key":"10.1016\/0167-6423(94)00013-1_BIB10","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0167-6423(94)00013-1_BIB11","first-page":"478","article-title":"Parallel tree contraction and its application","author":"Miller","year":"1985","journal-title":"Proceedings of the 26th IEEE Symposium on the Foundations of Computer Science"},{"issue":"2","key":"10.1016\/0167-6423(94)00013-1_BIB12","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TSE.1981.234519","article-title":"Tidier drawings of trees","volume":"7","author":"Reingold","year":"1981","journal-title":"IEEE Trans. Software Engrg."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642394000131?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642394000131?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:50:10Z","timestamp":1555059010000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642394000131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0167642394000131"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(94)00013-1","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}