PATH LENGTH OF BINARY SEARCH TREES

被引：29

作者：

HU, TC

TAN, KC

机构：

来源：

关键词：

D O I：

10.1137/0122024

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：225 / +

页数：1

共 9 条

[1] VARIABLE-LENGTH BINARY ENCODINGS [J].

GILBERT, EN ;

MOORE, EF .

BELL SYSTEM TECHNICAL JOURNAL, 1959, 38 (04) :933-967

[2]

HU TC, 1970, MRC1111 U WISC REP

[3]

HU TC, 1971, SIAM J A MA, P21

[4] A METHOD FOR THE CONSTRUCTION OF MINIMUM-REDUNDANCY CODES [J].

HUFFMAN, DA .

PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1952, 40 (09) :1098-1101

[5] MINIMUM-REDUNDANCY CODING FOR DISCRETE NOISELESS CHANNEL [J].

KARP, RM .

IRE TRANSACTIONS ON INFORMATION THEORY, 1961, 7 (01) :27-&

[6]

Knuth D. E., 1971, Acta Informatica, V1, P14, DOI 10.1007/BF00264289

[7]

Knuth Donald E, 1968, ART COMPUTER PROGRAM, V1

SCHWARTZ, ES .

INFORMATION AND CONTROL, 1964, 7 (01) :37-&

[9] GENERATING A CANONICAL PREFIX ENCODING [J].

SCHWARTZ, ES ;

KALLICK, B .