CSCI653 Analysis of Algorithms
Graduate-level course, William & Mary, Computer Science, 2026
Instructor: Weizhen Mao
Textbook: 3rd edition of Introduction to Algorithms by CLRS (Cormen, Leiserson, Rivest, and Steine), and Algorithm Design by Kleinberg and Tardos.
Course Description: The following topics will be covered in this course:
- Mathematical Foundation
- Methods of design and analysis of algorithms
- Additional topics may include lower bound theory, amortization, randomized algorithms, and competitive analysis
Tentative Content:
- Mathematical Background
- Recursion and Induction
- Worst-case analysis
- Average-case analysis
- Amortized analysis
- Selection and Adversary Arguments
- Randomized Data Structure and Algorithms
- Dynamic Programming
- Greedy Algorithms
- Scheduling Algorithms
- RSA Algorithms
- Algorithms related AI