Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3682957
- scientific article; zbMATH DE number 4031716
- scientific article; zbMATH DE number 68566
- Optimal computation of prefix sums on a binary tree of processors
- Publication:3027031
- Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions
- Fixed-prefix encoding of the integers can be Huffman-optimal
- On the convex hull of Huffman trees
- scientific article; zbMATH DE number 1091469
- Generalized Huffman coding for binary trees with choosable edge lengths
Cites work
- Best “ordering” for floating-point addition
- scientific article; zbMATH DE number 3165828 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 3558968 (Why is no real title available?)
- scientific article; zbMATH DE number 1223718 (Why is no real title available?)
- scientific article; zbMATH DE number 3214539 (Why is no real title available?)
- Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
- On the Convergence of the Multidirectional Search Algorithm
- Parallel Prefix Computation
- Parallel Processing with the Perfect Shuffle
- Storage Modification Machines
- The Accuracy of Floating Point Summation
- The Arithmetic of the Digital Computer: A New Approach
- Underflow and the Reliability of Numerical Software
Cited in
(2)
This page was built for publication: Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958114)