(LAMBDA, T) COMPLEXITY-MEASURES FOR VLSI COMPUTATIONS IN CONSTANT CHIP AREA

被引:5
作者
CARD, HC
GULAK, PG
MCLEOD, RD
PRIES, W
机构
关键词
D O I
10.1109/TC.1987.5009456
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:112 / 117
页数:6
相关论文
共 25 条
[1]  
AGGARWAL A, 1983, 21ST P ANN ALL C COM, P236
[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]   A CRITIQUE OF NETWORK SPEED IN VLSI MODELS OF COMPUTATION [J].
BILARDI, G ;
PRACCHI, M ;
PREPARATA, FP .
IEEE JOURNAL OF SOLID-STATE CIRCUITS, 1982, 17 (04) :696-702
[4]  
BILARDI G, 1985, VLSI ALGORITHMS ARCH, P78
[5]  
BOWEN BA, 1982, VLSI SYST DES, P280
[6]   CONTRIBUTIONS TO VLSI COMPUTATIONAL-COMPLEXITY THEORY FROM BOUNDS ON CURRENT-DENSITY [J].
CARD, HC ;
PRIES, W ;
MCLEOD, RD .
INTEGRATION-THE VLSI JOURNAL, 1986, 4 (02) :175-183
[7]  
CARTER FL, 1982, MOL ELECTRON DEVICES
[8]  
CARTER FL, 1982, VLSI TECHNOLOGIES 80, P328
[9]   A MODEL OF COMPUTATION FOR VLSI WITH RELATED COMPLEXITY RESULTS [J].
CHAZELLE, B ;
MONIER, L .
JOURNAL OF THE ACM, 1985, 32 (03) :573-588
[10]   DESIGN OF ION-IMPLANTED MOSFETS WITH VERY SMALL PHYSICAL DIMENSIONS [J].
DENNARD, RH ;
GAENSSLEN, FH ;
YU, HN ;
RIDEOUT, VL ;
BASSOUS, E ;
LEBLANC, AR .
IEEE JOURNAL OF SOLID-STATE CIRCUITS, 1974, SC 9 (05) :256-268