Variable length tree structures having minimum average search time
Communications of the ACM
Randomized binary search technique
Communications of the ACM
A comment on optimal tree structures
Communications of the ACM
Use of tree structures for processing files
Communications of the ACM
Journal of the ACM (JACM)
Heuristics for trie index minimization
ACM Transactions on Database Systems (TODS)
Practical Aspects of Doubly Chained Trees for Retrieval
Journal of the ACM (JACM)
Analysis and performance of inverted data base structures
Communications of the ACM
A comment on the double-chained tree
Communications of the ACM
A note on optimal doubly-chained trees
Communications of the ACM
Adaptive correction of program statements
Communications of the ACM
Huffman coding with unequal letter costs
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An associative file store using fragments for run-time indexing and compression
SIGIR '80 Proceedings of the 3rd annual ACM conference on Research and development in information retrieval
IEEE Transactions on Information Theory
The structure of optimal prefix-free codes in restricted languages: the uniform probability case
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
| Hi-index | 0.13 |
It is shown that, owing to certain restrictions placed upon the set of admissible structures, some previous solutions have not characterized trees in which expected search time is minimized. The more general problem is shown to be a special case of a coding problem, which was previously formulated and solved as a linear integer programming problem, and in the special case of equally probable key requests is found to be solvable almost by inspection. Some remarks are given regarding the possibility of realizing a shorter computational procedure than would be expected from an integer programming algorithm, along with a comparison of results from the present method with those of the previous.