Electures-Portal - Guest

Algorithmentheorie - WS 2007

• Algorithmentheorie
  • 1. Introduction
    • 1.1. Introduction - Part1
    • 1.2. Introduction - Part2
  • 2. Fast Fourier Transformation
    • 2.1. Fast Fourier Transformation - Part1
    • 2.2. Fast Fourier Transformation - Part2
    • 2.3. Fast Fourier Transformation - Part3
    • 2.4. Fast Fourier Transformation - Part4
  • 3. Randomization
    • 3.1. Randomization - Part1
    • 3.2. Randomization - Part2
    • 3.3. Randomization - Part3
    • 3.4. Randomization - Part4
    • 3.5. Randomization - Part5
  • 4. Treaps
    • 4.1. Treaps - Part1
    • 4.2. Treaps - Part2
    • 4.3. Treaps - Part3
    • 4.4. Treaps - Part4
  • 5. Hashing
    • 5.1. Hashing - Part1
    • 5.2. Hashing - Part2
    • 5.3. Hashing - Part3
    • 5.4. Hashing - Part4
  • 6. Amortized Analysis
    • 6.1. Amortized Analysis - Part1
    • 6.2. Amortized Analysis - Part2
    • 6.3. Amortized Analysis - Part3
  • 7. Binomial Queues
    • 7.1. Binomial Queues - Part1
    • 7.2. Binomial Queues - Part2
  • 8. Fibonacci Heaps
    • 8.1. Fibonacci Heaps - Part1
    • 8.2. Fibonacci Heaps - Part2
    • 8.3. Fibonacci Heaps - Part3
  • 9. Union Find Data Structures
    • 9.1. Union Find Data Structures - Part1
    • 9.2. Union Find Data Structures - Part2
  • 10. Greedy Algorithms
    • 10.1. Greedy Algorithms - Part1
    • 10.2. Greedy Algorithms - Part2
  • 11. Shortest Paths
    • 11.1. Shortest Paths - Part1
    • 11.2. Shortest Paths - Part2
    • 11.3. Shortest Paths - Part3
  • 12. Minimum Spanning Trees
    • 12.1. Minimum Spanning Trees - Part1
    • 12.2. Minimum Spanning Trees - Part2
  • 13. Bin Packing
    • 13.1. Bin Packing - Part1
    • 13.2. Bin Packing - Part2
    • 13.3. Bin Packing - Part3
  • 14. Dynamic Programming
    • 14.1. Dynamic Programming - Introduction
    • 14.2. Dynamic Programming - Matrix-chain Multiplication
    • 14.3. Dynamic Programming - Optimal Binary Search Trees
    • 14.4. Dynamic Programming - Edit Distance and String Matching
  • 15. Text Search
    • 15.1. Text Search - Suffix Trees / Suffix Tries
    • 15.2. Text Search - Construction of Suffix Trees
    • 15.3. Text Search - Boyer Moore / Knuth Morris Pratt