Covers both core and advanced algorithmic topics for graduate study
Structured as lecture notes from a successful teaching experience
Supplemental material for PhD qualifying exams and algorithm theory
Includes references to key textbooks for deeper understanding
Hardcover format for durability and reference
Summarized by Shop
Monographs in Computer Science Kozen, Dexter C. 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 scie