{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:38:28Z","timestamp":1725467908456},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387968180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040378","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T00:03:50Z","timestamp":1154563430000},"page":"101-110","source":"Crossref","is-referenced-by-count":31,"title":["Optimal parallel evaluation of tree-structured computations by raking (extended abstract)"],"prefix":"10.1007","author":[{"given":"S.","family":"Rao Kosaraju","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arthur L.","family":"Delcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Anderson, R. J. and G. L. Miller, Optimal Parallel Algorithms for List Ranking, Extended Abstract, 1986."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1145\/3318.3478","volume":"7","author":"I. Bar-On","year":"1985","unstructured":"Bar-On, I. and U. Vishkin, Optimal Parallel Generation of a Computation Tree Form, ACM Trans. Prog. Lang. and Sys. 7, pp. 348\u2013357, 1985.","journal-title":"ACM Trans. Prog. Lang. and Sys."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","volume":"70","author":"R. Cole","year":"1986","unstructured":"Cole, R. and U. Vishkin, Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking, Information and Control 70, pp. 32\u201353, 1986.","journal-title":"Information and Control"},{"key":"11_CR4","unstructured":"Cole, R. and U. Vishkin, The Accelerated Centroid Decomposition Technique for Optimal Parallel Tree Evaluation in Logarithmic Time, TR, Courant Institute, June, 1987."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Gibbons, A. and W. Rytter, An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications, RR 77, Dept. of Computer Sci., Univ. of Warwick, April, 1986.","DOI":"10.1007\/3-540-17179-7_28"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Miller, G. L. and J. H. Reif, Parallel Tree Contraction and Its Applications, Proc. 26th Symp. Found. Comp. Sci, pp. 478\u2013489, 1985.","DOI":"10.1109\/SFCS.1985.43"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Miller, G. L., V. Ramachandran, and E. Kaltofen, Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits, Proc. Aegean Workshop on Computing, pp. 236\u2013251, July, 1986.","DOI":"10.1007\/3-540-16766-8_21"},{"key":"11_CR8","unstructured":"Rytter, A., Remarks on Pebble Games on Graphs, Combinatorial Analysis and Its Application (ed. M. Syslo), 1985."}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040378.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:40:14Z","timestamp":1607550014000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040378"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387968180"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0040378","relation":{},"subject":[]}}