000 01385pam a2200313 a 4500
999 _c5517
_d5517
001 23073
010 _a 2001031277
020 _a9780262533058
020 _a0262032937 (trade : hc. : alk. paper)
040 _aDLC
082 0 0 _a005.1
245 0 0 _aIntroduction to algorithms /
_cThomas H. Cormen ... [et al.].
246 3 0 _aAlgorithms
250 _a3rd ed.
260 _aCambridge, Mass. :
_bMIT Press,
_cc2009.
300 _axxi, 1180 p. :
_bill ;
_c24 cm.
500 _aRev. ed. of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990.
504 _aIncludes bibliographical references and index.
520 _aBoth rigorous and complete, this introduction covers traditional material and modern developments: elementary data structures, sorting graph algorithms and NP-completeness are included along with material on Fibonacci heaps, parallel algorithms, network flow algorithms, computational geometry, and number-theoretic algorithms.
526 _aCSCI203, CSIT133
650 0 _aComputer programming.
_93176
650 0 _aComputer algorithms.
_9274
650 7 _aComputer programming.
_93176
650 7 _aComputer algorithms.
_9274
700 1 _aCormen, Thomas H.
_98804
700 1 _aCormen, Thomas H.
_98804
856 _uhttps://uowd.box.com/s/awqkbckqx30dvedoyetvm3olrhf6uzdp
_zLocation Map
942 _cREGULAR
_2ddc