Text

Randomized algorithms

---

Cambridge University Press, 25 Agu 1995 - 476 halaman
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.

---

Availability

Detail Information

Series Title

-

Call Number

004.015192 MOT r

Publisher

Cambridge : Cambridge University Press., 1995

Collation

xiv, 476 hal. : ilus ; 26 cm.

Language

English

ISBN/ISSN

9780521474658

Classification

004.015192

Content Type

-

Media Type

-

Carrier Type

-

Edition

first edition

Subject(s)

Algoritma
Stochastic processes--Data processing

Specific Detail Info

-

Statement of Responsibility

Rajeev Motwani, Prabhakar Raghavan

Other Information

Link

-

Daftar Isi

-

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment