| Record ID | marc_oregon_summit_records/catalog_files/pcc_bibs.mrc_rev.mrc:95241448:1780 |
| Source | Oregon Libraries |
| Download Link | /show-records/marc_oregon_summit_records/catalog_files/pcc_bibs.mrc_rev.mrc:95241448:1780?format=raw |
LEADER: 01780nam a2200289Ia 4500
001 44674539
003 OCoLC
005 20001018145046.0
008 000727t19991990mau 000 0 eng d
020 $a0262031418
040 $aGZP$cGZP$dOQP
049 $aOQPA
100 1 $aCormen, Thomas H.
245 10 $aIntroduction to algorithms /$cThomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest.
260 $aCambridge, Mass. :$bMIT Press ;$aNew York :$bMcGraw-Hill,$c2000, c1990.
300 $axvii, 1028 p. :$bill. ;$c26 cm.
440 4 $aThe MIT electrical engineering and computer science series
504 $aIncludes bibliographcal references (p. [987]-996) and index.
505 0 $aGrowth 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.
650 0 $aComputer programming.
650 0 $aComputer algorithms.
700 1 $aLeiserson, Charles Eric.
700 1 $aRivest, Ronald L.
907 $a.b11329956$bmulti$c-
902 $a071003
998 $b2$c001018$dm$ea$f-$g0
945 $lcgen $a005.1 C67 2000