ADVANCED ALGORITHMS

Credit Hours: 3 · Graduate

This course provides a comprehensive introduction to advanced topics in algorithms, with a particular focus on randomized, streaming, approximation, and online algorithms. Beginning with a review of probability and classic randomized algorithms such as Quicksort and Median Finding, the course progresses to explore topics such as data structures (e.g., splay trees and Fibonacci heaps), communication complexity, and approximation algorithms using techniques like linear programming and greedy methods. Students will also learn about advanced concepts like interactive proofs, differentially private mechanisms, and the application of these tools to real-world problems. Through lectures, projects, and hands-on examples, students will develop both theoretical understanding and practical skills in algorithm design and analysis.