This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms.Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern. This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of such algorithms. The presentation emphasizes discrete settings and elementary notions of probability, making it accessible to computer scientists and applied discrete mathematicians. The relative strengths and weaknesses of the methods are demonstrated by applying them to concrete problems.Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern. This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of such algorithms. The presentation emphasizes discrete settings and elementary notions of probability, making it accessible to computer scientists and applied discrete mathematicians. The relative strengths and weaknesses of the methods are demonstrated by applying them to concrete problems.Randomized algorithms have become a central part of the algorithms curriculum based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high- probability estimates on the performance of randomized algorithms. It covers the basic tool kit from the Chernoff-Hoeffding (CH) bounds to more sophisticated techniques like Martingales and isoperimetric inequalities, as well as some recent developments like Talagrand's inequality, transportation cost inequalities, and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as CH bounds in dependent settings. The authors emphasize comparative study of the different methol-