Randomized Algorithms and Probabilistic Methods
-
Angelika Steger
-
Autumn Semester
-
Location: rack 12, shelf 1
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
![]() READING ROOM ONLY
NOT AVAILABLE
![]() ![]() Randomized algorithmsRajeev Motwani, Prabhakar Raghavan
|
||||||||||||||||||||||||||||||||||||||||||||||||
![]() READING ROOM ONLY
NOT AVAILABLE
![]() Probability and computingRandomized algorithms and probabilistic analysis Michael Mitzenmacher, Eli Upfal
|
||||||||||||||||||||||||||||||||||||||||||||||||
![]() READING ROOM ONLY
NOT AVAILABLE
![]() ![]() The probabilistic methodNoga Alon, Joel H. Spencer
|