Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
Lecture Notes
Combinatorial Algorithms
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."
Real-time TrafficAmortized Analysis | Combinatorial Algorithms | Computational Geometry | Graph Algorithms | Randomized Algorithms | Seminumerical Algorithms | String Matching |
| Added | 13 Feb 2009 |
| Updated | 13 Feb 2009 |
| Year | 2006 |
| Authors | Jeff Erickson |
Background
Notes on solving recurrences
0. Introduction
1. Divide and conquer
2. Dynamic programming
Randomized algorithms
3. Randomization: Nuts and bolts
4. Randomized treaps
5. Randomized mincut
6. Uniform and universal hashing
A. Skip lists
Amortized analysis
7. Amortized analysis
8. Scapegoat trees and splay trees
9. Union-find
Fibonacci heaps
Graph algorithms
10. Representing and searching graphs
11. Single-source shortest paths
12. All-pairs shortest paths
13. Minimum spanning trees
Seminumerical algorithms
14. Fast Fourier transforms
15. Number-theoretic algorithms
String matching
C. String matching: Rabin-Karp
D. String matching: Knuth-Morris-Pratt
Computational Geometry
E. Convex hulls
F. Plane sweep algorithms
G. Polygon triangulation
Lower bounds
H. Information theory
I. Adversary arguments
J. Reductions and transformations
16. NP-hard, NP-easy, and NP-complete problems Comments (0)
Researcher Info
|
From Researcher
