Design and Analysis of Randomized Algorithms Introduction to Design Paradigms [Hardcover]

Systematically teaches key paradigmic algorithm design methods

Provides a deep insight into randomization

Randomness is a powerful phenomenon that can be harnessed to solve various problems in all areas of computer science. Randomized algorithms are often more efficient, simpler and, surprisingly, also more reliable than their deterministic counterparts. Computing tasks exist that require billions of years of computer work when solved using the fastest known deterministic algorithms, but they can be solved using randomized algorithms in a few minutes with negligible error probabilities.

Introducing the fascinating world of randomness, this book systematically teaches the main algorithm design paradigms  foiling an adversary, abundance of witnesses, fingerprinting, amplification, and random sampling, etc.  while also providing a deep insight into the nature of success in randomization. Taking sufficient time to present motivations and to develop the reader's intuition, while being rigorous throughout, this text is a very effective and efficient introduction to this exciting field.

Fundamentals.- Foiling the Adversary.- Fingerprinting.- Success Amplification and Random Sampling.- Abundance of Witnesses.- Optimization and Random Rounding.

From the reviews:

The book gives an introduction to (design and analysis of) randomized algorithms. It is a self-contained textbook primarily for students. & The proofs are precise and contain all details. This makes the book perfect for self-study. & A student & will be happy to find everything defined precisely and explained in detail. (Benjamin Doerr, Zentralblatt MATH, Vol. 1083, 2006)

Theory of Computing community (especially those who work on Algorithm Design) is well acquainted with the concept of Randomization. & this book still gives a fresh and interesting point of view to Randomization and Randomized Algorithms. &lS