# 1995 RandomizedAlgorithms

- (Motwani & Raghavan, 1995) ⇒ Rajeev Motwani, Prabhakar Raghavan. (1995). “Randomized Algorithms.” In: Cambridge University Press. ISBN:0521474655

**Subject Headings:** Randomized Algorithm, Online Algorithm.

## Notes

## Cited By

## Quotes

### Book Overview

For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications. Algorithmic examples are also given to illustrate the use of each tool in a concrete setting. In the second part of the book, each chapter focuses on an important area to which randomized algorithms can be applied, providing a comprehensive and representative selection of the algorithms that might be used in each of these areas. Although written primarily as a text for advanced undergraduates and graduate students, this book should also prove invaluable as a reference for professionals and researchers.

### Table of Contents

Introduction 3Game Theoretic Techniques 28Moments and Deviations 43Tail Inequalities 67The Probabilistic Method 101Markov Chains and Random Walks 127Algebraic Techniques 161Data Structures 197Approximate Counting 306Parallel and Distributed Algorithms 335Online Algorithms 368Number Theory and Algebra 392

## References

,