Introduction to Algorithms
By: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest.
Contributors: Leiserson, Charles Eric.; Rivest, Ronald L.
Series: The MIT electrical engineering and computer science series
Publisher: MIT Press; McGraw-Hill
Published: 1999
Place of publication: Cambridge, Mass; New York
Language: eng
Number of pages: 1028
Subjects: Computer programming; Computer algorithms
Notes: Includes bibliographcal references (p. [987]-996) and index.
Table of contents: title: Growth of functions; title: Summations; title: Recurrences; title: Sets, etc.; title: Counting and probability; title: Heapsort; title: Quicksort; title: Sorting in linear time; title: Medians and order statistics; title: Elementary data structures; title: Hash tables; title: Binary search trees; title: Red-black trees; title: Augmenting data structures; title: Dynamic programming; title: Greedy algorithms; title: Amortized analysis; title: B-trees; title: Binomial heaps; title: Fibonacci heaps; title: Data structures for disjoint sets; title: Elementary graph algorithms; title: Minimum spanning trees; title: Single-source shortest paths; title: All-pairs shortest paths; title: Maximum flow; title: Sorting networks; title: Arithmetic circuits; title: Algorithms for parallel computers; title: Matrix operations; title: Polynomials and the FFT; title: Number-theoretic algorithms; title: String matching; title: Computational geometry; title: NP-completeness; title: Approximation algorithms.