VLSI ALGORITHMS FOR THE CONNECTED COMPONENT PROBLEM

被引：14

作者：

HAMBRUSCH, SE

机构：

来源：

关键词：

D O I：

10.1137/0212023

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：354 / 365

页数：12

共 16 条

[1]

BILARDI G, 1981, P CMU C VLSI SYSTEMS, P81

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

BRENT, RP ;

KUNG, HT .

[3]

CHAZELLE B, 1981, 13TH P ANN ACM S THE, P318

[4]

Guibas L., 1979, P CALTECH C VLSI, P509

[5] COMPUTING CONNECTED COMPONENTS ON PARALLEL COMPUTERS [J].

HIRSCHBERG, DS ;

CHANDRA, AK ;

SARWATE, DV .

[6]

KUNG HT, 1977, COMMUN ASS COMPUT MA, V20, P263

[7]

KUNG HT, 1980, INTRO VLSI SYSTEMS, P260

[8]

Leiserson C. E., 1980, 21st Annual Symposium on Foundations of Computer Science, P270, DOI 10.1109/SFCS.1980.13

[9]

Lipton R. J., 1981, 22nd Annual Symposium on Foundations of Computer Science, P13, DOI 10.1109/SFCS.1981.13

[10]

Mead C., 1980, INTRO VLSI SYSTEMS