ALGORITHMS: A TOP-DOWN APPROACH

This comprehensive compendium provides a rigorous framework to tackle the daunting challenges of designing correct and efficient algorithms. It gives a uniform approach to the design, analysis, optimization, and verification of algorithms. The volume also provides essential tools to understand algorithms and their associated data structures.

This useful reference text describes a way of thinking that eases the task of proving algorithm correctness. Working through a proof of correctness reveals an algorithm's subtleties in a way that a typical description does not. Algorithm analysis is presented using careful definitions that make the analyses mathematically rigorous.

Related Link(s)

Contents:
Fundamentals:IntroductionProving Algorithm CorrectnessAnalyzing AlgorithmsData Structures:Basic Techniques for Data StructuresPriority QueuesStorage/Retrieval I: Ordered KeysStorage/Retrieval II: Unordered KeysDisjoint SetsGraphsAlgorithm Design Techniques:Divide and ConquerOptimization I: Greedy AlgorithmsOptimization II: Dynamic ProgrammingCommon Reduction Targets:Depth-First SearchNetwork Flow and Matching* The Fast Fourier TransformIntractable Problems:NP-CompletenessApproximation Algorithms
Readership: Researchers, professionals, academics, undergraduate and graduate students in theoretical computer science.