Lower bound for scalable Byzantine Agreement

Dan Holtby, Bruce M. Kapron, Valerie King. Lower bound for scalable Byzantine Agreement. In Eric Ruppert, Dahlia Malkhi, editors, Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006. pages 285-291, ACM, 2006. [doi]

@inproceedings{HoltbyKK06,
  title = {Lower bound for scalable Byzantine Agreement},
  author = {Dan Holtby and Bruce M. Kapron and Valerie King},
  year = {2006},
  doi = {10.1145/1146381.1146424},
  url = {http://doi.acm.org/10.1145/1146381.1146424},
  researchr = {https://researchr.org/publication/HoltbyKK06},
  cites = {0},
  citedby = {0},
  pages = {285-291},
  booktitle = {Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006},
  editor = {Eric Ruppert and Dahlia Malkhi},
  publisher = {ACM},
  isbn = {1-59593-384-0},
}