Randomized Algorithms (Cambridge International Series on Parallel Computation)
Editorial Reviews
Review
'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
'This book can serve as an excellent basis for a graduate course. It is highly recommended for students and researchers who wish to deepen their knowledge of the subject. Finally, I believe that the book, with its vast coverage, will be an invaluable source for active researchers in the field.' Y. Aumann, Computing Reviews
Book Description
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.
Randomized Algorithms (Cambridge International Series on Parallel Computation),Rajeev Motwani,Prabhakar Raghavan,Cambridge University Press,0521474655,Algorithms,Data processing,Discrete Mathematics,Machine Theory,Mathematics,Research & Methodology,Science,Science/Mathematics,Stochastic Processes,Algorithms & procedures,Computers / General,Mathematical modelling,Stochastic processes--Data processing
Hot Books:
Recommended Books