A SIMPLE PARALLEL TREE CONTRACTION ALGORITHM

被引：134

作者：

ABRAHAMSON, K ^{[1
]}

DADOUN, N ^{[1
]}

KIRKPATRICK, DG ^{[1
]}

PRZYTYCKA, T ^{[1
]}

机构：

[1] UNIV BRITISH COLUMBIA,DEPT COMP SCI,VANCOUVER V6T 1W5,BC,CANADA

来源：

JOURNAL OF ALGORITHMS | 1989年 / 10卷 / 02期

关键词：

D O I：

10.1016/0196-6774(89)90017-5

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：287 / 302

页数：16

共 17 条

[1]

ABRAHAMSON K, 1987, 8714 U BRIT COL COMP

[2] OPTIMAL PARALLEL GENERATION OF A COMPUTATION TREE FORM [J].

BARON, I ;

VISHKIN, U .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1985, 7 (02) :348-357

[3] PARALLEL EVALUATION OF GENERAL ARITHMETIC EXPRESSIONS [J].

BRENT, RP .

JOURNAL OF THE ACM, 1974, 21 (02) :201-206

[4]

COLE R, 18TH ANN S THEOR COM, P206

[5]

COLE R, 27TH ANN S F COMP SC, P478

[6]

COLE R, 1986, 108TR242 COUR I DEP

[7] COMPLEMENT REDUCIBLE GRAPHS [J].

CORNEIL, DG ;

LERCHS, H ;

BURLINGHAM, LS .

DISCRETE APPLIED MATHEMATICS, 1981, 3 (03) :163-174

[8]

DADOUN N, 3RD ACM S COMP GEOM, P205

[9]

GIBBONS A, 1986 S F SOFTW TECHN, P453

[10]

HE X, 24TH ALL C COMM CONT, P777

← 1 2 →