Introduction to algorithms /
Title By: Cormen, Thomas H | Cormen, Thomas H
Material type:
BookPublisher: Cambridge, Mass. : MIT Press, c2009.Edition: 3rd ed.Description: xxi, 1180 p. : ill ; 24 cm.ISBN: 9780262533058; 0262032937 (trade : hc. : alk. paper)Program: CSCI203, CSIT133Other title: Algorithms.Subject(s): Computer programming | Computer algorithms | Computer programming | Computer algorithmsDDC classification: 005.1 Online resources: Location Map
Summary:
Both 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.
| Item type | Home library | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
| REGULAR | University of Wollongong in Dubai Main Collection | 005.1 CO IN (Browse shelf) | Available | T0044371 | ||
| REGULAR | University of Wollongong in Dubai Main Collection | 005.1 CO IN (Browse shelf) | Available | T0020811 |
Total holds: 0
, Shelving location: Main Collection Close shelf browser
|
|
|
|
|
|
|
||
| 005.1 CO AG Agile software development : | 005.1 CO AN Android wireless application development | 005.1 CO BR Brilliant Agile project management : | 005.1 CO IN Introduction to algorithms / | 005.1 CO IN Introduction to algorithms / | 005.1 CO MA Machine learning for hackers / | 005.1 DA AL Algorithms / |
Rev. ed. of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990.
Includes bibliographical references and index.
Both 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.
CSCI203, CSIT133