UPPER AND LOWER TIME-BOUNDS FOR PARALLEL RANDOM-ACCESS MACHINES WITHOUT SIMULTANEOUS WRITES

被引:191
作者
COOK, S
DWORK, C
REISCHUK, R
机构
[1] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139
[2] UNIV BIELEFELD,FAK MATH,D-4800 BIELEFELD,FED REP GER
[3] IBM CORP,RES LAB,SAN JOSE,CA 95114
[4] UNIV SAARLAND,D-6600 SAARBRUCKEN,FED REP GER
关键词
D O I
10.1137/0215006
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:87 / 97
页数:11
相关论文
共 5 条
[1]  
BORODIN A, UNPUB J COMPUT SYSTE
[2]  
REISCHUK R, 1982, IBM RJ3431 RES REP
[3]   FINDING THE MAXIMUM, MERGING, AND SORTING IN A PARALLEL COMPUTATION MODEL [J].
SHILOACH, Y ;
VISHKIN, U .
JOURNAL OF ALGORITHMS, 1981, 2 (01) :88-102
[4]  
[No title captured]
[5]  
[No title captured]