Add to ORKGAbstract. We show how to build an alphabetic minimax tree for a sequence W = w1,..., wn of real weights in O(nd log logn) time, where d is the number of distinct integers ⌈wi⌉. We apply this algorithm to building an alphabetic prefix code given a sample
We consider the following variant of Huffman coding in which the costs of the letters rather than th...
AbstractIn this paper, we consider the worst-case time complexity of constructing optimal alphabetic...
[[abstract]]Suffix trees and suffix arrays are the most prominent full-text indices, and their const...
A parallel algorithm is given which constructs an optimal alphabetic tree in O(log³ n) time with n² ...
A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average ...
This thesis studies the question of whether optimal alphabetic binary trees can be constructed in o(...
We describe a modification of the Hu-Tucker algorithm for constructing an optimal alphabetic tree th...
AbstractA minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted ...
Binary trees and binary codes have many applications in various branches of science and engineering,...
Abstract. A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighte...
A new O(nL)-time algorithm is given for finding an optimal prefix-free binary code for a weighted al...
Abstract. We provide an algorithm for listing all minimal double dominating sets of a tree of or-der...
Hu-Tucker alogorithm for building optimal alphabetic binary search trees Sashka Davis Follow this an...
An algorithm is given for finding the minimum weight extension of a prefix code. The algorithm runs ...
We describe an algorithm computing an optimal prefix free code for n unsorted positive weights in le...
We consider the following variant of Huffman coding in which the costs of the letters rather than th...
AbstractIn this paper, we consider the worst-case time complexity of constructing optimal alphabetic...
[[abstract]]Suffix trees and suffix arrays are the most prominent full-text indices, and their const...
A parallel algorithm is given which constructs an optimal alphabetic tree in O(log³ n) time with n² ...
A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average ...
This thesis studies the question of whether optimal alphabetic binary trees can be constructed in o(...
We describe a modification of the Hu-Tucker algorithm for constructing an optimal alphabetic tree th...
AbstractA minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted ...
Binary trees and binary codes have many applications in various branches of science and engineering,...
Abstract. A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighte...
A new O(nL)-time algorithm is given for finding an optimal prefix-free binary code for a weighted al...
Abstract. We provide an algorithm for listing all minimal double dominating sets of a tree of or-der...
Hu-Tucker alogorithm for building optimal alphabetic binary search trees Sashka Davis Follow this an...
An algorithm is given for finding the minimum weight extension of a prefix code. The algorithm runs ...
We describe an algorithm computing an optimal prefix free code for n unsorted positive weights in le...
We consider the following variant of Huffman coding in which the costs of the letters rather than th...
AbstractIn this paper, we consider the worst-case time complexity of constructing optimal alphabetic...
[[abstract]]Suffix trees and suffix arrays are the most prominent full-text indices, and their const...