Algorithms by Jeff Erickson

Extended Dance Remix: These are notes on more advanced material directly related to the textbook. The notes are ordered roughly to match the textbook chapters. Fast Fourier Transforms (17 pages) Fast Exponential Algorithms (14 pages) Dynamic Programming for Formal Languages and Automata (7 pages, unfinished) Advanced Dynamic Programming (18 pages) Balances and Pseudoflows (13 pages) Minimum-Cost Flows (16 pages) Linear Programming (21 pages) Linear Programming Algorithms (18 pages) Approximation Algorithms (25 pages) Director's Cut: These are notes on topics not covered in the textbook. The numbering is completely independent to the textbook; I just started over at 1. We regularly cover some of the randomized algorithms material in CS 473, but I haven't used the amortized analysis or lower bounds notes in many years.