Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms by I. Zamecnikova
Systematically teaches key paradigmic algorithm design methods
Provides a deep insight into randomization
Systematically teaches key paradigmic algorithm design methods
Provides a deep insight into randomization
Systematically teaches key paradigmic algorithm design methods
Provides a deep insight into randomization
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. ... This is a very good to excellent textbook on the Design and Analysis of Randomized Algorithms. Its unique ... feature is that it explicitly isolates and promotes the most important design techniques; this is really a great experience for the incoming theorist to specialize on Randomized Algorithms. (Marios Mavronicolas, SIGACT News, Vol. 40 (2), 2009)