The Design and Analysis of Computer Algorithms (Addison-Wesley Series in Computer Science and Information Processing) | 
 enlarge | Authors: Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman
Publisher: Addison-Wesley
Category: Book
List Price: $67.40
Buy Used: $10.61
You Save: $56.79 (84%)
New (13) Used (30) from $10.61
Rating:  10 reviews
Sales Rank: 96222
Media: Hardcover
Pages: 470
Number Of Items: 1
Shipping Weight (lbs): 1.9
Dimensions (in): 9.6 x 6.6 x 1
ISBN: 0201000296
Dewey Decimal Number: 001.642
EAN: 9780201000290
Publication Date: January 11, 1974
Availability: Usually ships in 1-2 business days
Condition: Shows some signs of wear, and may have some markings on the inside. 100% Money Back Guarantee. Shipped to over one million happy customers. Your purchase benefits world literacy!
| |
| Customer Reviews: Read 5 more reviews...
 Very effective introduction to algorithms April 6, 2008
Mike W. (New England)
The book used in my graduate Intro to Algorithms course, and I think the follow-on. While I am obviously not as well read in this subject as many of the other reviewers, I can say "it worked", and indeed worked well. A course that has a weak text or teacher will not inspire... A-H-O/DACA and Prof. Carlson made the material exciting, even to an "architecture guy". My interests in grad school in the early 80's revolved around tessellation automata (aka systolic arrays and other highly regular compute structures) and big steaming fast computer structures. A-H-O provided me with the best understanding of the kinds of problems faced by the computers which interested me the most, and the kinds of tools needed to understand computational impact and algorithmic structuring of solutions to them. I sincerely with I hadn't lost my copy with the hundreds of annotations in the margins.
still the classic December 13, 2007
steve estvanik (seattle, wa USA)
1 out of 1 found this review helpful
One of the classics -- a readable and practical textbook with dozens of problems and projects. Great as a reference to basic data structures and algorithms, too!
 hopelessly out of date. July 3, 2005
C. Wetzelberger (USA)
6 out of 16 found this review helpful
This is a good book. The problem is it is WAY out of date, so out of date that he describes Pidgin ALGOL as a high level computer language. Higher then assembly sure, but give me a break. What I do like about this book is it is not wordy, it explains the topics quickly without over complicating them. If your looking for a more mordern approch look else where.
Not optional September 17, 2004
SkipSailors (Silicon Forset)
5 out of 11 found this review helpful
When I was in grad school starting a course in the Analysis of Algorithms, our professor told us there were only two reasonable choices of text for the course. We could use Knuth TAOCP or AHU. Since we were all students, probably starving, we would use AHU.
The very classic July 16, 2002
G. Avvinti (Sicily, Italy)
26 out of 30 found this review helpful
Excluding Knuth's opera (another dimension), this (AHU) is about the other and only renowned classic algorithms book, deseverdly I'd say, together with Cormen-Leiserson-Rivest's (CLR) "Introduction to Algorithms". With the difference that the first and only edition of AHU has been written 16 years before the first (of the two) editions of CLR.The two books are quite different in the language and formalism used: more formal and mathematical inclined AHU with respect to CLR. I'd say, the very classic style of his authors who have made history in the CS literature with their books (particularly 2 on algorithms and data structures, 2 on Computer Theory, 2 on Compilers, 1 on CS foundations): as these books have been used in most universities around the world for decades, they've proved to be real milestones in the education of thousands of students. The books differ also in scope, since AHU is certainly not an encyclopedic collection as CLR does, with his roughly 500 pages against 1000. In spite of this, I'd point out the following: my textbook on Algorithms was CLR, but when we got to Complexity Classes (P-NP and theory behind) we "had" to switch to AHU for the simple reason that CLR did not almost mention at all Turing Machines nor Space Complexity, without which is certainly possible to learn e.g. about NP-TIME completeness, but without which, such a path would equally certainly miss some foundamental topics of Complexity Theory. All in all, then, imo the book truly deserves 5 stars (and perhaps it would deserve a second, updated, edition too ... possibly, imho, through a bit less revolutionary revision job than they did with "Introduction to Automata Theory, Language and Computation"). As a final note, those looking for a more applicative and self-reference than an educational introductory text, could have a look at the two-volumes opera by the former Knuth's pupil, Robert Sedgewick (possibly the more consolidated C or C++ versions).
|
|
|
