Parallelized Huffman and Hu-Tucker searching
Julia Abrahams · IEEE Transactions on Information Theory · 1994
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.>