Satish Rao (satishr@cs.berkeley.edu)

Office hours (tentative): Mo: 1:30-2:30.

- Lecture 10. Packing/Cover. Do 2 out of 3 questions.
- Lecture 17. VLSI lower bounds. 2 questions.
- Lecture 18. Conservative Algorithms. Do 2 out of 3 questions.
- Lecture 19. Approximation Algorithm. Do 1 out of 2 questions.
- Lecture 20. Approximation, Spectral . No Questions!!.
- Lecture 21. Spectral. Do 2 questions.
- Lecture 22. Distributed Algorithms. 1 Question..
- Lecture 23. Byzantine Generals. 1 Question.
- Lecture 24. Chord. 2 Questions.
- Lecture 25. Show that the maximum girth of a degree 3 graph is at most $O(\log n)$. (Girth is the length of the minimum sized cycle.)
- Lecture 26/27. Describe the setup and sketch a proof for Sperner's lemma for a 3-dimensional simplex.

- Lecture 25. Sparse Covers. Chord, CANN, Tapestry.
- Lecture 26/27. Game Theory. Zero Sum Games. Nash, Market Equilibrium. Christos Notes.

- Lecture 1: Roughest draft. Two questions, sprinkled in.
- Lecture 2: Roughest draft. Two questions, sprinkled in.
- Lecture 3: Roughest draft. Three questions, sprinkled in.
- Lecture 4. Roughest draft.
- Lecture 5. Roughest draft.
- Lecture 6. Roughest draft. One question.
- Lecture 7. Roughest draft. One question.
- Lecture 8. Roughest draft. One question.
- Lecture 9. Roughest draft. Two questions.
- Lecture 10. Coming soon.
- No questions lecture 11.
- Lecture 12. 4 questions.
- October 16. 2 questions.
- October 18. 3 questions.
- Lecture 15. Coming soon.
- October 25. 2 questions.
- October 4(cont from previous lecture): Path Selection: randomized rounding. Previous notes.
- October 4 or 6: PRAM Algorithms. Previous years notes.
- August 28: Introduction. Balls in bins. Power of two choices. Lecture 1: Roughest draft.
- August 30: Probability Spaces, Linearity of Expectation. Lecture 2: Roughest draft.
- September 5: Markov, Chebyshev, Chernoff/Hoeffding. Lecture 3. Roughest draft.
- September 11: BSP model, planar graph separators. Lecture 4. Roughest draft.
- September 13: Hypercubes, butterflies, Benes routing, randomized routing. Lecture 5. Roughest draft.
- September 18: Randomized routing. Lecture 6. Roughest draft.
- September 20: Random priorities for scheduling. Lecture 7. Roughest draft.
- September 25: Random delays for scheduling. Lovasc Local Lemma Lecture 8. Roughest draft.
- September 27th. Path Selection, linear programming.
- NOTES TO COME!!! More Linear Programming. October 4.
- October 9.
- October 11.
- October 16.
- October 18.
- NOTES TO COME. October 23.
- October 25.
- Previous year's website.