Randomized Algorithms Course ID 15756 Doctoral Breadth Course: Algorithms and Complexity - (*) Classes marked with "*" (star) are appropriate for any CSD doctoral or 5th year master's student. Description A graduate-level course on how to use randomization to design algorithms and data structures with strong provable guarantees. Key Topics Algorithms, Probability, Data Structures Course Relevance Primarily for doctoral students, but other students with sufficient background may also take it. Pre-required Knowledge Strong background in probability and algorithms. At least one past course on algorithms, and at least one past course on probability, or permission of instructor. Assessment Structure Homework 60%, Participation 10%, Scribing 30%
