Shortest paths, Fibonacci heaps, and amortized analysis
Network flow
Spectral algorithms
Divide & conquer - FFT, etc.
NP-completeness
Linear programming
Approximation algorithms
Online algorithms - multiplicative update
Hashing, bloom filters
Nearest-neighbor search 2 (hashing approach)
Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA 98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX
[comments to karlin]