Record Display for the EPA National Library Catalog

RECORD NUMBER: 12 OF 13

OLS Field Name OLS Field Data
Main Title The design and analysis of computer algorithms /
Author Aho, Alfred V., ; Hopcroft, John E. ; Ullman, Jeffrey D.
Publisher Addison-Wesley Publishing Company,
Year Published 1974
OCLC Number 01147299
ISBN 0201000296; 9780201000290
Subjects Computer programming. ; Computer algorithms. ; Electronic digital computers--Programming. ; Algorithms--analysis. ; Programming Languages. ; Algorithmentheorie ; Algorithmus ; Datenverarbeitung ; Entwurf ; Programmierung ; Software. ; Algoritmen. ; Ordinateurs--Programmation. ; Algorithmes.
Additional Subjects Electronic digital computers--Programming ; Algorithms
Internet Access
Description Access URL
Table of contents http://www.dandelon.com/isearch/intelligentSEARCH_CLASSICS.nsf/alldocs/C1257680005BA284C12572C7004DD7D7/$File/000000000000000000000-101031TVI552.PDF?OpenElement
Holdings
Library Call Number Additional Info Location Last
Modified
Checkout
Status
ELDM  QA76.6.A36 CCTE/GLTED Library/Duluth,MN 01/01/1988
Collation x, 470 pages : illustrations ; 24 cm.
Notes
Includes bibliographical references (pages 451-462) and index.
Contents Notes
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.