Probability and Algorithms, Caltech CS150, Winter
2006
Leonard J. Schulman
Office hours by appointment.
TA: Kevin Ko
Lectures: MW 10:30-12:00. Location: 125 Steele.
Catalog listing:
Elementary randomized algorithms and algebraic bounds in
communication, hashing, and identity testing. Game tree
evaluation. Topics may include randomized parallel computation;
independence, k-wise independence and derandomization; rapidly mixing
Markov chains; expander graphs and their applications; clustering
algorithms.
Course textbook:
- Mitzenmacher and Upfal, Probability and Computing, Cambridge 2005
Some useful books:
- Adams and Guillemin, Measure theory and probability
- Motwani & Raghavan, Randomized Algorithms (reserve, SFL)
- Alon & Spencer, The Probabilistic Method
- Feller, Probability Theory
- Cover & Thomas, Information Theory
- Grimmett & Stirzaker, Probability and Random Processes.
- Artin, Algebra
- Herstein, Topics in Algebra
Problem sets:
Links:
The page for the previous offering of this class is
here.