- Series: Monographs in Computer Science
- Hardcover: 322 pages
- Publisher: Springer; 1992 edition (December 3, 1991)
- Language: English
- ISBN-10: 0387976876
- ISBN-13: 978-0387976877
- Product Dimensions: 6.1 x 0.9 x 9.2 inches
- Shipping Weight: 1.4 pounds (View shipping rates and policies)
- Average Customer Review: 3.8 out of 5 stars See all reviews (5 customer reviews)
- Amazon Best Sellers Rank: #525,299 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
The Design and Analysis of Algorithms (Monographs in Computer Science) 1992nd Edition
Use the Amazon App to scan ISBNs and compare prices.
Frequently bought together
Customers who bought this item also bought
These are my lecture notes from CS681: Design and Analysis of Algo rithms, a one-semester graduate course I taught at Cornell for three consec utive fall semesters from '88 to '90. The course serves a dual purpose: to cover core material in algorithms for graduate students in computer science preparing for their PhD qualifying exams, and to introduce theory students to some advanced topics in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At first I meant these notes to supplement and not supplant a textbook, but over the three years they gradually took on a life of their own. In addition to the notes, I depended heavily on the texts • A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975. • M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. w. H. Freeman, 1979. • R. E. Tarjan, Data Structures and Network Algorithms. SIAM Regional Conference Series in Applied Mathematics 44, 1983. and still recommend them as excellent references.
If you are a seller for this product, would you like to suggest updates through seller support?
Top Customer Reviews
Each lecture is (largely) self-contained and brief. Being clearly written and concise makes it an excellent choice for those interested in self-study. The homeworks are the key to understanding the material. I would suggest trying for atleast a day before looking up the solutions.
For more comprehensive treatment of the topics dicussed in the book see "The design and analysis of computer algorithms" (Aho, Hopcroft and Ullman) and "Computers and Intractability" (Garey and Johnson).
As such, it isn't really a textbook, and can't be used as the only book for a course in the design and analysis of algorithms - for that, you'll need the books by Aho et al, or Cormen et al. (Knuth's books, of course are great for the topics they cover; and while on the book by Cormen et al, there's a second edition now, since September 2001).
However,this is an excellent self-study supplement. There are 40 lectures, each being a concise, self-contained discussion on a chosen topic. Thus, you get a condensed presentation of the important points, along with invaluable insights from Prof. Kozen.
Another feature which makes this a great option for self-study/rapid review is that each chapter ends with 'homeworks', for which answers have been provided. There's a set of miscellaneous exercises as well.
It is important to realize that this is a graduate text, for those who are already familiar with data structures and algorithms. This is not an introductory text by any means, and would ill serve that purpose.
The author presumes a fairly strong background in basic data structures and algorithms as well as mathematics on the part of the reader, without which it may be very difficult to follow the presentation.
All in all, if you're doing a graduate course in the design and analysis of algorithms, then this is a superb choice for self-study, practising problem-solving and rapid review of already familiar topics.