Pages that link to "Item:Q1390875"
From MaRDI portal
The following pages link to Correctness of constructing optimal alphabetic trees revisited (Q1390875):
Displaying 6 items.
- On the redundancy of \(D\)-ary Fano codes (Q831818) (← links)
- Testing the optimality of alphabetic trees (Q1186607) (← links)
- On the Huffman and alphabetic tree problem with general cost functions (Q2249740) (← links)
- The Optimal Alphabetic Tree problem revisited (Q4632431) (← links)
- Upper and Lower Bounds on Constructing Alphabetic Binary Trees (Q4863980) (← links)
- An optimal, purely functional implementation of the Garsia–Wachs algorithm (Q5110926) (← links)