The Design and Analysis of Algorithms by Dexter C Kozen
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.-
The Science of Programming
-
A Theory of Objects
-
Numerical Geometry of Non-Rigid Shapes
-
Computer Systems
-
Algebraic Approaches to Program Semantics
-
Set Theory for Computing
-
Beauty Is Our Business
-
Parameterized Complexity
-
A Discipline of Multiprogramming
-
Asynchronous Circuits
-
The Design of Well-Structured and Correct Programs
-
String-Rewriting Systems
-
Error-Free Polynomial Matrix Computations
-
Prototyping-Oriented Software Development
-
An Introduction to Formal Language Theory
-
The Synthesizer Generator
-
Methods and Applications of Error-Free Computation
-
Adaptive Information Processing
-
Reliable Computer Systems
-
Programming with Sets
-
Programming in Modula-2
-
Adaptive Signal Processing
-
Predicate Calculus and Program Semantics
-
Algorithmic Algebra
-
Programming with Specifications
-
Probabilistic Analysis of Algorithms
-
Expert Systems and Probabilistic Network Models
-
Algorithmic Language and Program Development
-
Object-Oriented Database Programming
-
Software Configuration Management Using Vesta
-
The Origins of Digital Computers
-
Larch: Languages and Tools for Formal Specification
-
What Computing Is All About
-
ML with Concurrency
-
The Synthesizer Generator Reference Manual
-
Language Equations
-
On a Method of Multiprogramming
-
Programming Methodology
-
Abstraction, Refinement and Proof for Probabilistic Systems
-
Super-Recursive Algorithms
-
Specification and Development of Interactive Systems
-
Geometric Fundamentals of Robotics
-
Evolutionary Synthesis of Pattern Recognition Systems
-
Reverse Engineering of Object Oriented Code
-
High Performance Discovery In Time Series
-
Panoramic Vision
| SKU | Unavailable |
| ISBN 13 | 9781461287575 |
| ISBN 10 | 146128757X |
| Title | The Design and Analysis of Algorithms |
| Author | Dexter C Kozen |
| Series | Monographs In Computer Science |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Springer-Verlag New York Inc. |
| Year published | 2011-10-07 |
| Number of pages | 322 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |