The design and analysis of computer algorithms / (Record no. 2258)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04442cam a2200193 i 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 0201000296 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | CUS |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.1 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Aho, Alfred V. |
| 245 14 - TITLE STATEMENT | |
| Title | The design and analysis of computer algorithms / |
| Statement of responsibility, etc. | Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc. | Reading, Mass. : |
| Name of publisher, distributor, etc. | Addison-Wesley Pub. Co., |
| Date of publication, distribution, etc. | [1974] |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | x, 470 p. : |
| Other physical details | ill. ; |
| Dimensions | 24 cm. |
| 500 ## - GENERAL NOTE | |
| General note | Includes index. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc | Bibliography: p. [451]-462. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 1 Models of Computation<br/>1.1 Algorithms and their complexity<br/>1.2 Random access machines<br/>1.3 Computational complexity of RAM programs .<br/>1.4 A stored program model<br/>1.5 Abstractions of the RAM<br/>1.6 A primitive model of computation: the Turing machine.<br/>1.7 Relationship between the Turing machine and RAM models<br/>1.8 Pidgin ALGOL—a high-level language<br/>2 Design of EflBcient Algorithms<br/>2.1 Data structures: lists, queues, and stacks<br/>2.2 Set representations<br/>2.3 Graphs<br/>2.4 Trees<br/>2.5 Recursion<br/>2.6 Divide-and-conquer<br/>2.7 Balancing<br/>2.8 Dynamic programming.<br/>2.9 Epilogue<br/>3 Sorting and Order Statistics<br/>3.1 The sorting problem<br/>3.2 Radix sorting<br/>3.3 Sorting by comparisons<br/>3.4 Heapsort—an 0(n log n) comparison sort<br/>3.5 Quicksort—an 0(n log n) expected time sort<br/>3.6 Order statistics<br/>3.7 Expected time for order statistics<br/>4 Data Structures for Set Manipulation Problems<br/>4.1 Fundamental operations on sets.<br/>4.2 Hashing<br/>4.3 Binary search<br/>4.4 Binary search trees<br/>4.5 Optimal binary search trees<br/>4.6 A simple disjoint-set union algorithm<br/>vil<br/>4.7 Tree structures for the UNION-FIND problem<br/>4.8 Applications and extensions of the UNION-FIND algorithm<br/>4.9 Balanced tree schemes<br/>4.10 Dictionaries and priority queues<br/>4.11 Mergeable heaps<br/>4.12 Concatenable queues .<br/>4.13 Partitioning<br/>4.14 Chapter summary<br/>5 Algorithms on Graphs<br/>S.l Minimum-cost spanning trees<br/>5.1 Depth-first search<br/>5.3 Biconnectivity<br/>5.4 Depth-first search of a directed graph<br/>5.5 Strong connectivity<br/>5.6 Path-finding problems<br/>5.7 A transitive closure algorithm<br/>5.8 A shortest-path algorithm<br/>5.9 Path problems and matrix multiplication<br/>5.10 Single-source problems<br/>5.11 Dominators in a directed acyclic graph: putting the concepts together.<br/>6 Matrix Multiplication and Related Operations<br/>6.1 Basics<br/>6.2 Strassen's matrix-multiplication algorithm<br/>6.3 Inversion of matrices<br/>6.4 LUP decomposition of matrices<br/>6.5 Applications of LUP decomposition<br/>6.6 Boolean matrix multiplication<br/>7 The Fast Fourier Transform and its Applications<br/>7.1 The discrete Fourier transform and its inverse<br/>7.2 The fast Fourier transform algorithm .<br/>7.3 The FFT using bit operations<br/>7.4 Products of polynomials<br/>7.5 The Schonhage-Strassen integer-multiplication algorithm<br/>8 Integer and Polynomial Arithmetic<br/>8.1 The similarity between integers and polynomials<br/>8.2 Integer multiplication and division<br/>8.3 Polynomial multiplication and division<br/>8.4 Modular arithmetic<br/>8.5 Modular polynomial arithmetic and polynomial evaluation<br/>8.6 Chinese remaindering<br/>8.7 Chinese remaindering and interpolation of polynomials.<br/>8.8 Greatest common divisors and Euclid's algorithm . . .<br/>8.9 An asymptotically fast algorithm for polynomial CCD's<br/>8.10 Integer CCD's<br/>8.11 Chinese remaindering revisited<br/>8.12 Sparse polynomials<br/>9 Pattern-Matching Algorithms<br/>9.1 Finite automata and regular expressions<br/>9.2 Recognition of regular expression patterns,<br/>9.3 Recognition of substrings<br/>9.4 Two-way deterministic pushdown automata<br/>9.5 Position trees and substring identifiers<br/>10 NP-Complete Problems<br/>10.1 Nondeterministic Turing machines<br/>10.2 The classes ^ and .<br/>10.3 Languages and problems<br/>10.4 NP-completeness of the satisfiability problem .<br/>10.5 Additional NP-complete problems<br/>10.6 Polynomial-space-bounded problems.<br/>11 Some Provably Intractable Problems<br/>11.1 Complexity hierarchies<br/>11.2 The space hierarchy for deterministic Turing machines.<br/>11.3 A problem requiring exponential time and space<br/>11.4 A nonelementary problem<br/>12 Lower Bounds on Numbers of Arithmetic Operations<br/>12.1 Fields<br/>12.2 Straight-line code revisited<br/>12.3 A matrix formulation of problems<br/>12.4 A row-oriented lower bound on multiplications<br/>12.5 A column-oriented lower bound on multiplications.<br/>12.6 A row-and-column-oriented bound on multiplications<br/>12.7 Preconditioning |
| 650 #0 - SUBJECT | |
| Keyword | Computer Programming. |
| 650 #0 - SUBJECT | |
| Keyword | Computer Algorithms. |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | General Books |
| Withdrawn status | Lost status | Damaged status | Not for loan | Home library | Current library | Shelving location | Date acquired | Full call number | Accession number | Date last seen | Date last checked out | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Central Library, Sikkim University | Central Library, Sikkim University | General Book Section | 04/06/2016 | 005.1 AHO/D | P20392 | 14/07/2018 | 14/07/2018 | General Books |