Introduction to algorithms / Thomas H. Cormen ... [et al.].

Contributor(s): Material type: TextPublication details: Cambridge, Mass. : MIT Press, c2001.Edition: 2nd edDescription: xxi, 1180 p. ; 24 cmISBN:
  • 0262032937 (hc. : alk. paper)
  • 9780262032933 (hc. : alk. paper)
  • 0070131511 (McGraw-Hill)
  • 9780070131514 (McGraw-Hill)
  • 0262531968
  • 9780262531962
Other title:
  • Algorithms
Subject(s): LOC classification:
  • QA 76.6 .C662 2004
Contents:
The role of algorithms in computing -- Getting started -- Growth of functions -- Recurrences -- Probabilistic analysis and randomized algortihms -- 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 -- Matrix operations-- Linear programming -- Polynomials and the FFT -- Number-theoretic algortihsm -- String matching-- Computational geometry -- NP-completeness -- approximation algorithms -- A. summations -- B. Sets, etc. -- C. Counting and probability.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Barcode
Book Storms Research Center Main Collection QA 76.6 .C662 2004 (Browse shelf(Opens below)) Available 98639841

Rev. ed. of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990.

Includes bibliographical references (p. [1127]-1130) and index.

The role of algorithms in computing -- Getting started -- Growth of functions -- Recurrences -- Probabilistic analysis and randomized algortihms -- 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 -- Matrix operations-- Linear programming -- Polynomials and the FFT -- Number-theoretic algortihsm -- String matching-- Computational geometry -- NP-completeness -- approximation algorithms -- A. summations -- B. Sets, etc. -- C. Counting and probability.

There are no comments on this title.

to post a comment.