| 000 -LEADER |
|---|
| fixed length control field |
02418 a2200265 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| ISBN |
9780262533058 |
| 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 |
In8a3 |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Introduction to algorithms [3rd ed.] [Perpetual access] |
| Statement of responsibility, etc |
Thomas H. Cormen ... [et al.] |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
3rd ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Name of publisher |
MIT Press |
| Year of publication |
2009 |
| Place of publication |
Cambridge |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Number of Pages |
xx, 1293p |
| 440 ## - SERIES STATEMENT/ADDED ENTRY--TITLE |
|---|
| Title |
The MIT Press Series |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Computer programming |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical Term |
Computer algorithms |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Cormen, Thomas H. |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Leiserson, Charles E. |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Rivest, Ronald L. |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Stein, Clifford |
| 856 ## - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
https://ebookcentral.proquest.com/lib/iitk-ebooks/reader.action?docID=3339142&query=3339142 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
E books |
