Introduction to algorithms / (Record no. 142531)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01760nam a22002777a 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20260916155213.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 260916s2022 |||||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9780262046305 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | PK-LaUMT |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.1 |
| Item number | INT- |
| 245 00 - TITLE STATEMENT | |
| Title | Introduction to algorithms / |
| Statement of responsibility, etc | Thomas H. Cormen . . . [et al.] |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 4th ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc | Cambridge : |
| Name of publisher, distributor, etc | The MIT Press, |
| Date of publication, distribution, etc | 2022 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xx, 1291 p. |
| 500 ## - GENERAL NOTE | |
| General note | Includes bibliographical references and index. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout, with new chapters on matchings in bipartite graphs, online algorithms, and machine learning, and new material on such topics as solving recurrence equations, hash tables, potential functions, and suffix arrays. |
| 546 ## - LANGUAGE NOTE | |
| Language note | Eng |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithms |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer algorithms |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer programming |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Cormen, Thomas H. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Leiserson, Charles Eric |
| 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 | Books |
| Withdrawn status | Lost status | Damaged status | Home library | Current library | Date acquired | Full call number | Barcode | Date last seen | Price effective from | Koha item type | Copy number |
|---|---|---|---|---|---|---|---|---|---|---|---|
| UMT Main Campus | UMT Main Campus | 2026-09-16 | T 005.1 INT- | 154490 | 2026-09-16 | 2026-09-16 | Books | ||||
| UMT Main Campus | UMT Main Campus | 2026-09-16 | T 005.1 INT- | 154491 | 2026-09-16 | 2026-09-16 | Books | C.2 | |||
| UMT Main Campus | UMT Main Campus | 2026-09-16 | 005.1 INT- | 154492 | 2026-09-16 | 2026-09-16 | Books | C.3 |