SLOWING DOWN SORTING NETWORKS TO OBTAIN FASTER SORTING ALGORITHMS

被引：190

作者：

COLE, R

机构：

来源：

关键词：

D O I：

10.1145/7531.7537

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：200 / 208

页数：9

共 17 条

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[2] SORTING IN C LOG N PARALLEL STEPS
AJTAI, M
KOMLOS, J
SZEMEREDI, E
[J]. COMBINATORICA, 1983, 3 (01) : 1 - 19
[3] A PARALLEL MEDIAN ALGORITHM
COLE, R
YAP, CK
[J]. INFORMATION PROCESSING LETTERS, 1985, 20 (03) : 137 - 139
[4] COLE R, IN PRESS SIAM J COMP
[5] FINDING KTH PATHS AND PARA-CENTERS BY GENERATING AND SEARCHING GOOD DATA-STRUCTURES
FREDERICKSON, GN
JOHNSON, DB
[J]. JOURNAL OF ALGORITHMS, 1983, 4 (01) : 61 - 80
[6] EXPLICIT CONSTRUCTIONS OF LINEAR-SIZED SUPERCONCENTRATORS
GABBER, O
GALIL, Z
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1981, 22 (03) : 407 - 420
[7] Gabow H. N., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P347, DOI 10.1109/SFCS.1984.715935
[8] LINEAR-TIME ALGORITHMS FOR LINEAR-PROGRAMMING IN R3 AND RELATED PROBLEMS
MEGIDDO, N
[J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (04) : 759 - 776
[9] Megiddo N., 1979, Mathematics of Operations Research, V4, P414, DOI 10.1287/moor.4.4.414
[10] PARTITIONING WITH 2 LINES IN THE PLANE
MEGIDDO, N
[J]. JOURNAL OF ALGORITHMS, 1985, 6 (03) : 430 - 433