All listings for this product
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $9.86Trending at AU $16.76
- AU $15.64Trending at AU $18.73
- AU $24.98Trending at AU $25.11
- AU $64.07Trending at AU $74.59
- AU $28.70Trending at AU $36.82
- AU $44.96Trending at AU $46.93
- AU $24.80Trending at AU $28.01
About this product
- DescriptionThese are my lecture tes 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 tes to supplement and t supplant a textbook, but over the three years they gradually took on a life of their own. In addition to the tes, 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.
- Author(s)Dexter Kozen
- PublisherSpringer-Verlag New York Inc.
- Date of Publication07/10/2011
- SubjectComputing: Professional & Programming
- Series TitleMonographs in Computer Science
- Place of PublicationNew York, NY
- Country of PublicationUnited States
- ImprintSpringer-Verlag New York Inc.
- Content Notebiography
- Weight510 g
- Width156 mm
- Height234 mm
- Spine17 mm
- Format DetailsTrade paperback (US)
- Edition StatementSoftcover reprint of the original 1st ed. 1992
This item doesn't belong on this page.
Thanks, we'll look into this.