{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T07:13:21Z","timestamp":1673075601171},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"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":5464,"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":[[1998,8]]},"DOI":"10.1016\/s0304-3975(97)00285-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"3-29","source":"Crossref","is-referenced-by-count":4,"title":["More general parallel tree contraction: Register allocation and broadcasting in a tree"],"prefix":"10.1016","volume":"203","author":[{"given":"Krzysztof","family":"Diks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torben","family":"Hagerup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00285-5_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\/S0304-3975(97)00285-5_BIB2","series-title":"Compilers: Principles, Techniques, and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/S0304-3975(97)00285-5_BIB3","series-title":"Proc. 15th Ann. ACM Symp. on Theory of Computing","first-page":"1","article-title":"An O(n log n) sorting network","author":"Ajtai","year":"1983"},{"key":"10.1016\/S0304-3975(97)00285-5_BIB4","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1007\/BF01759076","article-title":"Deterministic parallel list ranking","volume":"6","author":"Anderson","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(97)00285-5_BIB5","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1006\/inco.1993.1056","article-title":"On parallel integer merging","volume":"106","author":"Berkman","year":"1993","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(97)00285-5_BIB6","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(85)90008-X","article-title":"Routing, merging, and sorting on parallel models of computation","volume":"30","author":"Borodin","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00285-5_BIB7","series-title":"Proc. 20th Interna. Workshop on Graph-Theoretic Concepts in Computer Science (WG 1994)","first-page":"206","article-title":"Prefix graphs and their applications","volume":"vol. 903","author":"Chaudhuri","year":"1995"},{"key":"10.1016\/S0304-3975(97)00285-5_BIB8","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00285-5_BIB9","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","article-title":"Deterministic coin tossing with applications to optimal parallel list ranking","volume":"70","author":"Cole","year":"1986","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(97)00285-5_BIB10","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0217009","article-title":"Approximate parallel scheduling. Part I: the basic technique with applications to optimal parallel list ranking in logarithmic time","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00285-5_BIB11","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/0217037","article-title":"Relations between concurrent-write models of parallel computation","volume":"17","author":"Fich","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00285-5_BIB12","series-title":"Concurrent Computations: Algorithms, Architecture, and Technology","first-page":"139","article-title":"Optimal tree contraction in an EREW model","author":"Gazit","year":"1988"},{"key":"10.1016\/S0304-3975(97)00285-5_BIB13","series-title":"Proc. 3rd Aegean Workshop on Computing (AWOC 1988)","first-page":"101","article-title":"Optimal parallel evaluation of tree-structured computations by raking","volume":"vol. 319","author":"Kosaraju","year":"1988"},{"key":"10.1016\/S0304-3975(97)00285-5_BIB14","series-title":"Proc. 26th Ann. Symp. on Foundations of Computer Science FOCS","first-page":"478","article-title":"Parallel tree contraction and its application","author":"Miller","year":"1985"},{"key":"10.1016\/S0304-3975(97)00285-5_BIB15","series-title":"Randomness and Computation","first-page":"47","article-title":"Parallel tree contraction, Part 1: fundamentals","volume":"vol. 5","author":"Miller","year":"1989"},{"key":"10.1016\/S0304-3975(97)00285-5_BIB16","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1137\/0220070","article-title":"Parallel tree contraction, Part 2: further applications","volume":"20","author":"Miller","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00285-5_BIB17","series-title":"Proc. 2nd Internat. Conf. on Supercomputing","first-page":"392","article-title":"Tree-based parallel algorithm design, manuscript. A preliminary version appeared","author":"Miller","year":"1987"},{"key":"10.1016\/S0304-3975(97)00285-5_BIB18","series-title":"Synthesis of Parallel Algorithms","first-page":"115","article-title":"List ranking and parallel tree contraction","author":"Reid-Miller","year":"1993"},{"key":"10.1016\/S0304-3975(97)00285-5_BIB19","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/0204020","article-title":"Complete register allocation problems","volume":"4","author":"Sethi","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00285-5_BIB20","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","article-title":"Finding the maximum, merging, and sorting in a parallel computation model","volume":"2","author":"Shiloach","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(97)00285-5_BIB21","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1137\/0210052","article-title":"Information dissemination in trees","volume":"10","author":"Slater","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00285-5_BIB22","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00285-5_BIB23","series-title":"Proc. Internat. Conf. on Parallel Processing","first-page":"924","article-title":"Parallel algorithms for bucket sorting and the data dependent prefix problem","author":"Wagner","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002855?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002855?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:01:37Z","timestamp":1555405297000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597002855"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0304397597002855"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00285-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}