2nd Edition
Algorithms and Theory of Computation Handbook, Volume 1 General Concepts and Techniques
Algorithms Design and Analysis Techniques
Searching
Sorting and Order Statistics
Basic Data Structures
Topics in Data Structures
Multidimensional Data Structures for Spatial Applications
Basic Graph Algorithms
Advanced Combinatorial Algorithms
Dynamic Graph Algorithms
NEW! External Memory Algorithms and Data Structures
Average Case Analysis of Algorithms
Randomized Algorithms
Pattern Matching in Strings
Text Data Compression Algorithms
General Pattern Matching
NEW! Computational Number Theory
Algebraic and Numerical Algorithms
Applications of FFT and Structured Matrices
Basic Notions in Computational Complexity
Formal Grammars and Languages
Computability
Complexity Classes
Reducibility and Completeness
Other Complexity Classes and Measures
NEW! Parameterized Algorithms
Computational Learning Theory
NEW! Algorithmic Coding Theory
Parallel Computation: Models and Complexity Issues
Distributed Computing: A Glimmer of a Theory
Linear Programming
Integer Programming
Convex Optimization
Simulated Annealing Techniques
Approximation Algorithms for NP-Hard Optimization Problems
Biography
Mikhail J. Atallah is a distinguished professor of computer science at Purdue University.
Marina Blanton is an assistant professor in the computer science and engineering department at the University of Notre Dame
