|
Algorithms, Computability & Complexity
|
< < |
Basic algorithmic analysis
|
> > |
Algorithms
|
|
- Asymptotic analysis
- Average case complexity bound
- Asymptotic analysis: worst case complexity bounds
|
|
- Recurrrence relations
- Amortized analysis
- Other advanced algorithmic analysis
|
< < |
Algorithmic Design strategies
|
> > |
- Algorithmic Design strategies
|
|
- Brute-force algorithms
- Greedy algorithms
- Divide-and-conquer
|
|
- Combinatorial optimization
- Pseudo random number generation
- Computational Number Theory
|
> > |
^^^ Consider http://www.esecurity.ch/Books/cryptography.html for expansion of this section
|
|
|
< < |
-
- Private-key cryptography
- Public-key cryptography
|
> > |
-
- Unkeyed cryptography
- Symmetric cryptography
- Asymmetric cryptography
- Steganography
|
|
- Geometric algorithms
- Line segments: properties, intersections
- Convex hull finding algorithms
|
Revision r1.9 - 26 Apr 2007 - 22:44 - Main.nova
Revision r1.10 - 27 Sep 2007 - 15:28 - Main.nova