This is a preview. Log in through your library . Abstract Users of small and personal computers do not have access to the libraries of generators of random variables provided by experts which have ...
An algorithm is given for constructing an alphabetic binary tree of minimum weighted path length (for short, an optimal alphabetic tree). The algorithm needs 4n 2 + 2n operations and 4n storage ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback