OPTIMAL VLSI CIRCUITS FOR SORTING

被引：11
作者：
COLE, R
SIEGEL, A
机构：
来源：
JOURNAL OF THE ACM | 1988年 / 35卷 / 04期
关键词：
D O I：
10.1145/48014.48017
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：777 / 809
页数：33
相关论文
共 26 条
[1]   THE VLSI OPTIMALITY OF THE AKS SORTING NETWORK [J].
BILARDI, G ;
PREPARATA, FP .
INFORMATION PROCESSING LETTERS, 1985, 20 (02) :55-59
[2]   A MINIMUM AREA VLSI NETWORK FOR O(LOG N) TIME SORTING [J].
BILARDI, G ;
PREPARATA, FP .
IEEE TRANSACTIONS ON COMPUTERS, 1985, 34 (04) :336-343
[3]   Area-Time Lower-Bound Techniques with Applications to Sorting [J].
Bilardi, G. ;
Preparata, F. P. .
ALGORITHMICA, 1986, 1 (1-4) :65-91
[4]   AN ARCHITECTURE FOR BITONIC SORTING WITH OPTIMAL VLSI PERFORMANCE [J].
BILARDI, G ;
PREPARATA, FP .
IEEE TRANSACTIONS ON COMPUTERS, 1984, 33 (07) :646-651
[5]  
BILARDI G, 1985, 19TH P ANN C INF SCI, P7
[6]  
BILARDI G, 1985, 12TH P INT C AUT LAN, P53
[7]  
BILARDI G, 1984, THESIS U ILLINOIS UR
[8]  
CARTER L, 1978, 10TH P ANN ACM S THE, P59
[9]  
Cole R., 1985, 26th Annual Symposium on Foundations of Computer Science (Cat. No.85CH2224-4), P208, DOI 10.1109/SFCS.1985.39
[10]  
COLE R, 1985, 192 NEW YORK U COUR
123