{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:29Z","timestamp":1725663269352},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514985"},{"type":"electronic","value":"9783540481805"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51498-8_41","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:02:10Z","timestamp":1330203730000},"page":"424-433","source":"Crossref","is-referenced-by-count":2,"title":["Parallel general prefix computations with geometric, algebraic and other applications"],"prefix":"10.1007","author":[{"given":"Frederick","family":"Springsteel","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Stojmenovi\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"41_CR1","series-title":"Technical Report","volume-title":"Broadcasting with selective reduction","author":"S. G. Akl","year":"1988","unstructured":"S.G. Akl, G.R. Guenther, Broadcasting with selective reduction, Technical Report No. 88-232, Department of Computing and Information Science, Queen's University, Kingston, Ontario, Canada, August 1988."},{"key":"41_CR2","volume-title":"Construction of a tree from its traversals in optimal time and space","author":"A. Anderson","year":"1988","unstructured":"A. Anderson and S. Carlsson, Construction of a tree from its traversals in optimal time and space, Comp. Sci. Dept., Lund Univ., Sweden, October 1988."},{"doi-asserted-by":"crossref","unstructured":"M.J. Atallah, R. Cole and M.T. Goodrich, Cascading divide-and-conquer: a technique for designing parallel algorithms, IEEE Symp. Found. Comp. Sci., 151\u2013160, 1987.","key":"41_CR3","DOI":"10.1109\/SFCS.1987.12"},{"issue":"1\u20133","key":"41_CR4","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/S0019-9958(86)80046-8","volume":"69","author":"M. J. Atallah","year":"1986","unstructured":"M.J. Atallah and S.E. Hambrusch, Solving tree problems on a mesh-connected processor array, Information and Control 69, 1\u20133, 168\u2013187, 1986.","journal-title":"Information and Control"},{"issue":"2","key":"41_CR5","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1145\/3318.3478","volume":"7","author":"I. Bar-On","year":"1985","unstructured":"I. Bar-On and U. Vishkin, Optimal parallel generation of a computation tree form, ACM Trans. Program. Lang. Syst., 7,2, 384\u2013357, 1985.","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"41_CR6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01934177","volume":"27","author":"H. A. Burgdorff","year":"1987","unstructured":"H.A. Burgdorff, S. Jajodia, F.N. Springsteel and Y. Zalcstein, Alternative methods for the reconstruction of trees from their traversals, BIT, 27,2, 133\u2013140, 1987.","journal-title":"BIT"},{"key":"41_CR7","first-page":"6","volume":"28","author":"G. H. Chen","year":"1988","unstructured":"G.H. Chen, M.S. Yu and L.T. Liu, Two algorithms for constructing a binary tree from its traversals, Inform. Process. Lett., 28, 6, 1988.","journal-title":"Inform. Process. Lett."},{"unstructured":"R. Cole and U. Vishkin, Faster optimal parallel prefix sums and list ranking, Ultracomputer Note 117, Comp. Sci. TR 277, February 1987.","key":"41_CR8"},{"issue":"2","key":"41_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(88)90165-2","volume":"28","author":"F. Dehne","year":"1988","unstructured":"F. Dehne and I. Stojmenovi\u0107, An O(\u2713n) algorithm for the ECDF searching problem for arbitrary dimensions on a mesh of processors, Inform. Process. Lett., 28, 2, 67\u201370, 1988.","journal-title":"Inform. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"H.N. Gabow, J.L. Bentley and R.E. Tarjan, Scaling and related techniques for geometric problems, ACM Symp. Theory of Computing, 135\u2013143, 1984.","key":"41_CR10","DOI":"10.1145\/800057.808675"},{"key":"41_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0020-0190(83)90046-7","volume":"17","author":"T. Hikita","year":"1983","unstructured":"T. Hikita, Listing and counting subtrees of equal size of a binary tree, Inform. Process. Lett., 17, 225\u2013229, 1983.","journal-title":"Inform. Process. Lett."},{"issue":"5","key":"41_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF01414464","volume":"15","author":"E. Merks","year":"1986","unstructured":"E. Merks, An optimal parallel algorithm for triangulating a set of points in the plane, Int. J. Parallel Programming, 15, 5, 399\u2013411, 1986.","journal-title":"Int. J. Parallel Programming"},{"issue":"2","key":"41_CR13","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01379098","volume":"16","author":"H. Meijer","year":"1987","unstructured":"H. Meijer and S.G. Akl, Optimal computation of prefix sums on a binary tree of processors, Int. J. Parallel Programming, 16, 2, 127\u2013136, 1987.","journal-title":"Int. J. Parallel Programming"},{"issue":"2","key":"41_CR14","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 Trans. Comput., C-30, 2, 101\u2013106, 1981.","journal-title":"IEEE Trans. Comput."},{"unstructured":"J.H. Reif and S. Sandeep, Optimal randomized parallel algorithms for computational geometry, IEEE Int. Conf. Parallel Processing, 270\u2013277, 1987.","key":"41_CR15"},{"unstructured":"I. Stojmenovi\u0107, Computational geometry on a hypercube, IEEE Int. Conf. Parallel Processing, 100\u2013103, 1988.","key":"41_CR16"},{"issue":"20","key":"41_CR17","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1145\/359461.359481","volume":"4","author":"C. D. Thompson","year":"1977","unstructured":"C.D. Thompson and H.T. Kung, Sorting on a mesh-connected parallel computer, Comm. ACM, 4, 20, 263\u2013271, 1977.","journal-title":"Comm. ACM"},{"key":"41_CR18","volume-title":"Computational aspects of VLSI","author":"J. D. Ullman","year":"1984","unstructured":"J.D. Ullman, Computational aspects of VLSI, Comp. Sci. Press, Potomac, MD, 1984."},{"key":"41_CR19","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1137\/0214019","volume":"14","author":"D. E. Wilard","year":"1985","unstructured":"D.E. Wilard, New data structures for orthogonal range queries, SIAM J. Computing, 14, 232\u2013253, 1985.","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51498-8_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:21:37Z","timestamp":1605648097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51498-8_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514985","9783540481805"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-51498-8_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}