1. N. Alon and J. Spencer, “The Probabilistic Method”, John Wiley and Sons, 1992.
2. D. Angluin and L. Valiant, “Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings”, J. of Comput. Systems Sci., vol. 18, pp. 155— 193, 1979.
3. Y. Aumann, M. Bender and L. Zhang, “Efficient execution of non- deterministic parallel programs on asynchronous systems”, Proc. of the 8th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 270–276, 1996.
4. Y. Aumann, Z. Kedem, K. Palem and M. Rabin, “Highly efficient asynchronous execution of large-grained parallel programs”, Proc. of the 34th Annual Symposium on Foundations of Computer Science (FOCS), 1993.
5. D. Bauer, F. Boesch, C. Suffel and R. Tindell, “Connectivity extremal problems and the design of reliable probabilistic networks”, The Theory of Applications of Graphs, John Wiley and Sons, 1981.