The design and analysis of algorithms [Perpetual access] (Record no. 565140)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01768 a2200229 4500 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | OSt |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9781461244004 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | IIT Kanpur |
| 041 ## - LANGUAGE CODE | |
| Language code of text/sound track or separate title | eng |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.1 |
| Item number | K849d |
| 100 ## - MAIN ENTRY--AUTHOR NAME | |
| Personal name | Kozen, Dexter C. |
| 245 ## - TITLE STATEMENT | |
| Title | The design and analysis of algorithms [Perpetual access] |
| Statement of responsibility, etc | Dexter C. Kozen |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Name of publisher | Springer |
| Year of publication | 1992 |
| Place of publication | New York |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | x, 322p |
| 440 ## - SERIES STATEMENT/ADDED ENTRY--TITLE | |
| Title | Texts and monographs in computer science |
| 490 ## - SERIES STATEMENT | |
| Series statement | / edited by David Gries |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | 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. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computer algorithms |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computer science |
| 856 ## - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | https://link.springer.com/book/10.1007%2F978-1-4612-4400-4#about |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | E books |
| Withdrawn status | Lost status | Damaged status | Not for loan | Collection code | Home library | Current library | Date acquired | Source of acquisition | Cost, normal purchase price | Full call number | Accession Number | Cost, replacement price | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Electronic Resources | PK Kelkar Library, IIT Kanpur | PK Kelkar Library, IIT Kanpur | 28/04/2022 | 88 | 35736.26 | 005.1 K849d | EBK10739 | 35736.26 | E books |