SIMPLE CONSTANT-TIME CONSENSUS PROTOCOLS IN REALISTIC FAILURE MODELS

被引：44

作者：

CHOR, B

MERRITT, M

SHMOYS, DB

机构：

[1] MIT,CAMBRIDGE,MA 02139

[2] AT&T BELL LABS,MURRAY HILL,NJ 07974

[3] MIT,CAMBRIDGE,MA 02139

来源：

JOURNAL OF THE ACM | 1989年 / 36卷 / 03期

关键词：

D O I：

10.1145/65950.65956

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：591 / 614

页数：24

共 25 条

[1] RSA AND RABIN FUNCTIONS - CERTAIN PARTS ARE AS HARD AS THE WHOLE [J].

ALEXI, W ;

CHOR, B ;

GOLDREICH, O ;

SCHNORR, CP .

SIAM JOURNAL ON COMPUTING, 1988, 17 (02) :194-209

[2] COMPLEXITY OF NETWORK SYNCHRONIZATION [J].

AWERBUCH, B .

JOURNAL OF THE ACM, 1985, 32 (04) :804-823

[3]

AWERBUCH B, UNPUB IMPLEMENT BRAC

[4]

BENOR M, 1983, 2ND P ANN ACM S PRIN, P27

[5] AN O(LOG-N) EXPECTED ROUNDS RANDOMIZED BYZANTINE GENERALS PROTOCOL [J].

BRACHA, G .

JOURNAL OF THE ACM, 1987, 34 (04) :910-920

[6] ASYNCHRONOUS CONSENSUS AND BROADCAST PROTOCOLS [J].

BRACHA, G ;

TOUEG, S .

JOURNAL OF THE ACM, 1985, 32 (04) :824-840

[7]

CHOR B, 1984, IEEE T SOFTWARE ENG, V11, P531

[8]

CHOR B, 1985, 4TH P ANN ACM S PRIN, P152

[9]

COAN BA, 1987, THESIS MIT CAMBRIDGE

[10]

DOLEV D, 1982, 14TH P ACM S THEOR C, P401

← 1 2 3 →