Introduction to algorithms / (Record no. 21204)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01968nam a2200229Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | NULRC |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20250520103015.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 250520s9999 xx 000 0 und d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9780070131439 |
| 040 ## - CATALOGING SOURCE | |
| Transcribing agency | NULRC |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA 76.6 .C67 1990 |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Cormen, Thomas H. |
| Relator term | author |
| 245 #0 - TITLE STATEMENT | |
| Title | Introduction to algorithms / |
| Statement of responsibility, etc. | Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Place of publication, distribution, etc. | New York : |
| Name of publisher, distributor, etc. | McGraw Hill Education, |
| Date of publication, distribution, etc. | c1990 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xvii, 1028 pages : |
| Other physical details | illustrations ; |
| Dimensions | 26 cm. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc. note | Includes index. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Growth of functions -- Summations -- Recurrences -- Sets, etc -- Counting and probability -- Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- Dynamic programming -- Greedy algorithms -- Amortized analysis -- B-trees -- Binomial heaps -- Fibonacci heaps -- Data structures for disjoint sets -- Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximum flow -- Sorting networks -- Arithmetic circuits -- Algorithms for parallel computers -- Matrix operations -- Polynomials and the FFT -- Number-theoretic algorithms --String matching -- Computational geometry -- NP-completeness -- Approximation algorithms. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. We have tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor. Each chapter presents an algorithm, a design technique, an application area, or a related topic. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | ALGORITHMES |
| 700 ## - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Leiserson, Charles E. ;Rivest, Ronald L. |
| Relator term | co-author;co-author |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | Library of Congress Classification |
| Koha item type | Books |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Total checkouts | Full call number | Barcode | Date last seen | Copy number | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Library of Congress Classification | Gen. Ed. - CCIT | LRC - Main | National University - Manila | General Circulation | 05/17/2023 | Donation | GC QA 76.6 .C67 1990 | NULIB000018963 | 05/20/2025 | c.1 | 05/20/2025 | Books |