HASHING FUNCTIONS

被引：42

作者：

KNOTT, GD ^{[1
]}

机构：

[1] NIH, DIV COMP RES & TECHNOL, BETHESDA, MD 20014 USA

来源：

COMPUTER JOURNAL | 1975年 / 18卷 / 03期

关键词：

D O I：

10.1093/comjnl/18.3.265

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：265 / 278

页数：14

相关论文

共 145 条

[1] QUADRATIC SEARCH FOR HASH TABLES OF SIZE PN
ACKERMAN, AF
[J]. COMMUNICATIONS OF THE ACM, 1974, 17 (03) : 164 - 164
[2] ORDERED HASH TABLES
AMBLE, O
KNUTH, DE
[J]. COMPUTER JOURNAL, 1974, 17 (02) : 135 - 142
[3] AMBLE O, STANCS73367 STANF U
[4] INFORMATION THEORETIC APPROACH TO TEXT SEARCHING IN DIRECT ACCESS SYSTEMS
BARTON, IJ
CREASEY, SE
LYNCH, MF
SNELL, MJ
[J]. COMMUNICATIONS OF THE ACM, 1974, 17 (06) : 345 - 350
[5] QUADRATIC HASH METHOD WHEN TABLE SIZE IS NOT A PRIME NUMBER
BATAGELJ, V
[J]. COMMUNICATIONS OF THE ACM, 1975, 18 (04) : 216 - 217
[6] ORGANIZATION OF SYMBOL TABLES
BATSON, A
[J]. COMMUNICATIONS OF THE ACM, 1965, 8 (02) : 111 - &
[7] REALLOCATION OF HASH-CODED TABLES
BAYS, C
[J]. COMMUNICATIONS OF THE ACM, 1973, 16 (01) : 11 - 14
[8] SOME TECHNIQUES FOR STRUCTURING CHAINED HASH TABLES
BAYS, C
[J]. COMPUTER JOURNAL, 1973, 16 (02) : 126 - 131
[9] NOTE ON WHEN TO CHAIN OVERFLOW ITEMS WITHIN A DIRECT-ACCESS TABLE
BAYS, C
[J]. COMMUNICATIONS OF THE ACM, 1973, 16 (01) : 46 - 47
[10] BEATTY J, 1965, PROBLEMS INFORMATION, P206

← 1 2 3 4 5 6 7 8 9 10 →