Randomized Algorithms and Probabilistic Methods

Las Vegas & Monte Carlo algorithms; inequalities of Markov, Chebyshev, Chernoff; negative correlation; Markov chains: convergence, rapidly mixing; generating functions; Examples include: min cut, median, balls and bins, routing in hypercubes, 3SAT, card shuffling, random walks

AVAILABLE
READING ROOM ONLY
NOT AVAILABLE
ONLINE VERSION
cover image

Randomized algorithms

Rajeev Motwani, Prabhakar Raghavan

Signature Year Rack/Shelf Lecture Return Date Status
Textbook.M.095.01.1 1995 12 / 1 Randomized Algorithms and Probabilistic Methods Available
Textbook.M.095.01.2 1995 12 / 1 Randomized Algorithms and Probabilistic Methods Available
Textbook.M.095.01.3 1995 12 / 1 Randomized Algorithms and Probabilistic Methods Available
Textbook.B.014.04.2 1995 5 / 1 Algorithms, Probability, and Computing Available
EX.0000.173.1 1995 Available
EX.0000.173.2 1995 Available
Textbook.B.014.04.1 1995 5 / 1 Algorithms, Probability, and Computing On-site use only
AVAILABLE
READING ROOM ONLY
NOT AVAILABLE
ONLINE VERSION
cover image

The probabilistic method

Noga Alon, Joel H. Spencer

Signature Year Rack/Shelf Lecture Return Date Status
Textbook.M.095.03.1 2008 12 / 1 Randomized Algorithms and Probabilistic Methods Available
IE.00.20 2000 Available
AVAILABLE
READING ROOM ONLY
NOT AVAILABLE
cover image

Probability and computing

Randomized algorithms and probabilistic analysis

Michael Mitzenmacher, Eli Upfal

Signature Year Rack/Shelf Lecture Return Date Status
Textbook.M.095.02.1 2005 12 / 1 Randomized Algorithms and Probabilistic Methods Available
Textbook.M.095.02.2 2005 12 / 1 Randomized Algorithms and Probabilistic Methods Available