Parallelized Huffman and Hu-Tucker searching

@article{Abrahams1994ParallelizedHA,
  title={Parallelized Huffman and Hu-Tucker searching},
  author={Julia Abrahams},
  journal={IEEE Trans. Information Theory},
  year={1994},
  volume={40},
  pages={508-510}
}
Forests constructed by the binary Huffman and Hu-Tucker algorithms solve parallelized search problems. Bounds on the resulting minimum average search lengths for items occurring with given probabilities are established. 

From This Paper

Topics from this paper.
4 Citations
3 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Search Problems

  • R. Ahlsxede, I. Wegener
  • New York Wiley
  • 1987

Ciallager, “Variations on a theme by Huffman,

  • R G.
  • ZEEE Trans. Inform. Theory, vol
  • 1978
2 Excerpts

Similar Papers

Loading similar papers…