Title :
Parallelized Huffman and Hu-Tucker searching
Author_Institution :
Div. of Math. Sci., Office of Naval Res., Arlington, VA, USA
fDate :
3/1/1994 12:00:00 AM
Abstract :
Forests constructed by the binary Huffman (1952) and Hu-Tucker (1971) algorithms solve parallelized search problems. Bounds on the resulting minimum average search lengths for items occurring with given probabilities are established
Keywords :
parallel algorithms; probability; search problems; trees (mathematics); Hu-Tucker algorithms; Hu-Tucker searching; Huffman searching; binary Huffman algorithm; minimum average search lengths; parallelized search problems; probabilities; Entropy; Search problems; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
