Book recommendations on the analysis of randomized algorithms

I would like to read some books (or any other material) that cover the design of randomized algorithms with a particular focus on the analysis. My main goal is to develop the rigour needed to construct the proof of correctness for such algorithms.

I am currently reading Probability and Computing - M. Mitzenmacher, E. Upfal, which I find to be a good introduction to this topic.

What are your suggestions?

Randomized Algorithms by Motwani, Rajeev, and Raghavan contains a lot of excellent material on the design and analysis of algorithms. They show many proofs of correctness for different randomized algorithms.

StackExchange Computer Science Q#128725, answer score: 4