|
|
|
Item Details
Title:
|
THE DESIGN AND ANALYSIS OF ALGORITHMS
|
By: |
Dexter Kozen |
Format: |
Hardback |
List price:
|
£72.50 |
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
ISBN 10: |
0387976876 |
ISBN 13: |
9780387976877 |
Publisher: |
SPRINGER-VERLAG NEW YORK INC. |
Pub. date: |
3 December, 1991 |
Edition: |
1992 ed. |
Series: |
Monographs in Computer Science |
Pages: |
332 |
Description: |
The design and analysis of algorithms is one of the two essential cornerstone topics in computer science. This is a useful text for graduate study of algorithms. |
Synopsis: |
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. |
Illustrations: |
biography |
Publication: |
US |
Imprint: |
Springer-Verlag New York Inc. |
Returns: |
Returnable |
|
|
|
|
Ramadan and Eid al-Fitr
A celebratory, inclusive and educational exploration of Ramadan and Eid al-Fitr for both children that celebrate and children who want to understand and appreciate their peers who do.
|
|
|
|
|
|
|
|
|
|
|