Erratum: Conditions for Optimality of the Huffman Algorithm
1998; Society for Industrial and Applied Mathematics; Volume: 27; Issue: 1 Linguagem: Inglês
10.1137/s0097539797328550
ISSN1095-7111
Autores Tópico(s)Advanced Bandit Algorithms Research
ResumoPrevious article Full AccessErratum: Conditions for Optimality of the Huffman AlgorithmD. Stott Parker, Jr.D. Stott Parker, Jr.https://doi.org/10.1137/S0097539797328550PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout"Erratum: Conditions for Optimality of the Huffman Algorithm." SIAM Journal on Computing, 27(1), p. 317[1] D. Parker, Conditions for optimality of the Huffman algorithm, SIAM J. Comput., 9 (1980), 470–489 82e:68064 LinkISIGoogle Scholar[2] Donald Knuth, Huffman’s algorithm via algebra, J. Combin. Theory Ser. A, 32 (1982), 216–224 84k:94009 CrossrefISIGoogle Scholar[3] Google ScholarKeywordsHuffman algorithmoptimal tree constructionweighted path lengthtree heightquasi-linear functionsconvex functionsRényi entropy Previous article FiguresRelatedReferencesCited byDetails What Costs Are Minimized by Huffman Trees?Gunnar Forst and Anders Thorup1 August 2006 | SIAM Journal on Discrete Mathematics, Vol. 19, No. 1AbstractPDF (221 KB) Volume 27, Issue 1| 1998SIAM Journal on Computing History Published online:28 July 2006 InformationCopyright © 1998 Society for Industrial and Applied MathematicsKeywordsHuffman algorithmoptimal tree constructionweighted path lengthtree heightquasi-linear functionsconvex functionsRényi entropyMSC codes94A1594A1794A2494A2994A4568Q2068R0505A0505C05PDF Download Article & Publication DataArticle DOI:10.1137/S0097539797328550Article page range:pp. 317-317ISSN (print):0097-5397ISSN (online):1095-7111Publisher:Society for Industrial and Applied Mathematics
Referência(s)