Theoretical / proof-based
Advanced algorithms · Graduate · CS / Programming
Topics
Advanced analysis
- Amortized analysis: accounting and potential methods
- Randomized algorithms: expectation and concentration (intro)
- Network flow: max-flow min-cut and algorithms
- Matching theory and blossom algorithm (intro)
- Linear programming duality in algorithm design (intro)
Hardness and approximation
- NP-completeness reductions in depth
- Approximation algorithms and inapproximability (intro)
- Parameterized complexity and FPT (intro)
- Online algorithms and competitive analysis (intro)
- Exponential-time algorithms and branching (intro)
Specialized topics
- Advanced dynamic programming on trees and graphs
- Sublinear algorithms and property testing (survey)
- Streaming algorithms (intro)
- Hardness of approximation for canonical problems
- Research paper presentations
Pricing calculator
Choose materials, tutoring, or both — or book a single session as needed. Customize your plan on the subscribe page.
$1,162 · Advanced algorithms · 18 tutoring hrs
Study guides, worksheets, reviews, practice tests, and answer keys for 1 class. 18 tutoring hours (1 hr / week · semester). Bundle discount applied vs buying separately. Pay in full via Zelle.