{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T23:40:29Z","timestamp":1764027629788,"version":"build-2065373602"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1007\/bf00127876","type":"journal-article","created":{"date-parts":[[2004,11,2]],"date-time":"2004-11-02T17:55:28Z","timestamp":1099418128000},"page":"107-129","source":"Crossref","is-referenced-by-count":15,"title":["Limited width parallel prefix circuits"],"prefix":"10.1007","volume":"4","author":[{"given":"David A.","family":"Carlson","sequence":"first","affiliation":[]},{"given":"Binay","family":"Sugla","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"On Measures of Information and Their Characterizations","author":"J. Aczel","year":"1975","unstructured":"Aczel, J. and Daroczy, Z. 1975. On Measures of Information and Their Characterizations. Academic Press, New York."},{"issue":"2","key":"CR2","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1145\/62044.62052","volume":"36","author":"G. Bilardi","year":"1989","unstructured":"Bilardi, G., and Preparata, F.P. 1989. Size-time complexity of boolean networks for prefix computations. JACM, 36, 2 (Apr.), 362?382.","journal-title":"JACM"},{"issue":"3","key":"CR3","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TC.1982.1675982","volume":"C-31","author":"R.P. Brent","year":"1982","unstructured":"Brent, R.P., and Kung, H.T. 1982. A regular layout for parallel adders. IEEE Trans. Comps., C-31, 3 (Mar.), 260?264.","journal-title":"IEEE Trans. Comps."},{"key":"CR4","unstructured":"Carlson, D.A., and Sugla, B. 1984. Time and processor efficient algorithms for linear recurrence equations and related problems. In Proc., 1984 Internat. Conf. on Parallel Processing (Aug.), pp. 310?314."},{"issue":"1","key":"CR5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0167-8191(89)90065-3","volume":"11","author":"D.A. Carlson","year":"1989","unstructured":"Carlson, D.A., and Sugla, B. 1989. Adapting shuffle-exchange like parallel processing organizations to work as systolic arrays. Parallel Computing, 11, 1 (July), 93?106.","journal-title":"Parallel Computing"},{"issue":"7","key":"CR6","first-page":"707","volume":"C-24","author":"S.C. Chen","year":"1975","unstructured":"Chen, S.C., and Kuck, D.J. 1975. Time and parallel processor bounds for linear recurrence systems. IEEE Trans. Comps., C-24, 7 (July), 707?717.","journal-title":"IEEE Trans. Comps."},{"key":"CR7","series-title":"Rept. no. UCB\/CSD82\/111","doi-asserted-by":"crossref","DOI":"10.21236\/ADA121898","volume-title":"VLSI implementation of digital Fourier transforms","author":"A. Despain","year":"1982","unstructured":"Despain, A., Sequin, C., Thompson, C., Wold, E., and Lioupis, D. 1982. VLSI implementation of digital Fourier transforms. Rept. no. UCB\/CSD82\/111, Comp. Sci. Div., Univ. of Calif., Berkeley (Nov.)."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Fich, F.E. 1983. New bounds for parallel prefix circuits. In Proc., 15th Symp. on the Theory of Computing (Apr.), pp. 100?109.","DOI":"10.1145\/800061.808738"},{"issue":"3","key":"CR9","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TC.1981.1675755","volume":"C-30","author":"D. Gajski","year":"1981","unstructured":"Gajski, D. 1981. An algorithm for solving linear recurrence systems on parallel and pipelined machines. IEEE Trans. Comps., C-30, 3 (Mar.), 190?206.","journal-title":"IEEE Trans. Comps."},{"issue":"1","key":"CR10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(82)90081-3","volume":"15","author":"A.G. Greenberg","year":"1982","unstructured":"Greenberg, A.G., Ladner, R.E., Paterson, M.S., and Galil, Z. 1982. Efficient parallel algorithms for linear recurrence computation. Information Processing Letters, 15, 1 (Aug.), 31?35.","journal-title":"Information Processing Letters"},{"issue":"8","key":"CR11","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1109\/TC.1973.5009159","volume":"C-22","author":"P.M. Kogge","year":"1973","unstructured":"Kogge, P.M., and Stone, H.S. 1973. A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Trans. Comps., C-22, 8 (Aug.), 786?793.","journal-title":"IEEE Trans. Comps."},{"issue":"10","key":"CR12","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TC.1985.6312202","volume":"C-34","author":"C.P. Kruskal","year":"1985","unstructured":"Kruskal, C.P., Rudolph, L., and Snir, M. 1985. The power of parallel prefix. IEEE Trans. Comps., C-34, 10 (Oct.), 965?968.","journal-title":"IEEE Trans. Comps."},{"issue":"4","key":"CR13","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R.E. Ladner","year":"1980","unstructured":"Ladner, R.E., and Fischer, M.J. 1980. Parallel prefix computation. JACM, 27, 4 (Oct.), 831?838.","journal-title":"JACM"},{"key":"CR14","unstructured":"Lakshmivarahan, S., Yang, C., and Dhall, S.K. 1987. On a new class of optimal parallel prefix circuits. In Proc., 1987 Internat. Conf. on Parallel Processing (Aug.), pp. 58?65."},{"issue":"2","key":"CR15","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0022-0000(73)80043-1","volume":"7","author":"J.I. Munro","year":"1973","unstructured":"Munro, J.I., and Paterson, M.S. 1973. Optimal algorithms for parallel polynomial evaluation. J. Computer and and System Sciences, 7, 2: 189?198.","journal-title":"J. Computer and and System Sciences"},{"key":"CR16","first-page":"589","volume":"7","author":"Y. Ofman","year":"1963","unstructured":"Ofman, Y. 1963. On the algorithmic complexity of discrete functions. Cybernetics and Control Theory, Soviet Physics Doklady, 7 (Jan.), 589?591.","journal-title":"Cybernetics and Control Theory, Soviet Physics Doklady"},{"key":"CR17","unstructured":"Reif, J. 1984. Probabilistic parallel prefix computation. In Proc., 1984 Internat. Conf. on Parallel Processing (Aug.), pp. 291?298."},{"issue":"2","key":"CR18","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0196-6774(86)90003-9","volume":"7","author":"M. Snir","year":"1986","unstructured":"Snir, M. 1986. Depth-size tradeoffs for parallel prefix computation. J. Algorithms, 7, 2 (June), 185?201.","journal-title":"J. Algorithms"},{"issue":"2","key":"CR19","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1109\/12.45210","volume":"39","author":"B. Sugla","year":"1990","unstructured":"Sugla, B., and Carlson, D.A. 1990. Extreme area-time tradeoffs in VLSI. IEEE Trans. Comps., 39, 2 (Feb.), 251?257.","journal-title":"IEEE Trans. Comps."}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00127876.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00127876\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00127876","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T04:49:49Z","timestamp":1554266989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00127876"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["BF00127876"],"URL":"https:\/\/doi.org\/10.1007\/bf00127876","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}