FAST DISTRIBUTED AGREEMENT

被引：33

作者：

TOUEG, S

PERRY, KJ

SRIKANTH, TK

机构：

来源：

SIAM JOURNAL ON COMPUTING | 1987年 / 16卷 / 03期

关键词：

D O I：

10.1137/0216031

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：445 / 457

页数：13

共 16 条

[1]

BECK M, 1986, IN PRESS IMPLEMENTAT

[2]

Dolev D., 1981, 22nd Annual Symposium on Foundations of Computer Science, P159, DOI 10.1109/SFCS.1981.53

[3]

Dolev D., 1982, 23rd Annual Symposium on Foundations of Computer Science, P196, DOI 10.1109/SFCS.1982.51

[4] AUTHENTICATED ALGORITHMS FOR BYZANTINE AGREEMENT [J].

DOLEV, D ;

STRONG, HR .

SIAM JOURNAL ON COMPUTING, 1983, 12 (04) :656-666

[5] AN EFFICIENT ALGORITHM FOR BYZANTINE AGREEMENT WITHOUT AUTHENTICATION [J].

DOLEV, D ;

FISCHER, MJ ;

FOWLER, R ;

LYNCH, NA ;

STRONG, HR .

INFORMATION AND CONTROL, 1982, 52 (03) :257-274

[6]

DOLEV D, 1982, RJ3418 IBM RES LAB T

[7]

HADZILACOS V, 1983, 1983 HARV U AIK COMP

[8] THE BYZANTINE GENERALS PROBLEM [J].

LAMPORT, L ;

SHOSTAK, R ;

PEASE, M .

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

[9]

LAMPORT L, 1982, APR SRI INT

[10]

LYNCH N, 1982, 2ND P IEEE S REL DIS, P46

← 1 2 →