The design and analysis of algorithms [Perpetual access]
By: Kozen, Dexter C.
Series: Texts and monographs in computer science. / edited by David Gries.Publisher: New York Springer 1992Description: x, 322p.ISBN: 9781461244004.Subject(s): Computer algorithms | Computer scienceDDC classification: 005.1 | K849d Online resources: Click here to access online Summary: 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.| Item type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
E books
|
PK Kelkar Library, IIT Kanpur | Electronic Resources | 005.1 K849d (Browse shelf) | Available | EBK10739 |
Browsing PK Kelkar Library, IIT Kanpur Shelves , Collection code: Electronic Resources Close shelf browser
| 001.4226 M929v Visualization analysis and design [Perpetual] | 003.857 St87n2 Nonlinear dynamics and chaos [2nd ed.] [Perpetual access] | 004.35 K634p3 Programming massively parallel processors [3rd ed.] [Perpetual access] | 005.1 K849d The design and analysis of algorithms [Perpetual access] | 005.1015113 N554f Principles of program analysis [perpetual] | 005.13 R249u Upgrading to Fortran 90 [Perpetual] | 005.133 T329p Python programming [Perpetual access till February 2028] |
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.
There are no comments for this item.