
- English
- PDF
- Available on iOS & Android
About this book
The text covers important algorithm design techniques, such as greedy algorithms, dynamic programming, and divide-and-conquer, and gives applications to contemporary problems. Techniques including Fast Fourier transform, KMP algorithm for string matching, CYK algorithm for context free parsing and gradient descent for convex function minimization are discussed in detail. The book's emphasis is on computational models and their effect on algorithm design. It gives insights into algorithm design techniques in parallel, streaming and memory hierarchy computational models. The book also emphasizes the role of randomization in algorithm design, and gives numerous applications ranging from data-structures such as skip-lists to dimensionality reduction methods.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Cover
- Design and Analysis of Algorithms
- Title
- Copyright
- Dedication
- Content
- Figures
- Tables
- Preface
- Acknowledgments
- CHAPTER 1 Model and Analysis
- CHAPTER 2 Basics of Probability and Tail Inequalities
- CHAPTER 3 Warm-up Problems
- CHAPTER 4 Optimization I: Brute Force and Greedy Strategy
- CHAPTER 5 Optimization II: Dynamic Programming
- CHAPTER 6 Searching
- CHAPTER 7 Multidimensional Searching and Geometric Algorithms
- CHAPTER 8 String Matching and Finger Printing
- CHAPTER 9 Fast Fourier Transform and Applications
- CHAPTER 10 Graph Algorithms
- CHAPTER 11 Maximum Flow and Applications
- CHAPTER 12 NP Completeness and Approximation Algorithms
- CHAPTER 13 Dimensionality Reduction
- CHAPTER 14 Parallel Algorithms
- CHAPTER 15 Memory Hierarchy and Caching
- CHAPTER 16 Streaming Data Model
- APPENDIX A Recurrences and Generating Functions
- Bibliography
- Index