Pages that link to "Item:Q2366067"
From MaRDI portal
The following pages link to On the maximum length of Huffman codes (Q2366067):
Displaying 4 items.
- Trading off worst and expected cost in decision tree problems (Q1679235) (← links)
- Space-efficient Huffman codes revisited (Q2094355) (← links)
- Optimal prefix codes with fewer distinct codeword lengths are faster to construct (Q2272991) (← links)
- Parallel lightweight wavelet tree, suffix array and FM-index construction (Q2397146) (← links)