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.
- Splay trees.
- FPTAS (knapsack), FPRAS (DNF counting), semidefinite programming, Goemans-Williamson MAXCUT
- Logistics, course topics, word RAM, predecessor, van Emde Boas, y-fast tries. Please see Problem 1 of Assignment 1 at ...
- Symmetrization, hashing: linear probing (5-wise indep.), bloom filters, cuckoo hashing, bloomier filters.
In-Depth Information on Advanced Algorithms Compsci 224 Lecture 13
Guest Fusion trees, word-level parallelism, most significant set bit in constant time. Power of random signs: ℓ2 norm estimation, subspace embeddings (regression), Johnson-Lindenstrauss, deterministic point ... Hashing: load balancing, k-wise independence, chaining, linear probing.
Hashing: cuckoo hashing analysis, power of two choices.
Stay tuned for more updates related to Advanced Algorithms Compsci 224 Lecture 13.