随机算法 (Fall 2011): Difference between revisions
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
= Lecture Notes = | = Lecture Notes = | ||
# [[随机算法 (Fall 2011)/Introduction|Introduction]] | # Introduction | ||
#* [[随机算法 (Fall 2011)/Randomized Algorithms: an Introduction|Randomized Algorithms: an Introduction]] | |||
#*[[随机算法 (Fall 2011)/Complexity Classes|Complexity Classes]] | #*[[随机算法 (Fall 2011)/Complexity Classes|Complexity Classes]] | ||
# Probability Basics | # Probability Basics | ||
Revision as of 16:04, 19 July 2011
Lecture Notes
- Introduction
- Probability Basics
- Balls and Bins
- Moment and Deviation
- Hashing and Fingerprinting
- Chernoff Bound
- Concentration of Measure
- Dimension Reduction
- The Probabilistic Method
- Approximation Algorithms, On-line Algorithms
- Markov Chain and Random Walk
- Random Walk Algorithms
- Coupling and Mixing Time
- Expander Graphs I
- Expander Graphs II
- Sampling and Counting
- MCMC
- Complexity