The design and analysis of computer algorithms

By:

Aho, Alfred V

Contributor(s):

Material type: Text

TextPublication details: Noida Pearson India Education Services Pvt Ltd 1974Description: x, 470pISBN:

9788131702055 (pbk.)

Subject(s):

DDC classification:

001.642 AHO

Summary: Table of Content Models of Computation Design of Efficient Algorithms Sorting and Order Statistics. Data Structures for Set Manipulation Problems. Algorithms on Graphs. Matrix Multiplication and Related Operations. The Fast Fourier Transform and its Applications. Integer and Polynomial Arithmetic. Pattern-Matching Algorithms. NP-Complete Problems. Some Provably Intractable Problems. Lower Bound on Numbers of Arithmetic Operations

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Barcode
Book	Plaksha University Library	Computer science	001.642 AHO (Browse shelf(Opens below))	Available	003144
Book	Plaksha University Library	Computer science	001.642 AHO (Browse shelf(Opens below))	Available	003145
Book	Plaksha University Library	Computer science	001.642 AHO (Browse shelf(Opens below))	Available	001018

Browsing Plaksha University Library shelves, Collection: Computer science Close shelf browser (Hides shelf browser)

Previous								Next
Previous	001.434028553 SHA Uncertainty analysis of experimental data with R	001.542 WAR How conversation works	001.64 AHO Data structures and algorithms	001.642 AHO The design and analysis of computer algorithms	001.642 AHO The design and analysis of computer algorithms	001.642 AHO The design and analysis of computer algorithms	003 BAR Linked: how everything is connected to everything else and what it means for business, science, and everyday life	Next

https://www.pearsoned.co.in/web/books/9788131702055_Design--Analysis-of-Computer-Algorithms_Alfred-V-Aho.aspx

Table of Content

Models of Computation
Design of Efficient Algorithms
Sorting and Order Statistics.
Data Structures for Set Manipulation Problems.
Algorithms on Graphs.
Matrix Multiplication and Related Operations.
The Fast Fourier Transform and its Applications.
Integer and Polynomial Arithmetic.
Pattern-Matching Algorithms.
NP-Complete Problems.
Some Provably Intractable Problems.
Lower Bound on Numbers of Arithmetic Operations

There are no comments on this title.

to post a comment.