The
design and analysis of computer algorithms
Aho, Alfred V.
creator
Hopcroft, John E.
Ullman, Jeffrey D.
text
Delhi
Addison-Wesley Pub. Co.
[1974]
monographic
x, 470 p. : illustrations ;
The Design and Analysis of Computer Algorithms introduces the basic data structures and programming techniques often used in efficient algorithms. It covers the use of lists, push-down stacks, queues, trees, and graphs.
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.
Includes index.
Computer programming
Computer algorithms
005.1 AHO
Addison-Wesley series in computer science and information processing
9788178081038
0201000296