THE EXPECTED LENGTH OF THE LONGEST PROBE SEQUENCE FOR BUCKET SEARCHING WHEN THE DISTRIBUTION IS NOT UNIFORM

被引：21

作者：

DEVROYE, L ^{[1
]}

机构：

[1] MCGILL UNIV,SCH COMP SCI,MONTREAL H3A 2K6,QUEBEC,CANADA

来源：

JOURNAL OF ALGORITHMS | 1985年 / 6卷 / 01期

关键词：

D O I：

10.1016/0196-6774(85)90015-X

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：1 / 9

页数：9

共 12 条

[1] ON THE AVERAGE-CASE COMPLEXITY OF BUCKETING ALGORITHMS [J].

AKL, SG ;

MEIJER, H .

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1982, 3 (01) :9-13

[2] AVERAGE TIME BEHAVIOR OF DISTRIBUTIVE SORTING ALGORITHMS [J].

DEVROYE, L ;

KLINCSEK, T .

COMPUTING, 1981, 26 (01) :1-7

[3] ON THE AVERAGE COMPLEXITY OF SOME BUCKETING ALGORITHMS [J].

DEVROYE, L .

COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1981, 7 (05) :407-412

[4] SORTING BY DISTRIBUTIVE PARTITIONING [J].

DOBOSIEWICZ, W .

INFORMATION PROCESSING LETTERS, 1978, 7 (01) :1-6

[5] SEARCHING AND SORTING REAL NUMBERS [J].

EHRLICH, G .

JOURNAL OF ALGORITHMS, 1981, 2 (01) :1-12

[6] EXPECTED LENGTH OF THE LONGEST PROBE SEQUENCE IN HASH CODE SEARCHING [J].

GONNET, GH .

JOURNAL OF THE ACM, 1981, 28 (02) :289-304

[7]

Knuth D. E., 1973, ART COMPUTER PROGRAM

[8] EXPECTED WORST-CASE PERFORMANCE OF HASH FILES [J].

LARSON, PA .

COMPUTER JOURNAL, 1982, 25 (03) :347-352

[9] THE DESIGN AND ANALYSIS OF A NEW HYBRID SORTING ALGORITHM [J].

MEIJER, H ;

AKL, SG .

INFORMATION PROCESSING LETTERS, 1980, 10 (4-5) :213-218

[10] A USEFUL CONVERGENCE THEOREM FOR PROBABILITY DISTRIBUTIONS [J].

SCHEFFE, H .

ANNALS OF MATHEMATICAL STATISTICS, 1947, 18 (03) :434-438

← 1 2 →