Randomized Algorithms

Voorkant
Cambridge University Press, 25 aug. 1995 - 476 pagina's
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.
 

Wat mensen zeggen - Een review schrijven

We hebben geen reviews gevonden op de gebruikelijke plaatsen.

Inhoudsopgave

I
ix
II
1
III
3
IV
28
V
43
VI
67
VII
101
VIII
127
X
195
XI
197
XII
234
XIII
278
XIV
306
XV
335
XVI
368
XVII
392

IX
161

Overige edities - Alles weergeven

Veelvoorkomende woorden en zinsdelen

Populaire passages

Pagina 463 - JP Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence. In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 331-340, 1993.
Pagina 451 - U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. In Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 319-327, 1990.
Pagina 452 - KL Clarkson. A Las Vegas algorithm for linear programming when the dimension is small. In Proc. 29th Annu. IEEE Sympos. Found. Comput. Sei., pages 452-456, 1988. [21] KL Clarkson and PW Shor. Applications of random sampling in computational geometry, II.

Bibliografische gegevens