Quantity:

More Buying Choices

29 used & new from �31.04

Have one to sell? Sell yours here

Randomized Algorithms (Cambridge International Series on Parallel Computation) (Hardcover)

by Rajeev Motwani (Author), Prabhakar Raghavan (Author) "CONSIDER sorting a set S of n numbers into ascending order ..." (more)

4.0 out of 5 stars See all reviews (1 customer review)

RRP:	�44.00
Price:	�39.90 & this item Delivered FREE in the UK with Super Saver Delivery. See details and conditions
You Save:	�4.10 (9%)
	o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o

In stock.
Dispatched from and sold by Amazon.co.uk. Gift-wrap available.

Only 5 left in stock--order soon (more on the way).

Want guaranteed delivery by Tuesday, November 10? Choose Express delivery at checkout. See Details

19 new from �35.20 10 used from �31.04

Frequently Bought Together

Price For All Three: �104.71

Show availability and shipping details

This item: Randomized Algorithms (Cambridge International Series on Parallel Computation) by Rajeev Motwani
In stock.
Dispatched from and sold by Amazon.co.uk.
This item Delivered FREE in the UK with Super Saver Delivery. See details and conditions
Approximation Algorithms by Vijay V. Vazirani
In stock.
Dispatched from and sold by Amazon.co.uk.
This item Delivered FREE in the UK with Super Saver Delivery. See details and conditions
Probability and Computing: Randomized Algorithms and Probabilistic Analysis by Michael Mitzenmacher
In stock.
Dispatched from and sold by Amazon.co.uk.
This item Delivered FREE in the UK with Super Saver Delivery. See details and conditions

Customers Who Bought This Item Also Bought

Probability and Computing: Randomized Algorithms and Probabilistic Analysis

by Michael Mitzenmacher

�31.57

Approximation Algorithms

by Vijay V. Vazirani

�33.24

Introduction to Lattices and Order

by B. A. Davey

�25.64

Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning)

by CE Rasmussen

5.0 out of 5 stars (1) �23.34

The Algorithm Design Manual

by Steven S. Skiena

4.5 out of 5 stars (6) �27.98

› Explore similar items

Product details

Hardcover: 492 pages
Publisher: Cambridge University Press (25 Aug 1995)
Language English
ISBN-10: 0521474655
ISBN-13: 978-0521474658
Product Dimensions: 25.7 x 17.8 x 2.8 cm

Average Customer Review: 4.0 out of 5 stars See all reviews (1 customer review)

Amazon.co.uk Sales Rank: 661,009 in Books (See Bestsellers in Books)

Popular in these categories:

#6 in	Books > Computing & Internet > Computer Science > Algorithms > Parallel Algorithms
#86 in	Books > Science & Nature > Mathematics > Applied Mathematics > Stochastics
#86 in	Books > Scientific, Technical & Medical > Mathematics > Applied Mathematics > Stochastics

Would you like to update product info or give feedback on images?

See Complete Table of Contents

Customers Viewing This Page May Be Interested in These Sponsored Links

(What is this?)

Parallel algorithms opens new browser window

www.Intel.com - Learn to thread like an expert, without being one. Free Trial.

MATLAB Parallel Computing opens new browser window

www.mathworks.com - Parallel computing with MATLAB and Simulink, on the desktop or cluster

Parallel Computing opens new browser window

www.computerweekly.com - Essential Parallel Computing news & daily updates.

Product Description

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

Product Description

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.

See all Product Description

Inside This Book (Learn More)

First Sentence
CONSIDER sorting a set S of n numbers into ascending order. Read the first page

Explore More
Concordance

Suggested Tags from Similar Products

(What's this?)

Be the first one to add a relevant tag (keyword that's strongly related to this product)

algorithms

rajeev motwani

probabilistic algorithm

computer science

What Do Customers Ultimately Buy After Viewing This Item?

	65% buy the item featured on this page: Randomized Algorithms (Cambridge International Series on Parallel Computation) 4.0 out of 5 stars (1) �39.90
	12% buy Approximation Algorithms �33.24
	10% buy Probability and Computing: Randomized Algorithms and Probabilistic Analysis �31.57
	7% buy The Algorithm Design Manual 4.5 out of 5 stars (6) �27.98

Explore similar items

Customer Reviews

1 Review

5 star:		(0)
4 star:		(1)
3 star:		(0)
2 star:		(0)
1 star:		(0)

Average Customer Review

4.0 out of 5 stars (1 customer review)

Share your thoughts with other customers:

Create your own review

Most Helpful Customer Reviews

4.0 out of 5 stars comprehensive, 22 Nov 2002

By	"amitmathur2" - See all my reviews

This is a good bet if you are looking to enter into randomized algorithms for using it in your professional life or just as a hobby. I guess, its also quite good as a beginers introduction to randomized algorithm in a university course. things to note are: the book assumes a basic knowledge of computer science, so if you are not familiar with concepts like complexity, computability, turing machine etc. you will find it hard. they have given an introduction to probabilty but I guess, that's also not a great help.

also, the writing is quite terse. the lucidity is not really the strong point here. and sometimes they use symbols in proofs of theorems which were defined pages before. so, you need to be a bit attentive while reading. (someone might say, going back and revising the previous pages never hurt anyway).

despite, these small shortfalls, I have given this a four star because the book has a breadth as well as depth. lots of algorithms are presented and every presentation is complete. and also, this is perhaps the only good reference book on this topic, which makes it indespensible. after reading the book you will certainly be able to dive into the literature (papers on randomized and approximation algo), which is really what you want to explore eventually.

Comment Comment | Permalink | Was this review helpful to you? Yes No (Report this)

Share your thoughts with other customers: Create your own review

› See all customer reviews...

.jsOffDisplayBlock { display: block; } .jsOffDisplayInline { display: inline; } .jsOffVisibility { visibility: visible; } .jsOnDisplayBlock { display: none; } .jsOnDisplayNoneBlock { display: block; } .jsOnDisplayNoneInline { display: inline; } .jsOnDisplayInline { display: none; } .jsOnVisibility { visibility: hidden; } .jqOnDisplayBlock { display: none; } .jqOnDisplayInline { display: none; } .jqOnVisibility { visibility: hidden; } .jqOnDisplayNoneBlock { display: block; } .jqOnDisplayNoneInline { display: inline; }