Introduction to algorithms / (Record no. 44121)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02211cam a2200277 a 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9780262033848 (hardcover : alk. paper) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 0262033844 (hardcover : alk. paper) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9788120340077 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 0262533057 (pbk. : alk. paper) |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.1 |
| Item number | INT |
| 245 00 - TITLE STATEMENT | |
| Title | Introduction to algorithms / |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 3rd ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | Cambridge, Mass. : |
| Name of publisher | MIT Press, |
| Year of publication | c2009. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | New Delhi : |
| Name of publisher | PHI Learning, |
| Year of publication | 2009 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | xix, 1292 p. : |
| Other physical details | ill. ; |
| 500 ## - GENERAL NOTE | |
| General note | Includes index |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | I. Foundations. The role of algorithms in computing --<br/>Getting started --<br/>Growth of functions --<br/>Divide-and-conquer --<br/>Probabilistic analysis and randomized algorithms --<br/>II. Sorting and order statistics. Heapsort --<br/>Quicksort --<br/>Sorting in linear time --<br/>Medians and order statistics --<br/>III. Data structures. Elementary data structures --<br/>Hash tables --<br/>Binary search trees --<br/>Red-black trees --<br/>Augmenting data structures --<br/>IV. Advanced design and analysis techniques. Dynamic programming --<br/>Greedy algorithms --<br/>Amortized analysis --<br/>V. Advanced data structures. B-trees --<br/>Fibonacci heaps --<br/>van Emde Boas trees --<br/>Data structures for disjoint sets --<br/>VI. Graph algorithms. Elementary graph algorithms --<br/>Minimum spanning trees --<br/>Single-source shortest paths --<br/>All-pairs shortest paths --<br/>Maximun flow --<br/>VII. Selected topics. Multithreaded algorithms --<br/>Matrix operations --<br/>Linear programming --<br/>Polynomials and the FFT --<br/>Number-theoretic algorithms --<br/>String matching --<br/>Computational geometry --<br/>NP-completeness --<br/>Approximation algorithms --<br/>VIII. Appendix: Mathematical background. Summations --<br/>Sets, etc. --<br/>Counting and probability --<br/>Matrices. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | This edition has been revised and updated throughout. It includes some new chapters. It features improved treatment of dynamic programming and greedy algorithms as well as a new notion of edge-based flow in the material on flow networks |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computer programming. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Computer algorithms. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Cormen, Thomas H. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Leiserson, Charles E. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Rivest, Ronald L. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Stein, Clifford |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | Reference Books |
| Collection code | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Cost, normal purchase price | Full call number | Accession Number | Koha item type |
|---|---|---|---|---|---|---|---|---|---|
| Reference | Main Library | Main Library | Reference | 11/04/2017 | Purchase | 12000.00 | 005.1 INT | 015399 | Reference Books |
| Reference | Main Library | Main Library | Reference | 29/12/2017 | Purchased | 4339.20 | 005.1 INT | 015575 | Reference Books |