0
Your cart

Your cart is empty

Books > Computing & IT > Computer programming

Buy Now

Handbook of Randomized Computing - Volume I/II (Hardcover, 2001 ed.) Loot Price: R1,863
Discovery Miles 18 630
Handbook of Randomized Computing - Volume I/II (Hardcover, 2001 ed.): Sanguthevar Rajasekaran, Panos M. Pardalos, J. H. Reif,...

Handbook of Randomized Computing - Volume I/II (Hardcover, 2001 ed.)

Sanguthevar Rajasekaran, Panos M. Pardalos, J. H. Reif, Jose Rolim

Series: Combinatorial Optimization, 9

 (sign in to rate)
Loot Price R1,863 Discovery Miles 18 630 | Repayment Terms: R175 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

The technique of randomization has been employed to solve numerous prob lems of computing both sequentially and in parallel. Examples of randomized algorithms that are asymptotically better than their deterministic counterparts in solving various fundamental problems abound. Randomized algorithms have the advantages of simplicity and better performance both in theory and often is a collection of articles written by renowned experts in practice. This book in the area of randomized parallel computing. A brief introduction to randomized algorithms In the analysis of algorithms, at least three different measures of performance can be used: the best case, the worst case, and the average case. Often, the average case run time of an algorithm is much smaller than the worst case. 2 For instance, the worst case run time of Hoare's quicksort is O(n ), whereas its average case run time is only O(nlogn). The average case analysis is conducted with an assumption on the input space. The assumption made to arrive at the O(n logn) average run time for quicksort is that each input permutation is equally likely. Clearly, any average case analysis is only as good as how valid the assumption made on the input space is. Randomized algorithms achieve superior performances without making any assumptions on the inputs by making coin flips within the algorithm. Any analysis done of randomized algorithms will be valid for all possible inputs.

General

Imprint: Springer
Country of origin: Netherlands
Series: Combinatorial Optimization, 9
Release date: July 2001
First published: July 2001
Editors: Sanguthevar Rajasekaran • Panos M. Pardalos • J. H. Reif • Jose Rolim
Dimensions: 235 x 155mm (L x W)
Format: Hardcover
Volumes: 2
Pages: 996
Edition: 2001 ed.
ISBN-13: 978-0-7923-6959-2
Categories: Books > Computing & IT > General theory of computing > General
Books > Computing & IT > Computer programming > General
Books > Computing & IT > Applications of computing > General
Books > Science & Mathematics > Mathematics > Applied mathematics > General
LSN: 0-7923-6959-9
Barcode: 9780792369592

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners