| LEADER 00000nam 2200000uu 4500 |
| 001 13399110384 |
| 003 ULIBM |
| 005 20101210012519.0 |
| 008 120617s2001||||th 000 0 eng d |
| 010 2001031277 |
| 020 9780262531962 |
| 082 0 ^a005.1 ^bTI |
| 100 0 Thomas H. Cormen |
| 245 00 Introduction to algorithms /^cThomas H. Cormen ... [etal.] |
| 246 30 Algorithms |
| 250 ^a2nd ed |
| 260 Cambridge, Mass. :^bMIT Press,^cc2001 |
| 300 xxi, 1180 p. ;^c24 cm. +^e588 Bath |
| 500 Rev. ed. of: Introduction to algorithms / Thomas H. Cormen,Charles E. Leiserson, Ronald L. Rivest. c1990 |
| 504 Includes bibliographical references (p. [1127]-1130) andindex |
| 505 00 ^tThe role of algorithms in computing --^tGetting started--^tGrowth of functions --^tRecurrences --^tProbabilistic analysis and randomized algortihms --^tHeapsort --^tQuicksort --^tSorting in linear time --^tMedians and order statistics --^tElementary data structures --^tHash Tables --^tBinary Search trees --^tRed-black trees --^tAugmenting data structures --^tDynamic programming --^tGreedy Algorithms --^tAmortized analysis --^tB-trees --^tBinomial heaps --^tFibonacci heaps --^tData structures for disjoint sets --^tElementary graph algorithms --^tMinimum spanning trees --^tSingle-source shortest paths --^tAll-pairs shortest paths --^tMaximum flow --^tSorting networks --^tMatrix operations --^tLinear programming --^tPolynomials and the FFT --^tNumber-theoretic algortihsm --^tString matching --^tComputational geometry --^tNP-completeness --^tApproximation algorithms --^gA.^tsummations --^gB.^tSets, etc. --^gC.^tCounting and probability |
| 650 0 Computer programming |
| 650 0 Computer algorithms |
| 700 1 Cormen, Thomas H |
| 700 1 Cormen, Thomas H.^tIntroduction to algorithms |
| 945 ^p588^l0^i006609 |
| 999 ^aคณะวิศวะ (มมส) |
แสดงรายละเอียดบรรณานุกรม
QR code
ปิดหน้าต่าง
Copyright 2025. All Rights Reserved.