On the message complexity of binary byzantine agreement under crash failures Eugene S. AmdurSamuel M. WeberVassos Hadzilacos OriginalPaper Pages: 175 - 186
Efficient parallel algorithms can be made robust Paris C. KanellakisAlex A. Shvartsman OriginalPaper Pages: 201 - 217
A self-adjusting algorithm for byzantine agreement Yi ZhaoFarokh B. Bastani OriginalPaper Pages: 219 - 226