Advances in Randomized Parallel Computing (Paperback, Softcover reprint of the original 1st ed. 1999)

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 in practice. This book is a collection of articles written by renowned experts in the area of randomized parallel computing. A brief introduction to randomized algorithms In the aflalysis 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( n log n). The average case analysis is conducted with an assumption on the input space. The assumption made to arrive at the O( n log n) 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 p0: .sible inputs."

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	Combinatorial Optimization, 5
Release date:	October 2011
First published:	1999
Editors:	Panos M. Pardalos • Sanguthevar Rajasekaran
Dimensions:	240 x 160 x 17mm (L x W x T)
Format:	Paperback
Pages:	287
Edition:	Softcover reprint of the original 1st ed. 1999
ISBN-13:	978-1-4613-3284-8
Categories:	Books > Computing & IT > Computer communications & networking > General Books > Computing & IT > Computer hardware & operating systems > Computer architecture & logic design > General
LSN:	1-4613-3284-2
Barcode:	9781461332848

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!