随机算法 (Fall 2011): Difference between revisions
Jump to navigation
Jump to search
Line 9: | Line 9: | ||
#* [[随机算法 (Fall 2011)/Random Variables and Expectations|Random Variables and Expectations]] | #* [[随机算法 (Fall 2011)/Random Variables and Expectations|Random Variables and Expectations]] | ||
#* [[随机算法 (Fall 2011)/Randomized Quicksort|Randomized Quicksort]] | #* [[随机算法 (Fall 2011)/Randomized Quicksort|Randomized Quicksort]] | ||
# [[随机算法 (Fall 2011)/Balls | # Balls and bins | ||
#* [[随机算法 (Fall 2011)/ | #* [[随机算法 (Fall 2011)/Distributions of Coin Flipping|Distributions of Coin Flipping]] | ||
#* [[随机算法 (Fall 2011)/Birthday Problem|Birthday Problem]] | |||
#* [[随机算法 (Fall 2011)/Coupon Collector|Coupon Collector]] | |||
#* [[随机算法 (Fall 2011)/Balls-into-balls Occupancy Problem|Balls-into-balls Occupancy Problem]] | |||
#* [[随机算法 (Fall 2011)/Bloom Filter|Bloom Filter]] | |||
#* [[随机算法 (Fall 2011)/Stable Marriage|Stable Marriage]] | |||
# Hashing and Fingerprinting | |||
# [[随机算法 (Fall 2011)/Tail inequalities|Tail inequalities]] | # [[随机算法 (Fall 2011)/Tail inequalities|Tail inequalities]] |
Revision as of 14:57, 18 July 2011
Lecture Notes
- Introduction
- Probability basics
- Balls and bins
- Hashing and Fingerprinting
- Tail inequalities
- Chernoff bounds
- Martingales
- Hashing, limited independence
- Fingerprinting
- The probabilistic method
- Markov chains and random walks
- Expander graphs
- Rapid mixing random walks
- Random sampling, MCMC
- Approximate counting
- Randomized approximation algorithms
- Distributed algorithms, data streams