Randomized algorithms / Rajeev Motwani and Prabhakar Raghavan.

By: Motwani, Rajeev .

Contributor(s): Raghavan, Prabhakar .

Material type: materialTypeLabel

BookPublisher: Cambridge : Cambridge University Press, 1995Description: xiv, 476 p. : ill. ; 26 cm. + hbk.ISBN: 0521474655.Subject(s): Stochastic processes -- Data processing | Algorithms

DDC classification: 511.8

Contents:

I: Tools and techniques -- Introduction -- Game-theoretic techniques -- Moments and deviations -- Tail inequalities -- The probabilistic method -- Markov chains and random walks -- Algebraic techniques --II: Applications -- Data structures -- Geometric algorithms and linear programming -- Graph algorithms -- Approximate counting -- Parallel and distributed algorithms -- Online algorithms -- Number theory and algebra.

Holdings
Item type	Current library	Call number	Copy number	Status	Date due	Barcode	Item holds
General Lending	MTU Bishopstown Library Lending	511.8 (Browse shelf(Opens below))	1	Available		00083113

Total holds: 0

Enhanced descriptions from Syndetics:

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.

Includes bibliographical references (pages 447-466) and index.

Table of contents provided by Syndetics

Part I Tools and Techniques
1 Introduction
2 Game-theoretic techniques
3 Moments and deviations
4 Tail inequalities
5 The probabilistic method
6 Markov chains and random walks
7 Algebraic techniques
Part II Applications
8 Data structures
9 Geometric algorithms and linear programming
10 Graph algorithms
11 Approximate counting
12 Parallel and distributed algorithms
13 Online algorithms
14 Number theory and algebra
Appendix A Notational index
Appendix B Mathematical background
Appendix C Basic probability theory

Reviews provided by Syndetics

CHOICE Review

Randomness is proving to be an essential computational resource. A randomized algorithm may provide an efficient, albeit uncertain or even fallible, approach to a practical problem where deterministic methods offer no feasible solution, either by dint of our ignorance or due to more intrinsic difficulties. The celebrated discovery, in 1992, of "holographic proofs" by S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy signals the very central role that randomness has come to play in theoretical complexity theory. The present volume, the first comprehensive account of the current state of this burgeoning subject, is more than a mere compilation of randomized algorithmic solutions to sundry problems. Through the many examples, the authors illustrate a handful of particular paradigms that underlie successful applications of randomness to computing, thereby aiding readers who would seek to apply randomness to problems of their own. Every aspect of this book, from the organization to the exposition to the typography, shows evidence of ample thoughtfulness. Whether serving as resource or text, this book will be an essential acquisition wherever there are studies in computer science at the undergraduate and graduate levels. D. V. Feldman University of New Hampshire