Probability and randomized algorithms
Linearity of expectation, concentration, hashing, and randomized choices.
Fall 2026 · Thirteen Wednesdays
Course Schedule
Wednesdays, 8:10–10:00 PM
451 Computer Science Building
Advanced dynamic programming
State compression, optimization, and patterns beyond the standard toolkit.
Advanced graph algorithms
Structural graph ideas and the modeling decisions that make them useful.
Network flows and matchings
Recognizing reductions, choosing the right formulation, and implementing it reliably.
Advanced data structures
Specialized structures for difficult online and offline queries.
Advanced string algorithms
Matching, indexing, and the structure hidden inside strings.
Polynomials and convolutions
Fast transforms and polynomial techniques for counting and matching.
Number theory and combinatorics
Arithmetic structure, generating functions, and advanced counting.
Computational geometry
Geometric reasoning, numerical care, and robust implementation.
Game theory and offline techniques
Finding the right state, invariant, or ordering before writing code.
Interactive, constructive, and ad hoc
Problems where the construction—or the conversation with the judge—is the algorithm.
No class
Academic holiday.
Problem clinic and presentations
Student presentations and guided work on difficult contest problems.
Course review and closing
Connections across the semester and the next steps for ICPC practice.
Topics remain tentative. Meeting dates, time, and room reflect the current official listing.