Randomized Algorithms

Rajeev Motwani

ISBN 10: 0521474655 / ISBN 13: 9780521474658

Published by Cambridge University Press, 1995

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9780521474658

Bibliographic Details

• Title: Randomized Algorithms
• Publisher: Cambridge University Press
• Publication Date: 1995
• Language: English
• ISBN 10: 0521474655
• ISBN 13: 9780521474658
• Binding: Buch
• Condition: Neu
• Dimensions: 260W x 183H x 31D millimeters 260 millimeters width by 183 millimeters height by 31 millimeters depth
• Weight: 1119 grams

About this title

Synopsis

For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications. Algorithmic examples are also given to illustrate the use of each tool in a concrete setting. In the second part of the book, each chapter focuses on an important area to which randomized algorithms can be applied, providing a comprehensive and representative selection of the algorithms that might be used in each of these areas. Although written primarily as a text for advanced undergraduates and graduate students, this book should also prove invaluable as a reference for professionals and researchers.

Book Description

For many applications a randomized algorithm is the simplest algorithm available, or the fastest, or both. This book presents basic tools from probability theory used in algorithmic applications, with examples to illustrate the use of each tool in a concrete setting. Several important areas of application of randomized algorithms are explored in detail, giving a representative selection of the algorithms in these areas. Although written primarily as a text, this book should also prove invaluable as a reference for professionals and researchers.