Randomized Algorithms

By Bernd Steinbach

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

• Format: Hardcover
• Language: English
• ISBN: 0521474655
• ISBN13: 9780521474658
• Release Date: August 1995
• Publisher: Cambridge University Press
• Length: 496 Pages
• Weight: 2.35 lbs.
• Dimensions: 1.2" x 7.0" x 10.4"