EASY IMPOSSIBILITY PROOFS FOR DISTRIBUTED CONSENSUS PROBLEMS

被引：129

作者：

FISCHER, MJ

LYNCH, NA

MERRITT, M

机构：

[1] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139

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

来源：

关键词：

D O I：

10.1007/BF01843568

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：26 / 39

页数：14

共 12 条

[1]

ANGLUIN D, 1980, 12TH P ANN ACM S THE, P82

[2]

BURNS J, 1984, UNPUB BYZANTINE FIRI

[3]

Burns J. E., 1980, TR91 IND U

[4]

COAN B, 1985, 17TH P STOC PROV

[5] THE BYZANTINE GENERALS STRIKE AGAIN [J].

DOLEV, D .

[6]

DOLEV D, 1983, 3RD P ANN IEEE S DIS

[7]

DOLEV D, 1984, 16TH P ACM S THEOR C, P504

[8]

ITAI A, 1981, IBM RJ3110 RES REP

[9] THE WEAK BYZANTINE GENERALS PROBLEM [J].

LAMPORT, L .

[10] THE BYZANTINE GENERALS PROBLEM [J].

LAMPORT, L ;

SHOSTAK, R ;

PEASE, M .

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