000			01768 a2200229 4500
003			OSt
020			_a9781461244004
040			_cIIT Kanpur
041			_aeng
082			_a005.1 _bK849d
100			_aKozen, Dexter C.
245			_aThe design and analysis of algorithms [Perpetual access] _cDexter C. Kozen
260			_bSpringer _c1992 _aNew York
300			_ax, 322p
440			_aTexts and monographs in computer science
490			_a/ edited by David Gries
520			_aThese 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.
650			_aComputer algorithms
650			_aComputer science
856			_uhttps://link.springer.com/book/10.1007%2F978-1-4612-4400-4#about
942			_cEBK
999			_c565140 _d565140