Advertisement

The Design and Analysis of Algorithms

  • Dexter C. Kozen

Part of the Texts and Monographs in Computer Science book series (MCS)

Table of contents

  1. Front Matter
    Pages i-x
  2. Lectures

    1. Front Matter
      Pages 1-1
    2. Dexter C. Kozen
      Pages 3-8
    3. Dexter C. Kozen
      Pages 9-12
    4. Dexter C. Kozen
      Pages 13-18
    5. Dexter C. Kozen
      Pages 19-24
    6. Dexter C. Kozen
      Pages 25-27
    7. Dexter C. Kozen
      Pages 28-33
    8. Dexter C. Kozen
      Pages 34-39
    9. Dexter C. Kozen
      Pages 40-43
    10. Dexter C. Kozen
      Pages 44-47
    11. Dexter C. Kozen
      Pages 48-51
    12. Dexter C. Kozen
      Pages 52-57
    13. Dexter C. Kozen
      Pages 58-64
    14. Dexter C. Kozen
      Pages 65-70
    15. Dexter C. Kozen
      Pages 71-76
    16. Dexter C. Kozen
      Pages 77-83
    17. Dexter C. Kozen
      Pages 84-89
    18. Dexter C. Kozen
      Pages 90-95
    19. Dexter C. Kozen
      Pages 96-100
    20. Dexter C. Kozen
      Pages 101-105
    21. Dexter C. Kozen
      Pages 106-110
    22. Dexter C. Kozen
      Pages 111-115
    23. Dexter C. Kozen
      Pages 116-121
    24. Dexter C. Kozen
      Pages 122-127
    25. Dexter C. Kozen
      Pages 128-133
    26. Dexter C. Kozen
      Pages 134-137
    27. Dexter C. Kozen
      Pages 138-143
    28. Dexter C. Kozen
      Pages 144-150
    29. Dexter C. Kozen
      Pages 151-155
    30. Dexter C. Kozen
      Pages 156-159
    31. Dexter C. Kozen
      Pages 160-165
    32. Dexter C. Kozen
      Pages 166-170
    33. Dexter C. Kozen
      Pages 171-175
    34. Dexter C. Kozen
      Pages 176-180
    35. Dexter C. Kozen
      Pages 181-185
    36. Dexter C. Kozen
      Pages 186-190
    37. Dexter C. Kozen
      Pages 191-196
    38. Dexter C. Kozen
      Pages 197-200
    39. Dexter C. Kozen
      Pages 201-205
    40. Dexter C. Kozen
      Pages 206-210
    41. Dexter C. Kozen
      Pages 211-215
  3. Back Matter
    Pages 217-322

About this book

Introduction

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.

Keywords

NC NP-completeness algorithm algorithms automata automata theory complexity theory of computation

Authors and affiliations

  • Dexter C. Kozen
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4612-4400-4
  • Copyright Information Springer-Verlag New York 1992
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4612-8757-5
  • Online ISBN 978-1-4612-4400-4
  • Series Print ISSN 0172-603X
  • Buy this book on publisher's site