E. S. Amdur, S. M. Weber, and V. Hadzilacos. On the message complexity of binary Byzantine agreement under crash failures. Distributed Computing, 5(4):175--186, Apr. 1992. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Hundreds of Impossibility Results for Distributed Computing - Fich, Ruppert (3 citations) (Correct)
No context found.
E. S. Amdur, S. M. Weber, and V. Hadzilacos. On the message complexity of binary Byzantine agreement under crash failures. Distributed Computing, 5(4):175--186, Apr. 1992.
Hundreds of Impossibility Results for Distributed Computing - Fich, Ruppert (2003) (3 citations) (Correct)
No context found.
Eugene S. Amdur, Samuel M. Weber, and Vassos Hadzilacos. On the message complexity of binary Byzantine agreement under crash failures. Distributed Computing, 5(4), pages 175--186, April 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC