ON PROBLEM TRANSFORMABILITY IN VLSI

被引：5

作者：

HORNICK, S

SARRAFZADEH, M

机构：

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

[2] UNIV ILLINOIS,DEPT ELECT & COMP ENGN,URBANA,IL 61801

来源：

ALGORITHMICA | 1987年 / 2卷 / 01期

关键词：

D O I：

10.1007/BF01840352

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：97 / 111

页数：15

共 20 条

[1] INFORMATION-TRANSFER AND AREA-TIME TRADEOFFS FOR VLSI MULTIPLICATION [J].

ABELSON, H ;

ANDREAE, P .

COMMUNICATIONS OF THE ACM, 1980, 23 (01) :20-23

[2] Area-Time Lower-Bound Techniques with Applications to Sorting [J].

Bilardi, G. ;

Preparata, F. P. .

ALGORITHMICA, 1986, 1 (1-4) :65-91

[3] THE AREA-TIME COMPLEXITY OF BINARY MULTIPLICATION [J].

BRENT, RP ;

KUNG, HT .

JOURNAL OF THE ACM, 1981, 28 (03) :521-534

[4] PARALLEL SCHEDULING ALGORITHMS [J].

DEKEL, E ;

SAHNI, S .

OPERATIONS RESEARCH, 1983, 31 (01) :24-49

[5] TIGHT CHIP AREA LOWER BOUNDS FOR DISCRETE FOURIER AND WALSH-HADAMARD TRANSFORMATIONS [J].

DURIS, P ;

SYKORA, O ;

VRTO, I ;

THOMPSON, CD .

INFORMATION PROCESSING LETTERS, 1985, 21 (05) :245-247

[6]

DURIS P, 1984, 15TH P ANN ACM STOC, P81

[7]

GAFNI E, 1984, ACT50 U ILL COORD SC

[8]

Garey MR., 1979, COMPUTERS INTRACTABI

[9]

LEIGHTON FT, 1984, 16TH P ANN ACM S THE, P71

[10]

LODI E, 1984, VLSI ALGORITHMS ARCH, P125

← 1 2 →