Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees

DOI10.1016/S0304-3975(00)00183-3zbMath0983.68142OpenAlexW2009811588MaRDI QIDQ5958114

Ming-Yang Kao, Jie Wang

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00183-3

zbMATH Keywords

Huffman treeprefix sums

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Uses Software

• APL

Cites Work

• The Accuracy of Floating Point Summation
• Underflow and the Reliability of Numerical Software
• The Arithmetic of the Digital Computer: A New Approach
• Best “ordering” for floating-point addition
• Parallel Prefix Computation
• Storage Modification Machines
• On the Convergence of the Multidirectional Search Algorithm
• Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
• Parallel Processing with the Perfect Shuffle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees