// the find
wangshusen/AdvancedAlgorithms
Course materials (slides only, no code) for CS600 Advanced Algorithms at Stevens Institute of Technology. Covers classical CS algorithms from sorting through network flow, dynamic programming, LSH, and basic cryptography. It's a university lecture archive, not a library or tool.
The topic selection goes beyond typical undergrad coverage — locality sensitive hashing, Dinic's algorithm, Hungarian matching, and homomorphic encryption are not things you see in most intro algorithm courses. Bilingual support (English and Chinese video lectures for many topics) is genuinely useful for non-English speakers studying algorithms. The progression from basic data structures through graph algorithms to randomized methods follows a coherent pedagogical arc. Network flow coverage is particularly thorough, walking through Ford-Fulkerson, Edmonds-Karp, and Dinic's with separate slides for each.
No code — everything is PDFs. If you want runnable implementations to study or adapt, look elsewhere. Last updated in 2021 and several sections are visibly incomplete (Balanced Trees is an empty heading, Randomized Algorithms is missing slides 3 and 5). The stable marriage and bipartite matching sections are a bit thin compared to a textbook treatment. And it's a repo of PDFs in a git repository, which is a questionable use of version control — diffs are meaningless and file sizes bloat history.