Media Summary: Heavy-light decomposition, O(log2n) amortized analysis of link-cut trees, min cost max flow, min cost circulation, shortest ... Logistics, course topics, word RAM, predecessor, van Emde Boas, y-fast tries. Please see Problem 1 of Assignment 1 at ... As the John L. Loeb Associate Professor of Engineering and Applied Sciences at the Harvard John A. Paulson School of ...
Advanced Algorithms Compsci 224 Lecture 23 - Detailed Analysis & Overview
Heavy-light decomposition, O(log2n) amortized analysis of link-cut trees, min cost max flow, min cost circulation, shortest ... Logistics, course topics, word RAM, predecessor, van Emde Boas, y-fast tries. Please see Problem 1 of Assignment 1 at ... As the John L. Loeb Associate Professor of Engineering and Applied Sciences at the Harvard John A. Paulson School of ... Power of random signs: ℓ2 norm estimation, subspace embeddings (regression), Johnson-Lindenstrauss, deterministic point ... second order methods (Newton's method), path-following interior point wrap-up. Zeta transform, Möbius inversion, streaming
External memory model: linked list, matrix multiplication, B-tree, buffered repository tree, sorting. Linear programming via multiplicative weights, flows, augmenting paths. Preferred path decomposition, link-cut trees. Symmetrization, hashing: linear probing (5-wise indep.), bloom filters, cuckoo hashing, bloomier filters.
