| Record ID | marc_columbia/Columbia-extract-20221130-015.mrc:131921602:2839 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-015.mrc:131921602:2839?format=raw |
LEADER: 02839cam a22003854a 4500
001 7373316
005 20221130233623.0
008 090226t20092009maua 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 $a(OCoLC)ocn311310321
035 $a(NNC)7373316
035 $a7373316
040 $aDLC$cDLC$dBTCTA$dYDXCP$dUKM$dC#P$dBWX$dCDX$dOrLoB-B
050 04 $aQA76.6$b.C662 2009
082 00 $a005.1$222
082 04 $a004
245 00 $aIntroduction to algorithms /$cThomas H. Cormen [and others].
250 $a3rd ed.
260 $aCambridge, Mass. :$bMIT Press,$c[2009], ©2009.
300 $axix, 1292 pages :$billustrations ;$c24 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
504 $aIncludes bibliographical references and index.
505 00 $gI.$tFoundations -- $g1.$tThe Role of Algorithms in Computing -- $g2.$tGetting Started -- $g3.$tGrowth of Functions -- $g4.$tDivide-and-Conquer -- $g5.$tProbabilistic Analysis and Randomized Algorithms -- $gII.$tSorting and Order Statistics -- $g6.$tHeapsort -- $g7.$tQuicksort -- $g8.$tSorting in Linear Time -- $g9.$tMedians and Order Statistics -- $gIII.$tData Structures -- $g10.$tElementary Data Structures -- $g11.$tHash Tables -- $g12.$tBinary Search Trees -- $g13.$tRed-Black Trees -- $g14.$tAugmenting Data Structures -- $gIV.$tAdvanced Design and Analysis Techniques -- $g15.$tDynamic Programming -- $g16.$tGreedy Algorithms -- $g17.$tAmortized Analysis -- $gV.$tAdvanced Data Structures -- $g18.$tB-Trees -- $g19.$tFibonacci Heaps -- $g20.$tvan Emde Boas Trees -- $g21.$tData Structures for Disjoint Sets -- $gVI.$tGraph Algorithms -- $g22.$tElementary Graph Algorithms -- $g23.$tMinimum Spanning Trees -- $g24.$tSingle-Source Shortest Paths -- $g25.$tAll-Pairs Shortest Paths -- $g26.$tMaximum Flow -- $gVII.$tSelected Topics -- $g27.$tMultithreaded Algorithms -- $g28.$tMatrix Operations -- $g29.$tLinear Programming -- $g30.$tPolynomials and the FFT -- $g31.$tNumber-Theoretic Algorithms -- $g32.$tString Matching -- $g33.$tComputational Geometry -- $g34.$tNP-Completeness -- $g35.$tApproximation Algorithms -- $gVIII.$tAppendix: Mathematical Background -- $gA.$tSummations -- $gB.$tSets, Etc -- $gC.$tCounting and Probability -- $gD.$tMatrices.
650 0 $aComputer programming.$0http://id.loc.gov/authorities/subjects/sh85107310
650 0 $aComputer algorithms.$0http://id.loc.gov/authorities/subjects/sh91000149
700 1 $aCormen, Thomas H.$0http://id.loc.gov/authorities/names/n88298355
852 00 $bsci$hQA76.6$i.I5858 2009
852 00 $bsci$hQA76.6$i.I5858 2009