CS 591: Goals and Syllabus

Goals

  • Exposure to methods of design for randomized algorithms.
  • Learning useful results in probability and statistics for use in analyzing randomized algorithms.
  • Building experience in the analysis of randomized algorithms.
  • Accumulating a store of useful randomized algorithms in a variety of domains
  • Syllabus

    To a large extent, we will follow the text, only skipping some sections or chapters here and there. I expect that we will cover about 75% of the material in the text, plus some outside material.

    Back to CS 591 home page