ON THE AVERAGE-CASE COMPLEXITY OF BUCKETING ALGORITHMS

被引：11

作者：

AKL, SG

MEIJER, H

机构：

来源：

JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC | 1982年 / 3卷 / 01期

关键词：

D O I：

10.1016/0196-6774(82)90003-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：9 / 13

页数：5

共 15 条

[1] SELECTION BY DISTRIBUTIVE PARTITIONING [J].

ALLISON, DCS ;

NOGA, MT .

INFORMATION PROCESSING LETTERS, 1980, 11 (01) :7-8

[2] OPTIMAL EXPECTED-TIME ALGORITHMS FOR CLOSEST POINT PROBLEMS [J].

BENTLEY, JL ;

WEIDE, BW ;

YAO, AC .

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1980, 6 (04) :563-580

[3]

BENTLEY JL, CMUCS80109 CARN MELL

[4]

BROWN KQ, CMUCS80101 CARN MELL

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

DEVROYE, L ;

KLINCSEK, T .

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

[6] SORTING BY DISTRIBUTIVE PARTITIONING [J].

DOBOSIEWICZ, W .

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

[7] NOTE ON RABINS NEAREST-NEIGHBOR ALGORITHM [J].

FORTUNE, S ;

HOPCROFT, J .

INFORMATION PROCESSING LETTERS, 1979, 8 (01) :20-23

[8]

Gonzalez T., 1975, ALGORITHMS SETS RELA

[9]

Gumbel E J., 1958, STAT EXTREMES

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

MEIJER, H ;

AKL, SG .

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

← 1 2 →