The Design and Analysis of Algorithms (Monographs in Computer

Condition - Very Good
The item shows wear from consistent use, but it remains in good condition and functions properly. Item may arrive with damaged packaging or be repackaged. It may be marked, have identifying markings on it, or have minor cosmetic damage. It may also be missing some parts/accessories or bundled items.

The Design and Analysis of Algorithms (Monographs in Computer Science)

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.
Country USA
Brand Springer
Manufacturer Springer
Binding Hardcover
ItemPartNumber 9780387976877
UnitCount 1
EANs 9780387976877
ReleaseDate 0000-00-00

Country	USA
Brand	Springer
Manufacturer	Springer
Binding	Hardcover
ItemPartNumber	9780387976877
UnitCount	1
EANs	9780387976877
ReleaseDate	0000-00-00

The Design and Analysis of Algorithms (Monographs in Computer Science)

You might also like...