Approximating Huffman codes in parallel

P. Berman, M. Karpinski, Y. Nekrich

    Research output: Contribution to journalArticle

    2 Scopus citations

    Abstract

    In this paper we present new results on the approximate parallel construction of Huffman codes. Our algorithm achieves linear work and logarithmic time, provided that the initial set of elements is sorted. This is the first parallel algorithm for that problem with the optimal time and work. Combining our approach with the best known parallel sorting algorithms we can construct an almost optimal Huffman tree with optimal time and work. This also leads to the first parallel algorithm that constructs exact Huffman codes with maximum codeword length H in time O (H) with n / log n processors, if the elements are sorted.

    Original languageEnglish (US)
    Pages (from-to)479-490
    Number of pages12
    JournalJournal of Discrete Algorithms
    Volume5
    Issue number3
    DOIs
    StatePublished - Sep 1 2007

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Discrete Mathematics and Combinatorics
    • Computational Theory and Mathematics

    Fingerprint Dive into the research topics of 'Approximating Huffman codes in parallel'. Together they form a unique fingerprint.

    Cite this