{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:40Z","timestamp":1725663640504},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572732"},{"type":"electronic","value":"9783540480327"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57273-2_64","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:37:15Z","timestamp":1330241835000},"page":"295-305","source":"Crossref","is-referenced-by-count":0,"title":["Optimal tree contraction on the hypercube and related networks"],"prefix":"10.1007","author":[{"given":"Ernst W.","family":"Mayr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralph","family":"Werchner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1145\/322186.322200","volume":"27","author":"H. Abelson","year":"1980","unstructured":"H. Abelson. Lower bounds on information transfer in distributed computations. Journal of the ACM, 27:384\u2013392, 1980.","journal-title":"Journal of the ACM"},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","volume":"10","author":"K. Abrahamson","year":"1989","unstructured":"K. Abrahamson, N. Dadoun, D.G. Kirkpatrick and T. Przytycka. A simple parallel tree contraction algorithm. Journal of Algorithms, 10:287\u2013302, 1989.","journal-title":"Journal of Algorithms"},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R. Brent","year":"1974","unstructured":"R. Brent. The parallel evaluation of general arithmetical expressions. Journal of the ACM, 21:201\u2013206, 1974.","journal-title":"Journal of the ACM"},{"key":"26_CR4","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1137\/0221046","volume":"21","author":"S. Buss","year":"1992","unstructured":"S. Buss, S. Cook, A. Gupta and V. Ramachandran. An optimal parallel algorithm for formula evaluation. SIAM Journal on Computing, 21:755\u2013780, 1992.","journal-title":"SIAM Journal on Computing"},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/978-1-4684-5511-3_9","volume-title":"Concurrent Computations: Algorithms, Architecture, and Technology","author":"H. Gazit","year":"1988","unstructured":"H. Gazit. and G.L. Miller and S.-H. Teng. Optimal tree contraction in the EREW model. In: Tewksbury, Stuart K. and Bradley W. Dickinson and Stuart C. Schwartz (eds.): Concurrent Computations: Algorithms, Architecture, and Technology. Plenum Press: New York-London (1988), 139\u2013156."},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"A. Gibbons and W. Rytter. An optimal parallel algorithms for dynamic expression evaluation and its applications. Proceedings of the 6th Conference on Foundations of Software Technology and Theoretical Computer Science, Springer Verlag, LNCS-241:453\u2013469, 1986.","DOI":"10.1007\/3-540-17179-7_28"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"S.R. Kosaraju and A.L. Delcher. Optimal parallel evaluation of tree-structured computations by raking. Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, 101\u2013110, 1988.","DOI":"10.1007\/BFb0040378"},{"key":"26_CR8","unstructured":"F.T. Leighton. Introduction to Parallel Algorithms and Architectures. Morgan Kaufmann Publishers, 1992."},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"E. W. Mayr and R. Werchner. Optimal routing of parentheses on the hypercube. Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 109\u2013117, 1992.","DOI":"10.1145\/140901.140913"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"G. L. Miller and J. H. Reif. Parallel tree contraction and its applications. Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 478\u2013489, 1985.","DOI":"10.1109\/SFCS.1985.43"},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TC.1981.6312172","volume":"C-30","author":"D. Nassimi","year":"1981","unstructured":"D. Nassimi and S. Sahni. Data broadcasting in SIMD computers. IEEE Transactions on Computers, C-30:101\u2013107, 1981.","journal-title":"IEEE Transactions on Computers"},{"key":"26_CR12","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1145\/322326.322329","volume":"29","author":"D. Nassimi","year":"1982","unstructured":"D. Nassimi and S. Sahni. Parallel permutation and sorting algorithms and a new generalized connection network. JACM, 29:642\u2013667, 1982.","journal-title":"JACM"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"G. Pietsch and E. Sch\u00f6mer. Optimal parallel recognition of bracket languages on hypercubes. 8th Annual Symposium on Theoretical Aspects of Computer Science, Springer Verlag, LNCS-480:434\u2013443.","DOI":"10.1007\/BFb0020818"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"E. J. Schwabe. On the computational equivalence of hypercube-derived networks. Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 388\u2013397, 1990.","DOI":"10.1145\/97444.97706"},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/357114.357116","volume":"2","author":"J.T. Schwartz","year":"1980","unstructured":"J.T. Schwartz. Ultracomputers. ACM Transactions on Programming Languages and Systems, 2:484\u2013521, 1980.","journal-title":"ACM Transactions on Programming Languages and Systems"}],"container-title":["Lecture Notes in Computer Science","Algorithms\u2014ESA '93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57273-2_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:10:43Z","timestamp":1605629443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57273-2_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572732","9783540480327"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-57273-2_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}