FAULT TOLERANCE IN NETWORKS OF BOUNDED DEGREE

被引：62

作者：

DWORK, C

PELEG, D

PIPPENGER, N

UPFAL, E

机构：

[1] IBM Almaden Research Cent, United States

来源：

SIAM JOURNAL ON COMPUTING | 1988年 / 17卷 / 05期

关键词：

D O I：

10.1137/0217061

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 [计算机软件与理论];

摘要：

引用

页码：975 / 988

页数：14

共 12 条

[1]

Berge C., 1979, GRAPHS HYPERGRAPHS

[2]

BOLLOBAS B, 1981, LONDON MATH SOC LECT, V52, P80

[3]

THE BYZANTINE GENERALS STRIKE AGAIN [J].

DOLEV, D .

JOURNAL OF ALGORITHMS, 1982, 3 (01) :14-30

[4]

DOLEV D, 1982, INFORM CONTR, V52, P256

[5]

FISCHER MJ, 1983, 273 YAL U DEP COMP S

[6]

EXPLICIT CONSTRUCTIONS OF LINEAR-SIZED SUPERCONCENTRATORS [J].

GABBER, O ;

GALIL, Z .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1981, 22 (03) :407-420

[7]

THE BYZANTINE GENERALS PROBLEM [J].

LAMPORT, L ;

SHOSTAK, R ;

PEASE, M .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1982, 4 (03) :382-401

[8]

REACHING AGREEMENT IN THE PRESENCE OF FAULTS [J].

PEASE, M ;

SHOSTAK, R ;

LAMPORT, L .

JOURNAL OF THE ACM, 1980, 27 (02) :228-234

[9]

PIPPINGER N, 1985, 26TH P FOCS, P31

[10]

Ullman J., 1984, COMPUTATIONAL ASPECT

← 1 2 →