| 청구기호 |
QA76.6 .C662 1990 |
| 형태사항 |
xvii, 1028 p. : ill. ; 26 cm.
|
| 언어 |
English |
| 서지주기 |
Includes bibliographical references (p. [987]-996) and index.
|
| 내용 |
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.
|
| 주제 |
Electronic digital computers --Programming.
Computer algorithms.
|
| LCCN |
89013027 //r91
|
| ISBN |
0262031418
0070131430
|
