Common use of Bibliography Clause in Contracts

Bibliography. [Ben83] ▇▇▇▇▇▇▇ ▇▇▇-Or. Another advantage of free choice (extended ab- stract): Completely asynchronous agreement protocols. In Proceed- ings of the second annual ACM symposium on Principles of distrib- uted computing, pages 27–30. ACM, 1983. [BG89] ▇▇▇▇▇ ▇▇▇▇▇▇ and ▇▇▇▇ ▇ ▇▇▇▇▇. Asymptotically optimal distributed consensus. Springer, 1989. [BGP89] ▇▇▇▇▇ ▇▇▇▇▇▇, ▇▇▇▇ ▇. ▇▇▇▇▇, and ▇▇▇▇▇▇▇ ▇. ▇▇▇▇▇. Towards optimal distributed consensus (extended abstract). In 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pages 410–415, 1989. [BT85] ▇▇▇▇▇▇▇ ▇▇▇▇▇▇ and ▇▇▇ ▇▇▇▇▇. Asynchronous consensus and broadcast protocols. Journal of the ACM (JACM), 32(4):824–840, 1985. [DGM+11] ▇▇▇▇▇▇▇▇ ▇▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇ ▇▇▇▇▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇▇▇▇▇▇▇, and ▇▇▇▇▇▇▇▇▇ ▇▇▇▇▇▇▇▇▇▇. Stabilizing Consensus with the Power of Two Choices. In Proceedings of the Twenty-third Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, June 2011. [DS83] ▇▇▇▇▇ ▇▇▇▇▇ and ▇. ▇▇▇▇▇▇▇ ▇▇▇▇▇▇. Authenticated algorithms for byzantine agreement. SIAM Journal on Computing, 12(4):656–666, 1983. [FG03] ▇▇▇▇▇▇▇▇ ▇▇▇▇▇ and ▇▇▇▇ ▇ ▇▇▇▇▇. Efficient player-optimal protocols for strong and differential consensus. In Proceedings of the twenty- second annual symposium on Principles of distributed computing, pages 211–220. ACM, 2003.

Bibliography. [Ben83] ▇▇▇▇▇▇▇ ▇▇▇-Or. Another advantage of free choice (extended ab- stract): Completely asynchronous agreement protocols. In Proceed- ings of the second annual ACM symposium on Principles of distrib- uted computing, pages 27–30. ACM, 1983. [BG89] ▇▇▇▇▇ ▇▇▇▇▇▇ and ▇▇▇▇ ▇ ▇▇▇▇▇. Asymptotically optimal distributed consensus. Springer, 1989. [BGP89] ▇▇▇▇▇ ▇▇▇▇▇▇, ▇▇▇▇ ▇. ▇▇▇▇▇, and ▇▇▇▇▇▇▇ ▇. ▇▇▇▇▇. Towards optimal distributed consensus (extended abstract). In 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pages 410–415, 1989. [BT85] ▇▇▇▇▇▇▇ ▇▇▇▇▇▇ and ▇▇▇ ▇▇▇▇▇. Asynchronous consensus and broadcast broad- cast protocols. Journal of the ACM (JACM), 32(4):824–840, 1985. [DGM+11] ▇▇▇▇▇▇▇▇ ▇▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇ ▇▇▇▇▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇▇▇▇▇▇▇, and ▇▇▇▇▇▇▇▇▇ ▇▇▇▇▇▇▇▇▇▇. Stabilizing Consensus with the Power of Two Choices. In Proceedings of the Twenty-third Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, June 2011. [DS83] ▇▇▇▇▇ ▇▇▇▇▇ and ▇. ▇▇▇▇▇▇▇ ▇▇▇▇▇▇. Authenticated algorithms for byzantine agreement. SIAM Journal on Computing, 12(4):656–666, 1983. [FG03] ▇▇▇▇▇▇▇▇ ▇▇▇▇▇ and ▇▇▇▇ ▇ ▇▇▇▇▇. Efficient player-optimal protocols for strong and differential consensus. In Proceedings of the twenty- second annual symposium on Principles of distributed computing, pages 211–220. ACM, 2003. [FL82] ▇▇▇▇▇▇▇ ▇. ▇▇▇▇▇▇▇ and ▇▇▇▇▇ ▇. ▇▇▇▇▇. A lower bound for the time to assure interactive consistency. 14(4):183–186, June 1982. [KS13] ▇▇▇▇▇▇▇ ▇▇▇▇ and ▇▇▇▇▇ ▇▇▇▇. Byzantine agreement in polynomial expected time:[extended abstract]. In Proceedings of the forty-fifth annual ACM symposium on Theory of computing, pages 401–410. ACM, 2013. [LSP82] ▇▇▇▇▇▇ ▇▇▇▇▇▇▇, ▇▇▇▇▇▇ ▇. ▇▇▇▇▇▇▇, and ▇▇▇▇▇▇▇▇ ▇. ▇▇▇▇▇. The byzantine generals problem. ACM Trans. Program. Lang. Syst., 4(3):382–401, 1982.

Bibliography. [Ben83] ▇▇▇▇▇▇▇ ▇▇▇-Or. Another advantage of free choice (extended ab- stract): Completely asynchronous agreement protocols. In Proceed- ings of the second annual ACM symposium on Principles of distrib- uted computing, pages 27–30. ACM, 1983. [BG89] ▇▇▇▇▇ ▇▇▇▇▇▇ and ▇▇▇▇ ▇ ▇▇▇▇▇. Asymptotically optimal distributed consensus. Springer, 1989. [BGP89] ▇▇▇▇▇ ▇▇▇▇▇▇, ▇▇▇▇ ▇. ▇▇▇▇▇, and ▇▇▇▇▇▇▇ ▇. ▇▇▇▇▇. Towards optimal distributed consensus (extended abstract). In 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pages 410–415, 1989. [BT85] ▇▇▇▇▇▇▇ ▇▇▇▇▇▇ and ▇▇▇ ▇▇▇▇▇. Asynchronous consensus and broadcast broad- cast protocols. Journal of the ACM (JACM), 32(4):824–840, 1985. [DGM+11] ▇▇▇▇▇▇▇▇ ▇▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇ ▇▇▇▇▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇▇▇▇, ▇▇▇▇▇▇ ▇▇▇▇▇▇▇▇▇, and ▇▇▇▇▇▇▇▇▇ ▇▇▇▇▇▇▇▇▇▇. Stabilizing Consensus with the Power of Two Choices. In Proceedings of the Twenty-third Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, June 2011. [DS83] ▇▇▇▇▇ ▇▇▇▇▇ and ▇. ▇▇▇▇▇▇▇ ▇▇▇▇▇▇. Authenticated algorithms for byzantine agreement. SIAM Journal on Computing, 12(4):656–666, 1983. [FG03] ▇▇▇▇▇▇▇▇ ▇▇▇▇▇ and ▇▇▇▇ ▇ ▇▇▇▇▇. Efficient player-optimal protocols for strong and differential consensus. In Proceedings of the twenty- second annual symposium on Principles of distributed computing, pages 211–220. ACM, 2003.. BIBLIOGRAPHY 35