000 01366cam a2200229 i 4500
020 _a9788178081038
020 _a0201000296
082 0 0 _a005.1
_bAHO
100 1 _aAho, Alfred V.
245 1 4 _aThe design and analysis of computer algorithms
260 _aDelhi :
_bAddison-Wesley Pub. Co.,
_c[1974]
300 _ax, 470 p. :
_billustrations ;
490 0 _aAddison-Wesley series in computer science and information processing
500 _aIncludes index.
505 _a1. 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.
520 _aThe 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.
650 0 _aComputer programming.
650 0 _aComputer algorithms.
700 1 _aHopcroft, John E.,
700 1 _aUllman, Jeffrey D.,
942 _cREF
999 _c11453
_d11453