The design and analysis of computer algorithms
Alfred V. Aho (Author), John E. Hopcroft (Author), Jeffrey D. Ullman (Author)
With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into sorting, searching and graphing algorithms, the string-matching algorithms, and the Schonhage-Strassen integer-multiplication algorithm. Provides numerous graded exercises at the end of each chapter
Print Book, English, 1974
Addison-Wesley Publishing Company, Reading, Massachusetts, 1974
x, 470 pages : illustrations ; 24 cm.
9780201000290, 0201000296
1147299
1. Models of Computation
2. Design of Efficient Algorithms
3. Sorting and Order Statistics
4. Data Structures for Set Manipulation Problems
5. Algorithms on Graphs
6. Matrix Multiplication and Related Operations
7. The Fast Fourier Transform and its Applications
8. Integer and Polynomial Arithmetic
9. Pattern-Matching Algorithms
10. NP-Complete Problems
11. Some Provably Intractable Problems
12. Lower Bounds on Numbers of Arithmetic Operations