Introduction to Randomized Algorithms

3 credits · Undergraduate Programs

Techniques for the design and analysis of randomized algorithms; discrete probability theory; randomized data structures; lower bound techniques; randomized complexity classes; advanced algorithmic applications from various areas. Prerequisite(s): Computer Science 413. Antirequisite(s): Credit for Computer Science 522 and 622 will not be allowed.