Rajeev Motwani, Prabhakar RaghavanCambridge University Press, 10/5/1995EAN 9780521474658, ISBN10: 0521474655Hardcover, 496 pages, 26.4 x 17.8 x 3 cmLanguage: EnglishFor many applications a randomized algorithm is either the simplest algorithm available, or the fastest, or both. This tutorial presents the basic concepts in the design and analysis of randomized algorithms. The first part of the book presents tools from probability theory and probabilistic analysis that are recurrent in algorithmic applications. Algorithmic examples are given to illustrate the use of each tool in a concrete setting. In the second part of the book, each of the seven chapters focuses on one important area of application of randomized algorithms: data structures; geometric algorithms; graph algorithms; number theory; enumeration; parallel algorithms; and on-line algorithms. A comprehensive and representative selection of the algorithms in these areas is also given. This book should prove invaluable as a reference for researchers and professional programmers, as well as for students.Part I. Tools and Techniques1. Introduction2. Game-theoretic techniques3. Moments and deviations4. Tail inequalities5. The probabilistic method6. Markov chains and random walks7. Algebraic techniquesPart II. Applications8. Data structures9. Geometric algorithms and linear programming10. Graph algorithms11. Approximate counting12. Parallel and distributed algorithms13. Online algorithms14. Number theory and algebraAppendix Anotational indexAppendix Bmathematical backgroundAppendix Cbasic probability theory.'The techniques described by Rajeev Motwani and Prabhaker Raghavan are wide-ranging and powerful, so this book is an important one. As far as I have been able to find out this is the only book on the entire subject ... this excellent volume does us proud!' American Scientist
