Amazon cover image
Image from Amazon.com

The design and analysis of computer algorithms / Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman.

By: Contributor(s): Series: Addison-Wesley series in computer science and information processing ; Publisher: Reading, Massachusetts : Addison-Wesley Publishing Company, 1974Copyright date: 1974Description: x, 470 pages : illustrations ; 24 cmContent type:
  • text
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 0201000296
  • 9780201000290
Subject(s): Additional physical formats: Online version:: Design and analysis of computer algorithms.DDC classification:
  • 001.6/42 18
LOC classification:
  • QA76.6 .A36 1974
Other classification:
  • 31.80
  • 54.10
  • 54.50
  • QH 500
  • ST 230
  • ST 130
  • ST 134
  • DAT 530f
  • 97N60
  • 68C25
  • 68C05
  • 68Exx
Online resources: Available additional physical forms:
  • Also issued online.
Contents:
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.
Summary: 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.
Holdings
Item type Current library Call number Copy number Status Date due Barcode Item holds
BOOK BOOK NCAR Library Mesa Lab QA76.6 .A36 1974 1 Available 50583020013813
Total holds: 0

Includes bibliographical references (pages 451-462) and index.

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.

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.

Also issued online.

Current Copyright Fee: GBP25.00 0. Uk

Questions? Email library@ucar.edu.

Not finding what you are looking for? InterLibrary Loan.