Constructing Huffman Trees in Parallel
- 1 December 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (6) , 1163-1169
- https://doi.org/10.1137/s0097539792233245
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Finding least-weight subsequences with fewer processorsAlgorithmica, 1993
- On-line dynamic programming with applications to the prediction of RNA secondary structureJournal of Algorithms, 1991
- Efficient Parallel Algorithms for String Editing and Related ProblemsSIAM Journal on Computing, 1990
- An Almost Linear Time Algorithm for Generalized Matrix SearchingSIAM Journal on Discrete Mathematics, 1990
- A linear-time algorithm for concave one-dimensional dynamic programmingInformation Processing Letters, 1990
- The concave least-weight subsequence problem revisitedJournal of Algorithms, 1988
- Data structures and algorithms for approximate string matchingJournal of Complexity, 1988
- The Least Weight Subsequence ProblemSIAM Journal on Computing, 1987
- Path Length of Binary Search TreesSIAM Journal on Applied Mathematics, 1972