APPLYING PARALLEL COMPUTATION ALGORITHMS IN THE DESIGN OF SERIAL ALGORITHMS

被引：362

作者：

MEGIDDO, N

机构：

[1] CSIR,NATL RES INST MATH SCI,PRETORIA,SOUTH AFRICA

[2] NORTHWESTERN UNIV,CHICAGO,IL 60611

[3] CARNEGIE MELLON UNIV,PITTSBURGH,PA 15213

来源：

关键词：

D O I：

10.1145/2157.322410

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：852 / 865

页数：14

共 39 条

[1]

Aho A., 1976, DESIGN ANAL COMPUTER

[2]

[Anonymous], 1970, SOVIET MATH DOKL

[3] A SHIFTING ALGORITHM FOR MIN-MAX TREE PARTITIONING [J].

BECKER, RI ;

SCHACH, SR ;

PERL, Y .

[4]

Berge C., 1965, PROGRAMMING GAMES TR

[5]

BORODIN A, 1982, 14TH P ACM S THEOR C, P338

[6] MINIMAL RATIO SPANNING TREES [J].

CHANDRASEKARAN, R .

[7] LOCATION ON TREE NETWORKS - P-CENTRE AND N-DISPERSION PROBLEMS [J].

CHANDRASEKARAN, R ;

DAUGHETY, A .

[8]

CHANDRASEKARAN R, 1978, 357 NW U CTR MATH ST

[9]

Cheriton D., 1976, SIAM Journal on Computing, V5, P724, DOI 10.1137/0205051

[10]

Coffman E.G., 1976, COMPUTER JOB SHOP SC