MARC record from Internet Archive

LEADER: 05758cam 2201177 a 4500
001 ocm46792720
003 OCoLC
005 20211209081721.0
008 010405s2001 mau b 001 0 eng
010 $a 2001031277
040 $aDLC$beng$cDLC$dC#P$dUKM$dLVB$dBAKER$dNLGGC$dBTCTA$dYDXCP$dCDX$dTXJ$dOLP$dUAB$dHEBIS$dDEBBG$dMR0$dTULIB$dOCLCF$dOCLCO$dOCLCQ$dMYIIU$dOCLCQ$dOCLCO$dDHA$dOCLCQ$dOKR$dVNS$dPAU$dQE2$dWYU$dUKUOY$dOCLCQ$dL2U$dXFF$dCNO$dCSA$dYBM$dNAG$dNKM$dOCLCO$dBUF$dOCLCO$dWURST$dSFB$dOCLCQ$dOCLCO$dSOU$dOCLCO$dOCLCQ
015 $aGBA152709$2bnb
015 $aGBA1-52709
019 $a55947682$a982316359$a1049761992$a1050128135$a1091370741$a1127726243$a1132903851$a1136407868
020 $a0262032937$q(hbk. ;$qalk. paper)
020 $a9780262032933$q(hbk. ;$qalk. paper)
020 $a0070131511$q(McGraw-Hill)
020 $a9780070131514$q(McGraw-Hill)
020 $a0262531968$q(pbk.)
020 $a9780262531962$q(pbk.)
035 $a(OCoLC)46792720$z(OCoLC)55947682$z(OCoLC)982316359$z(OCoLC)1049761992$z(OCoLC)1050128135$z(OCoLC)1091370741$z(OCoLC)1127726243$z(OCoLC)1132903851$z(OCoLC)1136407868
050 00 $aQA76.6$b.C662 2004
055 3 $aQA76.6$b.I587 2001
082 00 $a005.1$221
084 $a54.10$2bcl
084 $aST 130$2rvk
084 $aST 134$2rvk
245 00 $aIntroduction to algorithms /$cThomas H. Cormen [and others].
246 30 $aAlgorithms
250 $a2nd ed.
260 $aCambridge, Mass. :$bMIT Press,$c©2001.
300 $axxi, 1180 pages ;$c24 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
338 $avolume$bnc$2rdacarrier
500 $aRevised edition of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990.
504 $aIncludes bibliographical references (pages 1127-1130) and index.
505 0 $aThe role of algorithms in computing -- Getting started -- Growth of functions -- Recurrences -- Probabilistic analysis and randomized algorithms -- 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 -- Matrix operations-- Linear programming -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching-- Computational geometry -- NP-completeness -- approximation algorithms -- A. summations -- B. Sets, etc. -- C. Counting and probability.
520 0 $aThe book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.
650 0 $aComputer programming.
650 0 $aComputer algorithms.
650 2 $aProgramming.
650 2 $aAlgorithmes.
650 6 $aProgrammation (Informatique)
650 6 $aAlgorithmes.
650 7 $a54.10 theoretical informatics.$2bcl
650 7 $aComputer algorithms.$2fast$0(OCoLC)fst00872010
650 7 $aComputer programming.$2fast$0(OCoLC)fst00872390
650 7 $aAlgorithmus$2gnd
650 7 $aInformatik$2gnd
650 7 $aTheoretische Informatik$2gnd
650 7 $aAlgorithmentheorie$2gnd
650 17 $aAlgorithms.$0(NL-LeOCL)078429358$2gtt
650 17 $aProgramming.$0(NL-LeOCL)078637082$2gtt
650 7 $aCOMPUTER PROGRAMMING.$2nasat
650 7 $aCOMPUTER PROGRAMS.$2nasat
650 7 $aPROGRAMMING LANGUAGES.$2nasat
650 7 $aALGORITHMS.$2nasat
650 7 $aFILE MAINTENANCE (COMPUTERS)$2nasat
650 7 $aSOFTWARE TOOLS.$2nasat
650 7 $a54.10 theoretical informatics.$2nbc
650 7 $aTheoretische Informatik.$2swd
650 7 $aAlgorithmentheorie.$2swd
653 00 $acomputer software
653 00 $aalgoritmen
653 00 $aalgorithms
653 00 $aprobleemanalyse
653 00 $aproblem analysis
653 00 $aprobleemoplossing
653 00 $aproblem solving
653 00 $acomputers
653 00 $aminicomputers
653 00 $amicrocomputers
653 00 $agegevensverwerking
653 00 $adata processing
653 00 $aprogrammeren
653 00 $aprogramming
653 00 $asoftware engineering
653 10 $aSoftware, Application Programs
655 4 $aEinführung.
655 7 $aEducational tools (form)$0(NL-LeOCL)088143767$2gtt
655 7 $aEinführung.$2swd
700 1 $aCormen, Thomas H.
700 1 $aCormen, Thomas H.$tIntroduction to algorithms.
938 $aBaker & Taylor$bBKTY$c145.20$d145.20$i0070131511$n0003288640$sactive
938 $aBaker & Taylor$bBKTY$c85.00$d85.00$i0262032937$n0003728385$sactive
938 $aBaker and Taylor$bBTCP$n2001031277
938 $aCoutts Information Services$bCOUT$n0083511
938 $aYBP Library Services$bYANK$n1806186
938 $aYBP Library Services$bYANK$n1775269
938 $aYBP Library Services$bYANK$n1572313
029 1 $aAU@$b000022640236
029 1 $aAU@$b000022995536
029 1 $aDEBBG$bBV013912761
029 1 $aHEBIS$b100426514
029 1 $aHR0$b0262032937
029 1 $aNLGGC$b22811229X
029 1 $aNZ1$b6243484
029 1 $aYDXCP$b1775269
994 $aZ0$bP4A
948 $hHELD BY P4A - 737 OTHER HOLDINGS