CONSTRUCTION OF OPTIMAL ALPHA-BETA-LEAF TREES WITH APPLICATIONS TO PREFIX CODE AND INFORMATION-RETRIEVAL

被引：3

作者：

CHOY, DM ^{[1
]}

WONG, CK ^{[1
]}

机构：

[1] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598

来源：

SIAM JOURNAL ON COMPUTING | 1983年 / 12卷 / 03期

关键词：

D O I：

10.1137/0212028

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：426 / 446

页数：21

相关论文

共 9 条

[1] Choy D. M., 1977, BIT (Nordisk Tidskrift for Informationsbehandling), V17, P1, DOI 10.1007/BF01932395
[2] OPTIMAL ALPHA-BETA TREES WITH CAPACITY CONSTRAINT
CHOY, DM
WONG, CK
[J]. ACTA INFORMATICA, 1978, 10 (03) : 273 - 296
[3] MINIMUM-REDUNDANCY CODING FOR DISCRETE NOISELESS CHANNEL
KARP, RM
[J]. IRE TRANSACTIONS ON INFORMATION THEORY, 1961, 7 (01): : 27 - &
[4] AN EFFICIENT ALGORITHM FOR CONSTRUCTING NEARLY OPTIMAL PREFIX CODES
MEHLHORN, K
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (05) : 513 - 517
[5] VARIABLE LENGTH TREE STRUCTURES HAVING MINIMUM AVERAGE SEARCH TIME
PATT, YN
[J]. COMMUNICATIONS OF THE ACM, 1969, 12 (02) : 72 - &
[6] EFFICIENT GENERATION OF OPTIMAL PREFIX CODE - EQUIPROBABLE WORDS USING UNEQUAL COST LETTERS
PERL, Y
GAREY, MR
EVEN, S
[J]. JOURNAL OF THE ACM, 1975, 22 (02) : 202 - 214
[7] Stanfel L. E., 1976, Information Systems, V2, P65, DOI 10.1016/0306-4379(76)90010-7
[8] OPTIMAL TREES FOR A CLASS OF INFORMATION RETRIEVAL PROBLEMS
STANFEL, LE
[J]. INFORMATION STORAGE AND RETRIEVAL, 1973, 9 (01): : 43 - 59
[9] USE OF TREE STRUCTURES FOR PROCESSING FILES
SUSSENGUTH, EH
[J]. COMMUNICATIONS OF THE ACM, 1963, 6 (05) : 272 - 279