- (Motwani & Raghavan, 1995) ⇒ Rajeev Motwani, Prabhakar Raghavan. (1995). “Randomized Algorithms.” In: Cambridge University Press. ISBN:0521474655
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 3 Game Theoretic Techniques 28 Moments and Deviations 43 Tail Inequalities 67 The Probabilistic Method 101 Markov Chains and Random Walks 127 Algebraic Techniques 161 Data Structures 197 Approximate Counting 306 Parallel and Distributed Algorithms 335 Online Algorithms 368 Number Theory and Algebra 392
|1995 RandomizedAlgorithms||Prabhakar Raghavan|
|Randomized Algorithms||Cambridge University Press||http://books.google.com/books?id=QKVY4mDivBEC||1995|