Approximating Huffman codes in parallel (Q2466011)

From MaRDI portal
Revision as of 19:46, 18 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Approximating Huffman codes in parallel
scientific article

    Statements

    title
    Approximating Huffman codes in parallel (English)
    0 references
    author
    Piotr Berman
    0 references
    Marek Karpinski
    0 references
    Yakov Nekrich
    0 references
    publication date
    11 January 2008
    0 references
    zbMATH Keywords
    approximation algorithms
    0 references
    Huffman codes
    0 references
    parallel algorithms
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W25
    0 references
    68W10
    0 references
    94B60
    0 references
    zbMATH DE Number
    5225240
    0 references
    OpenAlex ID
    W2038490901
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2466011&oldid=39101797"
    Powered by MediaWiki