Computer Science 690RA - Randomized Algorithms

Randomness has proven itself to be a useful resource for developing provably efficient algorithms and protocols. As a result, the study of randomized algorithms has become a major research topic in recent years. This course will explore a collection of techniques for effectively using randomization and for analyzing randomized algorithms, as well as examples from a variety of settings and problem areas.

Open to Computer Science graduate students only. GRADUATE STUDENTS ARE EXPECTED TO HAVE MATHEMATICAL MATURITY, EXPOSURE TO ALGORITHM DESIGN AND ANALYSIS AT THE ADVANCED UNDERGRADUATE (SUCH AS COMPSCI 311) OR BEGINNING GRADUATE LEVEL (SUCH AS COMPSCI 514 OR 611) AND A SOLID GROUNDING IN LINEAR ALGEBRA AND PROBABILITY THEORY. STUDENTS WITHOUT SUCH BACKGROUND CAN SEEK PERMISSION OF THE INSTRUCTOR. STUDENTS NEEDING SPECIAL PERMISSION MUST REQUEST OVERRIDES VIA THE ON-LINE FORM: https://www.cics.umass.edu/overrides.