Cambridge, Mass. : MIT Press ; New York : McGraw-Hill, c1990.
xvii, 1028 p. : ill. ; 26 cm.
QA76.6 .C662 1990
Bibliography, etc. Note
Includes bibliographical references (p. -996) and index.
Formatted Contents Note
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.
MIT electrical engineering and computer science series.