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
来源：
JOURNAL OF THE ACM | 1983年 / 30卷 / 04期
关键词：
D O I：
10.1145/2157.322410
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：852 / 865
页数：14
相关论文
共 39 条
[21]  
Lawler E.L., 1976, COMBINATORIAL OPTIMI
[22]  
MALHORA VM, 1978, O V3 ALGORITHM FINDI
[23]  
Megiddo N., 1979, Mathematics of Operations Research, V4, P414, DOI 10.1287/moor.4.4.414
[24]   FINDING LEAST-DISTANCES LINES [J].
MEGIDDO, N ;
TAMIR, A .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1983, 4 (02) :207-211
[25]   AN O(N-LOG2-N) ALGORITHM FOR THE KTH-LONGEST PATH IN A TREE WITH APPLICATIONS TO LOCATION-PROBLEMS [J].
MEGIDDO, N ;
TAMIR, A ;
ZEMEL, E ;
CHANDRASEKARAN, R .
SIAM JOURNAL ON COMPUTING, 1981, 10 (02) :328-337
[26]  
Megiddo N., 1981, 22nd Annual Symposium on Foundations of Computer Science, P399, DOI 10.1109/SFCS.1981.11
[27]   TOWARDS A GENUINELY POLYNOMIAL ALGORITHM FOR LINEAR-PROGRAMMING [J].
MEGIDDO, N .
SIAM JOURNAL ON COMPUTING, 1983, 12 (02) :347-353
[28]  
MEGIDDO N, 1983, UNPUB SIAM J COMPUT, V12
[29]  
MEGIDDO N, 1983, UNPUB MATH OPER RES, V8
[30]  
MEGIDDO N, 1981, TWISK202 CSIRNRIMS
1234