Approximating Huffman codes in parallel

Piotr Berman, Marek Karpinski, Yakov Nekrich

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Scopus citations


    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) and with n processors. This represents a useful improvement since most practical situations satisfy H = O(log n).

    Original languageEnglish (US)
    Title of host publicationAutomata, Languages and Programming - 29th International Colloquium, ICALP 2002, Proceedings
    EditorsPeter Widmayer, Stephan Eidenbenz, Francisco Triguero, Rafael Morales, Ricardo Conejo, Matthew Hennessy
    PublisherSpringer Verlag
    Number of pages11
    ISBN (Print)3540438645, 9783540438649
    StatePublished - 2002
    Event29th International Colloquium on Automata, Languages, and Programming, ICALP 2002 - Malaga, Spain
    Duration: Jul 8 2002Jul 13 2002

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume2380 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349


    Other29th International Colloquium on Automata, Languages, and Programming, ICALP 2002

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • General Computer Science


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

    Cite this