Class Schedule, Homeworks and Exams (Tentative, and is Subject to Change)

Week	Day	Topic	Reading	Homework
1	Aug 24, T	Introduction, A Randomized Algorithm for Verifying Polynomial Identities	1.1
	Aug 26, R	Basics of Probability	1.2	Homework 1 (due Sep 2)
2	Aug 31, T	Randomized Min-Cut algorithm	1.4
	Sept 2, R	Discrete Random Variables and Expectation	2.1
3	Sep 7, T	Discrete Random Variables and Expectation	2.1,2.2,2.4	Homework 2 (due Sep 14)
	Sep 9, R	Coupon Collector’s Problem, Randomized Quicksort	2.4, 2.5
4	Sep 14, T	Markov and Chebyshev Inequalities	3.1-3.3
	Sep 16, R	Markov and Chebyshev Inequalities	3.1-3.3
5	Sep 21, T	Randomized Selection Algorithm	3.4	Homework 3 (due Sep 30)
	Sep 23, R	Chernoff Bounds, Applications	4.1,4.2
6	Sep 28, T	Discussion of HW problems (especially min-cut)
	Sep 30, R	Chernoff Bounds – Applications to Parameter Estimation & Others	4.2.3
7	Oct 5, T	Chernoff Bounds – Applications to Quicksort Analysis, discussion of balls-in-bins HW problem	Problem 20, page 100
	Oct 7, R	Routing in Parallel Computers	4.5
8	Oct 12, T	Permutation Routing on Hypercube	4.5	Midterm Out (due Oct 21)
	Oct 14, R	Permutation Routing on Hypercube	4.5
9	Oct 19, T	Balls in Bins – Birthday Paradox, Maximum Height of a Bin	5.1,5.2
	Oct 21, R	Consistent Hashing	Karger et. al (1,2)	Midterm Due
10	Oct 26, T	Distributed Hash Tables (Chord)	Stoica et. al.
	Oct 28, R	Bloom Filters	5.5.3	Homework 4 (due Nov 9)
11	Nov 2, T	Universal Hashing	9.1,9.3
	Nov 4, R	Universal Hashing	9.3
12	Nov 9, T	Perfect Hashing, Example of Probabilistic Method	9.3, 6.2.2
	Nov 11, R	Finger Printing (Set Equality and String Matching)	Motwani-Raghavan, pages 168-172
13	Nov 16, T	Random Graph Definitions	5.6	Homework 5 (due Dec 2)
	Nov 18, R	Random Graph Connectivity
14	Nov 23, T	Thanksgiving Break
	Nov 25, R
15	Nov 30, T	Monte Carlo Method	8.1
	Dec 2, R	Monte Carlo Method, DNF Counting	8.2	Final Exam (due Dec 13)
16	Dec 7, T	Algorithms for Data Streams	Alon et. al.
	Dec 9, R	TBA
17	Dec 14, T
	Dec 16, R