J. Hromkovič: Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms, Springer 2005
R.Motwani, P.Raghavan: Randomized Algorithms Cambridge University Press, 1995
Michael Mitzenmacher and Eli Upfal: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press 2005. ISBN 0-521-83540
2
B. Codenotti, P. Gemmell, P. Pudlak and J. Simon: On
the Amount of Randomness Needed in Distributed Computations OPODIS 1997,
237-248
Pavol Ďuriš, Juraj Hromkovič, José D.P.Rolim and
Georg Schnitger: On the Power of Las vegas for One-way Communication
Complexity, Finite Automata, and Polynimial-time Computations.
In Proceedings of the 14th Annual Symposium on theoretical Aspects of Computer
Science (February 27 - March 01, 1997). R. Reischuk and M. Morvan, Eds. Lecture Notes In Computer Science, vol. 1200. Springer-Verlag, London, 117-128.
eccc-reports/1997/TR97-029/