ANALYZING A CLASS OF DISTRIBUTIVE PARTITIONING SORT ALGORITHMS

被引：0

|

作者：

VANDERNAT, M ^{[1
]}

VERRIJNSTUART, AA ^{[1
]}

机构：

[1] STATE UNIV LEIDEN,INST APPL MATH & COMP SCI,2312 AV LEIDEN,NETHERLANDS

来源：

SCIENCE OF COMPUTER PROGRAMMING | 1986年 / 7卷 / 01期

关键词：

D O I：

10.1016/0167-6423(86)90003-1

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

COMPUTER PROGRAMMING

引用

收藏

页码：23 / 33

页数：11

相关论文

共 50 条

[1] EXPECTED TIME-COMPLEXITY OF A NEW CLASS OF DISTRIBUTIVE PARTITIONING SORT ALGORITHMS
VANDERNAT, M
ANGEWANDTE INFORMATIK, 1987, (12): : 533 - 536
[2] PRACTICAL SIGNIFICANCE OF DISTRIBUTIVE PARTITIONING SORT
HUITS, M
KUMAR, V
INFORMATION PROCESSING LETTERS, 1979, 8 (04) : 168 - 169
[3] AN INSITU DISTRIBUTIVE SORT
HANDLEY, CC
INFORMATION PROCESSING LETTERS, 1986, 23 (05) : 265 - 270
[4] ON MATRIX PARTITIONING AND A CLASS OF ALGORITHMS
AHMED, N
CHENG, SM
IEEE TRANSACTIONS ON EDUCATION, 1970, E 13 (02) : 103 - &
[5] A SPACE EFFICIENT DISTRIBUTIVE SORT
HANDLEY, CC
INFORMATION PROCESSING LETTERS, 1991, 37 (02) : 75 - 78
[6] EFFICIENT ALGORITHMS FOR A CLASS OF PARTITIONING PROBLEMS
IQBAL, MA
BOKHARI, SH
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1995, 6 (02) : 170 - 175
[7] SORTING BY DISTRIBUTIVE PARTITIONING
DOBOSIEWICZ, W
INFORMATION PROCESSING LETTERS, 1978, 7 (01) : 1 - 6
[8] A CLASS OF BOUNDED APPROXIMATION ALGORITHMS FOR GRAPH PARTITIONING
FEO, TA
KHELLAF, M
NETWORKS, 1990, 20 (02) : 181 - 195
[9] SELECTION BY DISTRIBUTIVE PARTITIONING
ALLISON, DCS
NOGA, MT
INFORMATION PROCESSING LETTERS, 1980, 11 (01) : 7 - 8
[10] THE PARTITIONING PROBLEM FOR A CLASS OF DATA PARALLEL ALGORITHMS
THUNE, M
PARALLEL COMPUTING, 1992, 18 (08) : 867 - 878

← 1 2 3 4 5 →