Electures-Portal - Guest

Advanced Topics in Algorithms and Datastructures - SS 2006

• Advanced Topics in Algorithms and Datastructures
  • 1. Persistent Data Structures
    • 1.1. Persistent Data Structures, Part I
    • 1.2. Persistent Data Structures, Part II
  • 2. String Algorithms
    • 2.1. String Algorithms
  • 3. R-Trees
    • 3.1. R-Trees, Part I
    • 3.2. R-Trees, Part II
  • 4. Mechanism Design
    • 4.1. Mechanism Design, Part I
    • 4.2. Mechanism Design, Part II
  • 5. Routing in Ad-hoc Networks
    • 5.1. Routing in Ad-hoc Networks, I
    • 5.2. Routing in Ad-hoc Networks, II
  • 6. Loser Trees
    • 6.1. Loser Trees, I
    • 6.2. Loser Trees, II
  • 7. Augmenting Data Structures
    • 7.1. Augmenting Data Structures, I
    • 7.2. Augmenting Data Structures, II
  • 8. IP-Lookup Problem & Packet Classification+backtracking
    • 8.1. IP-Lookup Problem & Packet Classification, I
    • 8.2. IP-Lookup Problem & Packet Classification, II
    • 8.3. Backtracking
  • 9. Relaxed Balancing
    • 9.1. Relaxed Balancing
  • 10. Uniquely Represented Data Structures
    • 10.1. Uniquely Represented Data Structures
  • 11. Parallel Algorithms Introduction
    • 11.1. Parallel Algorithms Introduction
  • 12. Models of Parallel Computation
    • 12.1. Models of Parallel Computation
  • 13. PRAM Models
    • 13.1. PRAM Models
  • 14. Parallel Prefix Computation
    • 14.1. Parallel Prefix Computation
  • 15. parallel merging
    • 15.1. parallel merging
  • 16. Accelerated Cascading
    • 16.1. Accelerated Cascading
  • 17. Parallel List Ranking
    • 17.1. Parallel List Ranking