References
- Cucker, F., Karpinski, M., Koiran, P., Lickteig, T., Werther, K. (1995). On real Turing machines that toss coins. In: Leighton, F. T., Borodin, A., eds. Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing. New York: Association for Computing Machinery, pp. 335–342.
- Dubhashi, D., Panconesi, A. (2009). Concentration of Measure for the Analysis of Randomized Algorithms. New York: Cambridge Univ. Press.
- Ore, Ø. (1922). Über höhere Kongruenzen. Norsk Mat. Forenings Skrifter Ser. I, 7: 15 pages.
- Schwartz, J. T. (1980). Fast probabilistic algorithms for verification of polynomial identities. J. ACM. 27(4): 701–717. DOI: 10.1145/322217.322225.