Exploring Advanced Algorithms Compsci 224 Lecture 13
Exploring Advanced Algorithms Compsci 224 Lecture 13 reveals several interesting facts.
- Logistics, course topics, word RAM, predecessor, van Emde Boas, y-fast tries. Please see Problem 1 of Assignment 1 at ...
- Online primal/dual: e/(e-1) ski rental, set cover; approximation
- Fusion trees, word-level parallelism, most significant set bit in constant time.
- Symmetrization, hashing: linear probing (5-wise indep.), bloom filters, cuckoo hashing, bloomier filters.
- Heavy-light decomposition, O(log2n) amortized analysis of link-cut trees, min cost max flow, min cost circulation, shortest ...
In-Depth Information on Advanced Algorithms Compsci 224 Lecture 13
Guest Contents: - analysis results on random BSTs: - expected depth of kth leaf, external path length - expected depth of kth node, ... second order methods (Newton's method), path-following interior point wrap-up. Hashing: load balancing, k-wise independence, chaining, linear probing.
linear programming: standard form, vertices, bases, simplex.
Stay tuned for more updates related to Advanced Algorithms Compsci 224 Lecture 13.