{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,17]],"date-time":"2022-04-17T15:05:53Z","timestamp":1650207953059},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"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":7837,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1992,2]]},"DOI":"10.1016\/0022-0000(92)90003-2","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"43-62","source":"Crossref","is-referenced-by-count":3,"title":["Parallel restructuring and evaluation of expressions"],"prefix":"10.1016","volume":"44","author":[{"given":"D.E.","family":"Muller","sequence":"first","affiliation":[]},{"given":"F.P.","family":"Preparata","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(92)90003-2_BIB1","series-title":"Complexity of Sequential and Parallel Numerical Algorithms","first-page":"83","article-title":"The parallel evaluation of arithmetic expression in logarithmic time","author":"Brent","year":"1973"},{"issue":"No. 2","key":"10.1016\/0022-0000(92)90003-2_BIB2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"The parallel evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(92)90003-2_BIB3","series-title":"Proc. IFIP Cong. 1968","first-page":"340","article-title":"Compilation of arithmetic expressions for parallel computation","author":"Baer","year":"1968"},{"key":"10.1016\/0022-0000(92)90003-2_BIB4","series-title":"An optimal parallel algorithm for formula evaluation","author":"Buss","year":"1989"},{"issue":"No. 5","key":"10.1016\/0022-0000(92)90003-2_BIB5","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1109\/T-C.1973.223757","article-title":"The parallel evaluation of arithmetic expression without division","volume":"C-22","author":"Brent","year":"1973","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0022-0000(92)90003-2_BIB6","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1145\/3318.3478","article-title":"Optimal parallel generation of a computation tree form","volume":"7","author":"Bar-On","year":"1985","journal-title":"ACM Trans. Progr. Lang. Systems"},{"key":"10.1016\/0022-0000(92)90003-2_BIB7","series-title":"The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time, TR","author":"Cole","year":"1987"},{"key":"10.1016\/0022-0000(92)90003-2_BIB8","series-title":"Proc. AWOC 88, VLSI Algorithms and Architectures,","first-page":"91","article-title":"Optimal parallel algorithms for expression tree evaluation and list ranking","author":"Cole","year":"1988"},{"key":"10.1016\/0022-0000(92)90003-2_BIB9","article-title":"A Fast Parallel Algorithm for Recognition of Parenthesis Languages","author":"Gupta","year":"1985"},{"key":"10.1016\/0022-0000(92)90003-2_BIB10","series-title":"Proceedings of the 12th International Symposium on Mathematical Foundations of Computer Science","first-page":"93","article-title":"Parallel arithmetic computations: A survey","author":"von zur Gathen","year":"1986"},{"key":"10.1016\/0022-0000(92)90003-2_BIB11","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-17179-7_28","article-title":"An optimal parallel algorithm for dynamic expression evaluation and its applications","author":"Gibbons","year":"1986"},{"key":"10.1016\/0022-0000(92)90003-2_BIB12","series-title":"Proc. AWOC 88, VLSI Algorithms and Architectures","first-page":"101","article-title":"Optimal parallel evaluation of tree-structured computation by raking","author":"Kosaraju","year":"1988"},{"key":"10.1016\/0022-0000(92)90003-2_BIB13","series-title":"Proc. 31st IEEE Symposium on Foundations of Computer Science","first-page":"163","article-title":"A tree-partitioning technique with applications to expression evaluation and term matching","author":"Kosaraju","year":"1990"},{"issue":"No. 2","key":"10.1016\/0022-0000(92)90003-2_BIB14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1137\/0204012","article-title":"Time bounds on the parallel evaluation of arithmetic expressions","volume":"4","author":"Kuck","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(92)90003-2_BIB15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF01744433","article-title":"New lower bound techniques for VLSI","volume":"17","author":"Leighton","year":"1984","journal-title":"Math. Systems Theory"},{"issue":"No. 4","key":"10.1016\/0022-0000(92)90003-2_BIB16","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computations","volume":"27","author":"Ladner","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 1","key":"10.1016\/0022-0000(92)90003-2_BIB17","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/T-C.1973.223593","article-title":"On the parallel evaluation of polynomials","volume":"C-22","author":"Maruyama","year":"1973","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0022-0000(92)90003-2_BIB18","doi-asserted-by":"crossref","unstructured":"I. Munro and M. Paterson, Optimal algorithm for parallel polynomial evaluation, in\u201cProc. IEEE Twelfth Annual Symp. on Switching and Automata Theory, 1971,\u201d pp. 132\u2013139.","DOI":"10.1109\/SWAT.1971.23"},{"issue":"No. 2","key":"10.1016\/0022-0000(92)90003-2_BIB19","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/321879.321882","article-title":"Bounds to complexity of networks for sorting and for switching","volume":"22","author":"Muller","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 3","key":"10.1016\/0022-0000(92)90003-2_BIB20","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1145\/321958.321973","article-title":"Restructuring of arithmetic expressions for parallel evaluation","volume":"23","author":"Muller","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(92)90003-2_BIB21","series-title":"Proc. 26th IEEE Symposium on Foundations of Computer Science","first-page":"478","article-title":"Parallel tree contraction and its applications","author":"Miller","year":"1985"},{"issue":"No. 6","key":"10.1016\/0022-0000(92)90003-2_BIB22","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1109\/TC.1983.1676279","article-title":"Efficient VLSI networks for parallel processing using orthogonal trees","volume":"32","author":"Nath","year":"1983","journal-title":"IEEE Trans. Comput."},{"issue":"No. 5","key":"10.1016\/0022-0000(92)90003-2_BIB23","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1109\/TC.1976.1674647","article-title":"Efficient parallel evaluation of boolean expressions","volume":"C-25","author":"Preparata","year":"1976","journal-title":"IEEE Trans. Comput."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000092900032?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000092900032?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:56:52Z","timestamp":1550325412000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000092900032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["0022000092900032"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(92)90003-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}