EXPECTED LENGTH OF THE LONGEST PROBE SEQUENCE IN HASH CODE SEARCHING

被引：139

作者：

GONNET, GH

机构：

来源：

关键词：

D O I：

10.1145/322248.322254

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：289 / 304

页数：16

共 16 条

[1]

Abramovitz M, 1964, HDB MATH FUNCTIONS

[2]

Arfwedson G, 1951, SKAND AKTUARIETIDSKR, V34, P121

[3] REDUCING RETRIEVAL TIME OF SCATTER STORAGE TECHNIQUES [J].

BRENT, RP .

[4]

DEBRUIJN NG, 1970, ASYMPTOTIC METHODS

[5]

Feller W., 1957, INTRO PROBABILITY TH, V1

[6] EFFICIENT ORDERING OF HASH TABLES [J].

GONNET, GH ;

MUNRO, JI .

[7] NOTES ON DERIVATION OF SYMPTOTIC EXPRESSIONS FROM SUMMATIONS [J].

GONNET, GH .

[8]

GONNET GH, 1977, AUG P C THEOR COMP S, P159

[9] ANALYSIS OF HASHING TECHNIQUES THAT EXHIBIT K-ARY CLUSTERING [J].

GUIBAS, LJ .

[10] ANALYSIS OF DOUBLE HASHING [J].

GUIBAS, LJ ;

SZEMEREDI, E .