COLLECTIONS OF FUNCTIONS FOR PERFECT HASHING

被引：8

作者：

BERMAN, F

BOCK, ME

DITTERT, E

ODONNELL, MJ

PLANK, D

机构：

[1] PURDUE UNIV,DEPT STAT,W LAFAYETTE,IN 47907

[2] AT&T BELL LABS,INDIAN HILL,IL

来源：

SIAM JOURNAL ON COMPUTING | 1986年 / 15卷 / 02期

关键词：

D O I：

10.1137/0215044

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：604 / 618

页数：15

共 14 条

[1]

ANDERSON MR, 1979, UNPUB

[2]

BERMAN F, 1981, UNPUB

[3]

BERMAN F, 1982, CSDTR408 PURD U DEP

[4]

Bose R.C., 1960, CAN J MATH, V12, P189

[5]

Carter J Lawrence, 1977, P 9 ANN ACM S THEOR, P106

[6] MINIMAL PERFECT HASH FUNCTIONS MADE SIMPLE [J].

CICHELLI, RJ .

COMMUNICATIONS OF THE ACM, 1980, 23 (01) :17-19

[7] GEOMETRIC PROBLEMS WITH APPLICATION TO HASHING [J].

COMER, D ;

ODONNELL, MJ .

SIAM JOURNAL ON COMPUTING, 1982, 11 (02) :217-226

[8]

DITTERT E, 1982, THESIS PURDUE U W LA

[9] STORING A SPARSE TABLE WITH O(1) WORST CASE ACCESS TIME [J].

FREDMAN, ML ;

KOMLOS, J ;

SZEMEREDI, E .

JOURNAL OF THE ACM, 1984, 31 (03) :538-544

[10] RECIPROCAL HASHING - A METHOD FOR GENERATING MINIMAL PERFECT HASHING FUNCTIONS [J].

JAESCHKE, G .

COMMUNICATIONS OF THE ACM, 1981, 24 (12) :829-833

← 1 2 →