راهنمای الگوریتم‌ها و نظریه محاسبات، جلد ۱ ۲۰۰۹
Algorithms and Theory of Computation Handbook, Volume 1 2009

1. Front cover

2. Contents

3. Preface

4. Editors

5. Contributors

6. Chapter 1. Algorithm Design and Analysis Techniques

7. Chapter 2. Searching

8. Chapter 3. Sorting and Order Statistics

9. Chapter 4. Basic Data Structures*

10. Chapter 5. Topics in Data Structures

11. Chapter 6. Multidimensional Data Structures for Spatial Applications*

12. Chapter 7. Basic Graph Algorithms

13. Chapter 8. Advanced Combinatorial Algorithms

14. Chapter 9. Dynamic Graph Algorithms

15. Chapter 10. External-Memory Algorithms and Data Structures

16. Chapter 11. Average Case Analysis of Algorithms*

17. Chapter 12. Randomized Algorithms*

18. Chapter 13. Pattern Matching in Strings

19. Chapter 14. Text Data Compression Algorithms

20. Chapter 15. General Pattern Matching

21. Chapter 16. Computational Number Theory

22. Chapter 17. Algebraic and Numerical Algorithms

23. Chapter 18. Applications of FFT and Structured Matrices

24. Chapter 19. Basic Notions in Computational Complexity

25. Chapter 20. Formal Grammars and Languages

26. Chapter 21. Computability

27. Chapter 22. Complexity Classes

28. Chapter 23. Reducibility and Completeness

29. Chapter 24. Other Complexity Classes and Measures

30. Chapter 25. Parameterized Algorithms

31. Chapter 26. Computational Learning Theory*

32. Chapter 27. Algorithmic Coding Theory

33. Chapter 28. Parallel Computation: Models and Complexity Issues

34. Chapter 29. Distributed Computing: A Glimmer of a Theory

35. Chapter 30. Linear Programming*

36. Chapter 31. Integer Programming*

37. Chapter 32. Convex Optimization

38. Chapter 33. Simulated Annealing Techniques

39. Chapter 34. Approximation Algorithms for NP-Hard Optimization Problems

40. Back cover