• DocumentCode
    1151892
  • Title

    Parallelized Huffman and Hu-Tucker searching

  • Author

    Abrahams, Julia

  • Author_Institution
    Div. of Math. Sci., Office of Naval Res., Arlington, VA, USA
  • Volume
    40
  • Issue
    2
  • fYear
    1994
  • fDate
    3/1/1994 12:00:00 AM
  • Firstpage
    508
  • Lastpage
    510
  • 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;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.312175
  • Filename
    312175
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1151892