Probability and randomized algorithms
Core probabilistic tools and randomized approaches for contest problem solving.
Fall 2026 · Thirteen Wednesdays
Course Schedule
Wednesdays, 8:10–10:00 PM
451 Computer Science Building
Advanced dynamic programming
Optimization techniques and less familiar dynamic programming patterns.
Advanced graph algorithms
Structural graph techniques and advanced contest applications.
Network flows and matchings
Flow, matching, and related optimization problems.
Advanced data structures
Powerful data-structure ideas for difficult online and offline queries.
Advanced string algorithms
Efficient techniques for matching, indexing, and reasoning about strings.
Polynomials and convolutions
Fast transforms and polynomial methods in competitive programming.
Number theory and combinatorics
Advanced counting and arithmetic techniques for contest problems.
Computational geometry
Geometric reasoning, robust implementation, and common contest patterns.
Game theory and offline techniques
Game states, structural insights, and offline problem-solving methods.
Interactive, constructive, and ad hoc
Strategies for unusual problems where the construction is the main challenge.
No class
Academic holiday.
Problem clinic and presentations
Student presentations and guided work on difficult contest problems.
Course review and closing
Semester synthesis, ICPC outlook, and continued deliberate practice.
Topics remain tentative. Meeting dates, time, and room reflect the current official listing.