|
The Yale - WINTER Jan 2011 | ||
Section 10 | ||
Randomized Algorithms (1st Edition) by Rajeev (Stanford University) Motwani, Prabhakar Raghavan, Motwani Raghvan, Benjamin B. Lahey Hardcover, 496 Pages, Published 1995 ISBN-10: 0-521-47465-5 / 0521474655 ISBN-13: 978-0-521-47465-8 / 9780521474658 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 analysi |