Exploring Advanced Algorithms Compsci 224 Lecture 13
Exploring Advanced Algorithms Compsci 224 Lecture 13 reveals several interesting facts.
- linear programming: standard form, vertices, bases, simplex.
- Symmetrization, hashing: linear probing (5-wise indep.), bloom filters, cuckoo hashing, bloomier filters.
- Learning from experts, multiplicative weights.
- FPTAS (knapsack), FPRAS (DNF counting), semidefinite programming, Goemans-Williamson MAXCUT
- second order methods (Newton's method), path-following interior point wrap-up.
In-Depth Information on Advanced Algorithms Compsci 224 Lecture 13
Guest Fusion trees, word-level parallelism, most significant set bit in constant time. Logistics, course topics, word RAM, predecessor, van Emde Boas, y-fast tries. Please see Problem 1 of Assignment 1 at ... Online
Splay trees.
Stay tuned for more updates related to Advanced Algorithms Compsci 224 Lecture 13.