Media Summary: Hashing: load balancing, k-wise independence, chaining, linear probing. Symmetrization, hashing: linear probing (5-wise indep.), bloom filters, cuckoo hashing, bloomier filters. Power of random signs: ℓ2 norm estimation, subspace embeddings (regression), Johnson-Lindenstrauss, deterministic point ...
Advanced Algorithms Compsci 224 Lecture 3 - Detailed Analysis & Overview
Hashing: load balancing, k-wise independence, chaining, linear probing. Symmetrization, hashing: linear probing (5-wise indep.), bloom filters, cuckoo hashing, bloomier filters. Power of random signs: ℓ2 norm estimation, subspace embeddings (regression), Johnson-Lindenstrauss, deterministic point ... As the John L. Loeb Associate Professor of Engineering and Applied Sciences at the Harvard John A. Paulson School of ... Necessity of randomized/approximate guarantees, linear sketching, AMS sketch, p-stable sketch for p less than 2. Logistics, course topics, word RAM, predecessor, van Emde Boas, y-fast tries. Please see Problem 1 of Assignment 1 at ...
second order methods (Newton's method), path-following interior point wrap-up. Zeta transform, Möbius inversion, streaming Fusion trees, word-level parallelism, most significant set bit in constant time. Hashing: cuckoo hashing analysis, power of two choices. Simplex wrap-up, strong duality, complementary slackness, ellipsoid, intro to interior point. Heavy-light decomposition, O(log2n) amortized analysis of link-cut trees, min cost max flow, min cost circulation, shortest ...
Amortized analysis, binomial heaps, Fibonacci heaps. Linear programming via multiplicative weights, flows, augmenting paths.
