Wait-free Byzantine consensus
The problem of devising wait-free shared memory consensus protocols that tolerate Byzantine processes is studied.
Saved in:
Published in | Information processing letters Vol. 83; no. 4; pp. 221 - 227 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Amsterdam
Elsevier B.V
31.08.2002
Elsevier Science Elsevier Sequoia S.A |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The problem of devising wait-free shared memory consensus protocols that tolerate Byzantine processes is studied. |
---|---|
ISSN: | 0020-0190 1872-6119 |
DOI: | 10.1016/S0020-0190(01)00334-9 |