Design and Analysis of Algorithms: A Contemporary Perspective
By 作者: Sandeep Sen – Amit Kumar
ISBN-10 书号: 1108721990
ISBN-13 书号: 9781108721998
Release Finelybook 出版日期: 2019-07-31
pages 页数: (350 )

$64.99
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.
Content
Figures
Tables
Preface
Acknowledgments
1Model and Analysis
2Basics of Probability and Tail Inequalities
3 Warm-up Problems
4 Optimization l:Brute Force and Greedy Strategy
5 Optimization I:Dynamic Programming
6 Searching
7 Multidimensional Searching and Geometric Algorithms
8 String Matching and Finger Printing
9 Fast Fourier Transform and Applications
10 Graph Algorithms
11 Maximum Flow and Applications
12NP Completeness and Approximation Algorithms
13 Dimensionality Reduction
14 Parallel Algorithms
15 Memory Hierarchy and Caching
16Streaming Data Model