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.

Bestandsnummer des Verk�ufers LU-9780521474658

Verk�ufer kontaktieren

Diesen Artikel melden

Bibliografische Details

Titel: Randomized Algorithms
Verlag: Cambridge University Press, GB
Erscheinungsjahr: 1995
Sprache: Englisch
ISBN-10: 0521474655
ISBN-13: 9780521474658
Einband: Hardback
Zustand: New

�ber diesen Titel

Inhaltsangabe

Presents basic tools from probability theory used in algorithmic applications, with concrete examples. This first book on the subject should prove invaluable as a reference for researchers and professional programmers, as well as for students.