On the cost of optimal alphabetic code trees with unequal letter costs (Q2472833)

From MaRDI portal
Revision as of 17:48, 27 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the cost of optimal alphabetic code trees with unequal letter costs
scientific article

    Statements

    title
    On the cost of optimal alphabetic code trees with unequal letter costs (English)
    0 references
    author
    Dieter Rautenbach
    0 references
    Christian Szegedy
    0 references
    Jürgen Werber
    0 references
    publication date
    25 February 2008
    0 references
    zbMATH DE Number
    5240292
    0 references
    OpenAlex ID
    W2030964753
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2472833&oldid=35037739"
    Powered by MediaWiki