+612 9045 4394
$7.95 Delivery per order to Australia and New Zealand
100% Australian owned
Over a hundred thousand in-stock titles ready to ship
Randomized Algorithms : Cambridge International Series on Parallel Computation - Rajeev Motwani

Randomized Algorithms

Cambridge International Series on Parallel Computation

Hardcover Published: 25th August 1995
ISBN: 9780521474658
Number Of Pages: 496

Share This Book:


or 4 easy payments of $36.81 with Learn more
Ships in 15 business days

Earn 295 Qantas Points
on this Book

For 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 first book on the subject should prove invaluable as a reference for researchers and professional programmers, as well as for students.

Industry Reviews

'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

Tools and Techniques
Game-theoretic techniques
Moments and deviations
Tail inequalities
The probabilistic method
Markov chains and random walks
Algebraic techniques
Data structures
Geometric algorithms and linear programming
Graph algorithms
Approximate counting
Parallel and distributed algorithms
Online algorithms
Number theory and algebra
Notational index
Mathematical background
Basic probability theory
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780521474658
ISBN-10: 0521474655
Series: Cambridge International Series on Parallel Computation
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 496
Published: 25th August 1995
Country of Publication: GB
Dimensions (cm): 26.42 x 17.78  x 3.05
Weight (kg): 1.09

Earn 295 Qantas Points
on this Book