1. Awerbuch, B., Azar, Y., Fiat, A., & Leighton, F. T. (1996). Making commitments in the face of uncertainty: How to pick a winner almost every time. In 28th ACM SToC (pp. 519–530).
2. Bannister, J., & Trivedi, K. S. (1983). Task allocation in fault-tolerant distributed systems. Acta Informatica, 20, 261–281.
3. Barlow, R. E., & Proschan, F. (1967). Mathematical theory of reliability. New York: Wiley.
4. Bhatt, S., Chung, F., Leighton, F., & Rosenberg, A. (1997). On optimal strategies for cycle-stealing in networks of workstations. IEEE Transactions on Computers, 46(5), 545–557.
5. Bodlaender, H. L., & Wolle, T. (2004). A note on the complexity of network reliability problems. IEEE Transactions on Information Theory, 47, 1971–1988.