A MINIMUM AREA VLSI NETWORK FOR O(LOG N) TIME SORTING

被引：24

作者：

BILARDI, G ^{[1
]}

PREPARATA, FP ^{[1
]}

机构：

[1] UNIV ILLINOIS,COORDINATED SCI LAB,URBANA,IL 61801

来源：

关键词：

D O I：

10.1109/TC.1985.5009384

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：336 / 343

页数：8

共 17 条

[1]

AGGARWAL A, 1983, 21ST P ANN ALL C COM, P236

[2]

AITAI M, 1983, 15TH P ACM S THEOR C, P1

BILARDI, G ;

PREPARATA, FP .

[4]

BILARDI G, UNPUB INFORM PROCESS

[5]

BILARDI G, 1984, R1008 U ILL COORD SC

[6]

Leighton F. T., 1981, 22nd Annual Symposium on Foundations of Computer Science, P1, DOI 10.1109/SFCS.1981.22

[7]

LEIGHTON FT, 1981, THESIS MIT CAMBRIDGE

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

LEIGHTON, T .

[9] BOUNDS TO COMPLEXITIES OF NETWORKS FOR SORTING AND FOR SWITCHING [J].

MULLER, DE ;

PREPARATA, FP .

[10]

NASSIMI D, 1982, JACM, V20, P642