{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:28Z","timestamp":1759626628258,"version":"build-2065373602"},"reference-count":21,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4399,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-9424164","CCR-9531028"],"award-info":[{"award-number":["CCR-9424164","CCR-9531028"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011862","name":"University of North Carolina at Greensboro","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100011862","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0304-3975(00)00183-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:54:58Z","timestamp":1027634098000},"page":"101-115","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees"],"prefix":"10.1016","volume":"262","author":[{"given":"Ming-Yang","family":"Kao","sequence":"first","affiliation":[]},{"given":"Jie","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"11","key":"10.1016\/S0304-3975(00)00183-3_BIB1","doi-asserted-by":"crossref","first-page":"1526","DOI":"10.1109\/12.42122","article-title":"Scans as primitive parallel operations","volume":"38","author":"Blelloch","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(00)00183-3_BIB2","series-title":"Synthesis of Parallel Algorithms","article-title":"Prefix sums and their applications","author":"Blelloch","year":"1993"},{"key":"10.1016\/S0304-3975(00)00183-3_BIB3","doi-asserted-by":"crossref","unstructured":"R.P. Brent, H.T. Kung, The chip complexity of binary arithmetic, Proc. 12th Annual ACM Symp. on Theory of Computing, 1980, pp. 190\u2013200.","DOI":"10.1145\/800141.804666"},{"year":"1990","series-title":"Introduction to Algorithms","author":"Cormen","key":"10.1016\/S0304-3975(00)00183-3_BIB4"},{"key":"10.1016\/S0304-3975(00)00183-3_BIB5","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1137\/0905062","article-title":"Underflow and the reliability of numerical software","volume":"5","author":"Demmel","year":"1984","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/S0304-3975(00)00183-3_BIB6","doi-asserted-by":"crossref","unstructured":"F.E. Fich, New bounds for parallel prefix circuits, Proc. 15th Ann. ACM Symp. on Theory of Computing, 1983, pp. 100\u2013109.","DOI":"10.1145\/800061.808738"},{"key":"10.1016\/S0304-3975(00)00183-3_BIB7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/103162.103163","article-title":"What every computer scientist should know about floating-point arithmetic","volume":"23","author":"Goldberg","year":"1990","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0304-3975(00)00183-3_BIB8","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1137\/0914050","article-title":"The accuracy of floating point summation","volume":"14","author":"Higham","year":"1993","journal-title":"SIAM J. Sci. Comput."},{"year":"1962","series-title":"A Programming Language","author":"Iverson","key":"10.1016\/S0304-3975(00)00183-3_BIB9"},{"key":"10.1016\/S0304-3975(00)00183-3_BIB10","unstructured":"M.-Y. Kao, P. Nelson, J. Wang, Implementation of Huffman-tree deletion and insertion for minimizing prefix set summation errors, Tech. Report TR 99-10, Department of Mathematical Sciences, The University of North Carolina at Greensboro, 1999."},{"key":"10.1016\/S0304-3975(00)00183-3_BIB11","doi-asserted-by":"crossref","unstructured":"M.-Y. Kao, J. Wang, Efficient minimization of numerical summation errors, Proc. 25th Internat. Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 1143, Springer, Berlin, 1998, pp. 375\u2013386.","DOI":"10.1007\/BFb0055068"},{"key":"10.1016\/S0304-3975(00)00183-3_BIB12","doi-asserted-by":"crossref","first-page":"1568","DOI":"10.1137\/S0097539798341594","article-title":"Linear-time approximation algorithms for computing numerical summation with provably small errors","volume":"29","author":"Kao","year":"2000","journal-title":"SIAM J. Comput."},{"year":"1981","series-title":"The Art of Computer Programming II: Seminumerical Algorithms","author":"Knuth","key":"10.1016\/S0304-3975(00)00183-3_BIB13"},{"key":"10.1016\/S0304-3975(00)00183-3_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1028001","article-title":"The arithmetic of the digital computer","volume":"28","author":"Kulisch","year":"1986","journal-title":"SIAM Rev."},{"issue":"4","key":"10.1016\/S0304-3975(00)00183-3_BIB15","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(00)00183-3_BIB16","unstructured":"J. van Leeuwen, On the construction of Huffman trees, Proc. 3rd Internat. Colloquium on Automata, Languages, and Programming, 1976, pp. 382\u2013410."},{"key":"10.1016\/S0304-3975(00)00183-3_BIB17","unstructured":"Y. Ofman, On the algorithmic complexity of discrete functions, Sov. Phys.\u2014Dokl. 7(7) (1963) 589\u2013591. English translation."},{"key":"10.1016\/S0304-3975(00)00183-3_BIB18","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1145\/42288.42343","article-title":"Best \u201cordering\u201d for floating-point addition","volume":"14","author":"Robertazzi","year":"1988","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0304-3975(00)00183-3_BIB19","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1137\/0209036","article-title":"Storage modification machines","volume":"9","author":"Sch\u00f6nhage","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(00)00183-3_BIB20","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","article-title":"Parallel processing with the perfect shuffle","volume":"C-20","author":"Stone","year":"1971","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/S0304-3975(00)00183-3_BIB21","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1137\/0801010","article-title":"On the convergence of the multidirectional search algorithm","volume":"1","author":"Torczon","year":"1991","journal-title":"SIAM J. Optim."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001833?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001833?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:55Z","timestamp":1759625575000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001833"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0304397500001833"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00183-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2001,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(00)00183-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}