Pages that link to "Item:Q1390875"

The following pages link to Correctness of constructing optimal alphabetic trees revisited (Q1390875):

Displaying 3 items.

• On the redundancy of \(D\)-ary Fano codes (Q831818) (← links)
• On the Huffman and alphabetic tree problem with general cost functions (Q2249740) (← links)
• An optimal, purely functional implementation of the Garsia–Wachs algorithm (Q5110926) (← links)