Normal view MARC view ISBD view

Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest.

By: Cormen, Thomas H.
Contributor(s): Leiserson, Charles Eric | Rivest, Ronald L.
Material type: TextTextSeries: The MIT electrical engineering and computer science series. Publisher: Cambridge, Mass. : New York ; New Delhi : MIT Press ; McGraw-Hill ; Prentice Hall, c1990Description: xvii, 1028 p. : ill. ; 26 cm.ISBN: 0262031418; 9780262031417; 0070131430 (McGrawHill); 9780070131439; 8120313534.Subject(s): Computer programming | Computer algorithmsDDC classification: 005.1 Online resources: WorldCat details
Contents:
Table of contents Growth of functions -- Summations -- Recurrences -- Sets, etc. -- Counting and probability -- 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 -- Arithmetic circuits -- Algorithms for parallel computers -- Matrix operations -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Copy number Status Date due Barcode Item holds Course reserves
Text Text EWU Library
005.1 COI 1990 (Browse shelf) 0 Checked out 25/12/2012 00:00 50-10123
Text Text EWU Library
Reserve Section
Non-fiction 005.1 COI 1990 (Browse shelf) C-1 Not For Loan 7447
Text Text EWU Library
Reserve Section
Non-fiction 005.1 COI 1990 (Browse shelf) C-2 Not For Loan 7448
Text Text EWU Library
Circulation Section
Non-fiction 005.1 COI 1990 (Browse shelf) C-3 Available 10116
Text Text EWU Library
Circulation Section
Non-fiction 005.1 COI 1990 (Browse shelf) C-4 Available 10117
Text Text EWU Library
Circulation Section
Non-fiction 005.1 COI 1990 (Browse shelf) C-5 Available 10118
Text Text EWU Library
Circulation Section
Non-fiction 005.1 COI 1990 (Browse shelf) C-6 Available 10119
Text Text EWU Library
Circulation Section
Non-fiction 005.1 COI 1990 (Browse shelf) C-7 Available 10120
Text Text EWU Library
Circulation Section
Non-fiction 005.1 COI 1990 (Browse shelf) C-8 Available 10121
Text Text EWU Library
Circulation Section
Non-fiction 005.1 COI 1990 (Browse shelf) C-9 Available 10122
Text Text EWU Library
Circulation Section
Non-fiction 005.1 COI 1990 (Browse shelf) C-11 Available 10124
Text Text EWU Library
Circulation Section
Non-fiction 005.1 COI 1990 (Browse shelf) C-12 Available 10125
Text Text EWU Library
Circulation Section
Non-fiction 005.1 COI 1990 (Browse shelf) C-15 Available 10128

Algorithms

Total holds: 0

Online version:
Cormen, Thomas H.
Introduction to algorithms.
Cambridge, Mass. : MIT Press ; New York : McGraw-Hill, c1990
(OCoLC)644122093

Includes bibliographcal references (p. [987]-996) and index.

Table of contents Growth of functions --
Summations --
Recurrences --
Sets, etc. --
Counting and probability --
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 --
Arithmetic circuits --
Algorithms for parallel computers --
Matrix operations --
Polynomials and the FFT --
Number-theoretic algorithms --
String matching --
Computational geometry --
NP-completeness --
Approximation algorithms.

Computer Science & Engineering

There are no comments for this item.

Log in to your account to post a comment.

Library Home | Contacts | E-journals

Last Update on 12 January 2014
Copyright @ 2011-2015 EWU Library
East West University