Monday, March 2, 2009

Introduction to Alogrithms

Writers: Thomas H. Cormen, Charles E. Leiserson & Ronald L. Rivest
Catogary: Electrical & Computer
Total Pages: 1339
Contents:

  1. Mathematical Foundations
  2. Growth of Functions
  3. Summations
  4. Recurrences
  5. 5 Sets, etc
  6. Counting & Probability
  7. Heapsort
  8. Qucik Sort
  9. Sorting in Linear time
  10. Medians & other Statistics
  11. Advance Design & Analysis Techniques
  12. Advance Data Structures
  13. B Trees
  14. Binomial Heaps
  15. Fabonacci Heaps
  16. Data Structures for Disjoint Sets
  17. Graph Alogrithms
  18. Sorting Networks
  19. Arithmetic Circuits
  20. Alogrithms for Parallel computers
  21. Matrix Operations
  22. Polynomials & FFT
  23. Number-Theoretic Alogrithms
  24. String Matching
  25. Computational Geometry
  26. NP Completeness
  27. Approximation Alogrithms

Download Here

No comments:

Post a Comment