| Record ID | harvard_bibliographic_metadata/ab.bib.12.20150123.full.mrc:192775671:2581 |
| Source | harvard_bibliographic_metadata |
| Download Link | /show-records/harvard_bibliographic_metadata/ab.bib.12.20150123.full.mrc:192775671:2581?format=raw |
LEADER: 02581cam a2200373 a 4500
001 012174772-7
005 20120601104703.0
008 090226s2009 maua b 001 0 eng
010 $a 2009008593
015 $aGBA976420$2bnb
016 7 $a015341367$2Uk
020 $a9780262033848 (hardcover : alk. paper)
020 $a0262033844 (hardcover : alk. paper)
020 $a9780262533058 (pbk. : alk. paper)
020 $a0262533057 (pbk. : alk. paper)
035 0 $aocn311310321
040 $aDLC$cDLC$dBTCTA$dYDXCP$dUKM$dC#P$dBWX$dCDX$dNLGGC$dCUV$dDLC
050 00 $aQA76.6$b.C662 2009
082 00 $a005.1$222
084 $a54.10$2bcl
245 00 $aIntroduction to algorithms /$cThomas H. Cormen ... [et al.].
250 $a3rd ed.
260 $aCambridge, Mass. :$bMIT Press,$cc2009.
300 $axix, 1292 p. :$bill. ;$c24 cm.
504 $aIncludes bibliographical references (p. [1231]-1249) and index.
520 $aThis 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.--[book cover].
505 0 $aI. Foundations. The role of algorithms in computing -- Getting started -- Growth of functions -- Divide-and-conquer -- Probabilistic analysis and randomized algorithms -- II. Sorting and order statistics. Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- III. Data structures. Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- IV. Advanced design and analysis techniques. Dynamic programming -- Greedy algorithms -- Amortized analysis -- V. Advanced data structures. B-trees -- Fibonacci heaps -- van Emde Boas trees -- Data structures for disjoint sets -- VI. Graph algorithms. Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximun flow -- VII. Selected topics. Multithreaded algorithms -- Matrix operations -- Linear programming -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms -- VIII. Appendix: Mathematical background. Summations -- Sets, etc. -- Counting and probability -- Matrices.
650 0 $aComputer programming.
650 0 $aComputer algorithms.
700 1 $aCormen, Thomas H.
776 1 $cElectronic resource$z9780262259460
899 $a415_565572
988 $a20100112
906 $0DLC