CONSTRUCTING SORTING NETWORKS FROM K-SORTERS

被引：57

作者：

PARKER, B ^{[1
]}

PARBERRY, I ^{[1
]}

机构：

[1] PENN STATE UNIV,DEPT COMP SCI,UNIVERSITY PK,PA 16802

来源：

关键词：

D O I：

10.1016/0020-0190(89)90196-8

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：157 / 162

页数：6

共 11 条

[1]

BATCHER KE, 1968, 1968 P AFIPS SPRING, P307

[2]

BILARDI G, 1984, 16TH P ANN ACM S THE, P64

[3]

Drysdale R. L. III, 1975, SIAM Journal on Computing, V4, P264, DOI 10.1137/0204022

[4]

GALE D, 1970, 11TH P IEEE ANN S SW, P51

[5]

GREEN MW, 1972, 6TH P PRINC C INF SY, P387

[6]

Knuth D. E., 1973, ART COMPUTER PROGRAM

[7] TIGHT BOUNDS ON THE COMPLEXITY OF PARALLEL SORTING [J].

LEIGHTON, T .

[8] A PARALLEL SORTING SCHEME WHOSE BASIC OPERATION SORTS N ELEMENTS [J].

TSENG, SS ;

LEE, RCT .

INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1985, 14 (06) :455-467

[9]

VANVOORHIS DEC, 1971, 17 STANF U DEP COMP

[10]

[No title captured]