ON PARALLEL SEARCHING

被引：64

作者：

SNIR, M ^{[1
]}

机构：

[1] NYU,COURANT INST MATH SCI,NEW YORK,NY 10012

来源：

关键词：

D O I：

10.1137/0214051

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：688 / 708

页数：21

共 14 条

[1]

BAER JL, 1983, IEEE T COMPUT, V32, P667, DOI 10.1109/TC.1983.1676298

[2]

BORODIN A, 1982, LOGIC ALGORITHMIC MO, V30

[3]

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

[4]

ECKSTEIN DM, 1979, TR796 IOW STAT U COM

[5] OPTIMAL SEQUENTIAL AND PARALLEL SEARCH FOR FINDING A ROOT [J].

GAL, S ;

MIRANKER, W .

[6]

KRUSKAL CP, 1981, THESIS NEW YORK U NE

[7]

LYNCH N, COMMUNICATION

[8] On a problem of formal logic [J].

Ramsey, FP .

[9]

Schwartz J. T., 1980, ACM Transactions on Programming Languages and Systems, V2, P484, DOI 10.1145/357114.357116

[10]

SNIR M, 1982, AUG P ACM S DISTR CO, P242