{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:31Z","timestamp":1725663091703},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167662"},{"type":"electronic","value":"9783540387466"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16766-8_18","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:54:02Z","timestamp":1330178042000},"page":"205-216","source":"Crossref","is-referenced-by-count":0,"title":["Parallel tree techniques and code optimization"],"prefix":"10.1007","author":[{"given":"Eliezer","family":"Dekel","sequence":"first","affiliation":[]},{"given":"Simeon","family":"Ntafos","sequence":"additional","affiliation":[]},{"given":"Shie-Tung","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, A Israeli and Y. Shiloach, \"Finding Euler circuits in logarithmic parallel time,\" Proc. ACM Symp. on Theory of Computing 1984 pp. 249\u2013257","DOI":"10.1145\/800057.808688"},{"key":"18_CR2","first-page":"330","volume":"29","author":"M. Atallah","year":"1984","unstructured":"M. Atallah and U. Vishkin, \"Finding Euler tours in parallel,\" J. CSS, 29, 1984, pp. 330\u2013337.","journal-title":"J. CSS"},{"key":"18_CR3","first-page":"340","volume-title":"Compilation of arithmetic expressions for parallel computations","author":"J. L. Baer","year":"1969","unstructured":"J. L. Baer and D. P. Bovet, \"Compilation of arithmetic expressions for parallel computations,\" Information Processing 68 \u2014 North-Holland Publishing Company \u2014 Amsterdam, 1969, pp 340\u2013346."},{"key":"18_CR4","unstructured":"I. Bar-on and U. Vishkin, \"Optimal parallel generation of a computation tree form,\" Proc. on para. comp. IEEE(1984), 490\u2013495."},{"key":"18_CR5","unstructured":"E. Dekel and S. Peng, \"Optimal Parallel Algorithms for Binary Trees,\" TR \u2014 213, Univ. of Texas at Dallas, Aug. 1985."},{"issue":"3","key":"18_CR6","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/2166.357211","volume":"5","author":"E. Dekel","year":"1983","unstructured":"E. Dekel and S. Sahni, \"Parallel generation of postfix and tree forms,\" ACM Trans. on Prog. Lang. and Sys., 5,3 (1983), pp 300\u2013317.","journal-title":"ACM Trans. on Prog. Lang. and Sys."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"E. Dekel and S. Sahni, \"Binary trees and parallel scheduling algorithms,\" IEEE Trans. on Comp., Vol. C-32, No. 3, March 1983.","DOI":"10.1109\/TC.1983.1676223"},{"key":"18_CR8","volume-title":"Scheduling trees in parallel","author":"D. Dolev","year":"1984","unstructured":"D. Dolev, E. Upfal and M. Warmuth, \"Scheduling trees in parallel,\" \" Proceeding of VLSI: Algorithms and Architectures. International Workship on parallel Computing and VLSI, Italy, 1984."},{"issue":"2","key":"18_CR9","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1145\/357094.357099","volume":"2","author":"N. F. Charles","year":"1980","unstructured":"Charles N. Fischer, \"On parsing and compiling arithmetic expressions on vector computers,\" ACM Trans. on Prog. Lang. and Syt. Vol. 2, No. 2, April 1980, pp 203\u2013224.","journal-title":"ACM Trans. on Prog. Lang. and Syt."},{"issue":"1","key":"18_CR10","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/PGEC.1966.264378","volume":"EC-15","author":"H. Hellerman","year":"1965","unstructured":"H. Hellerman, \"Parallel processing of algebraic expressions,\" IEEE Tran. on Electronic Computers, Vol. EC-15, No. 1, Feb. 1965, pp 82\u201391.","journal-title":"IEEE Tran. on Electronic Computers"},{"key":"18_CR11","volume-title":"Fundamentals of computer algorithms","author":"E. Horowitz","year":"1984","unstructured":"E. Horowitz and S. Sahni, \"Fundamentals of computer algorithms,\" Computer Science Press, Inc, 1984."},{"issue":"3","key":"18_CR12","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321958.321973","volume":"23","author":"D. E. Muller","year":"1976","unstructured":"David E. Muller and Franco P. Preparata, \"Restructuring of arithmetic expressions for parallel evaluation,\" Journal of ACM, Vol. 23, No. 3, July 1976, pp 514\u2013543.","journal-title":"Journal of ACM"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Gary L. Miller and John H. Reif, \"Parallel tree contraction and its applications,\" Proc. 26th Annual Symp. on Foundations of Comp. Sci. 1986, pp 478\u2013489.","DOI":"10.1109\/SFCS.1985.43"},{"key":"18_CR14","unstructured":"S. Ntafos, E. Dekel and S. Peng, \"Compression trees and their application,\" TR-218, UTD Feb. 1986."},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"D. Nassimi and S. Sahni, \"Finding connected components and connected one on a mesh-connected parallel computer,\" SIAM J. COMPUT. Vol. 9, No. November 1980.","DOI":"10.1137\/0209058"},{"issue":"1","key":"18_CR16","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1145\/363242.363256","volume":"10","author":"H. S. Stone","year":"1967","unstructured":"Harold S. Stone, \"One-pass compilation of arithmetic expressions for a parallel processor,\" Communications of the ACM, Vol. 10, No. 1, April 1967, pp 220\u2013223.","journal-title":"Communications of the ACM"},{"issue":"4","key":"18_CR17","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1145\/321607.321620","volume":"17","author":"R. Sethi","year":"1970","unstructured":"R. Sethi and J. D. Ullman, \"The generation of optimal code for arithmetic expressions,\" J. of ACM, 17, 4 (Oct. 1970), pp 715\u2013728.","journal-title":"J. of ACM"},{"key":"18_CR18","unstructured":"R.E. Tarjan and U. Vishkin, \"Finding biconnected components and computing tree functions in logarithmic parallel time\" FOCS 84"},{"key":"18_CR19","unstructured":"U. Vishkin, \"Synchronous Parallel Computation \u2014 A Survey,\" TR-71, Dept. of Computer Science Courant Inst. NYU, 1983."},{"key":"18_CR20","unstructured":"U. Vishkin, \"Implementation of simultaneous memory address access in model that forbid it,\" TR-210, Israel Ins. of Tech., July, 1981."},{"key":"18_CR21","series-title":"Technical Report TR","volume-title":"The complexity of parallel computation","author":"J. C. Wyllie","year":"1979","unstructured":"J. C. Wyllie, \"The complexity of parallel computation,\" Technical Report TR 79-387, Dept. of Computer Science, Cornell Univ., Ithaca, 1979."}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16766-8_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:11:05Z","timestamp":1605625865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16766-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167662","9783540387466"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-16766-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}