TOWARDS OPTIMAL PARALLEL BUCKET SORTING

被引：31

作者：

HAGERUP, T

机构：

来源：

关键词：

D O I：

10.1016/0890-5401(87)90062-9

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：39 / 51

页数：13

共 16 条

[1]

BOAS PV, 1977, MATH SYST THEORY, V10, P99

COLE, R ;

VISHKIN, U .

INFORMATION AND CONTROL, 1986, 70 (01) :32-53

[3]

Cole R., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P478, DOI 10.1109/SFCS.1986.10

[4]

Cole R., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P511, DOI 10.1109/SFCS.1986.41

[5]

COLE R, 1987, IN PRESS INFORM COMP

[6]

FICH FE, 1984, 3RD P ANN ACM S PRIN, P179

[7]

FICH FE, 1985, 17TH P ANN ACM S THE, P48

[8] A UNIVERSAL INTERCONNECTION PATTERN FOR PARALLEL COMPUTERS [J].

GOLDSCHLAGER, LM .

[9] FAST PARALLEL SORTING ALGORITHMS [J].

HIRSCHBERG, DS .

[10]

Knuth D. E., 1973, ART COMPUTER PROGRAM