| 000 | 01962cmm a2200409 i 4500 | ||
|---|---|---|---|
| 003 | rda | ||
| 005 | 20230606144630.0 | ||
| 006 | m|||| o||d| 00| 0 | ||
| 007 | cr |n|||||a | ||
| 008 | 210909t2009 xxu|||| o||d| 00| 0 eng d | ||
| 020 |
_a9780262270830 _qebook |
||
| 040 |
_arda _beng _dIE-GyGMIT _erda |
||
| 100 | 1 |
_aCormen, Thomas H. _eauthor _950334 |
|
| 245 | 1 | 0 |
_aIntroduction to algorithms : _cThomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein _h[electronic book] / |
| 250 | _aThird edition | ||
| 264 | 1 |
_aCambridge, M.A. : _bMIT, _c©2009 |
|
| 300 |
_a1 online resource (xx, 1314 pages) : _bblack and white illustrations ; |
||
| 336 |
_atext _2rdacontent |
||
| 337 |
_acomputer _2rdamedia |
||
| 338 |
_aonline resource _2rdacarrier |
||
| 504 | _aIncludes bibliographic references and index | ||
| 506 | _aRestricted to GMIT Library patrons | ||
| 520 | _aThe latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow. The 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 | ||
| 533 |
_aeBook, _nAvailable via GMIT Library webpage |
||
| 540 | _aSubject to print download restrictions | ||
| 650 | 0 |
_aAlgorithms _92937 |
|
| 650 | 0 |
_aComputer programming _911634 |
|
| 700 | 1 |
_aLeiserson, Charles E. _eauthor |
|
| 700 | 1 |
_aRivest, Ronald L. _eauthor |
|
| 700 | 1 |
_aStein, Clifford, _eauthor _950337 |
|
| 710 | 2 |
_aProQuest (Firm) _edistributor _946470 |
|
| 856 | 4 | 0 |
_uhttps://ebookcentral.proquest.com/lib/atu/detail.action?docID=3339142 _yClick here to access eBook |
| 938 |
_aProquest Ebook Central _c1-User |
||
| 942 | _2ddc | ||
| 960 |
_aGA_ELE _b1 _j€154.50 _lGA_SE42 _m03/09/2021 _q08/09/2021 _vProquest Ebook Central _z7030 |
||
| 998 | _cPCM | ||
| 999 |
_c274821 _d274821 |
||