TY  - BOOK
AU  - Berman,Kenneth A.
AU  - Paul,Jerome L.
TI  - Fundamentals of sequential and parallel algorithms
SN  - 0534946747
U1  - 005.1 
PY  - 1997///
CY  - Boston, Mass.
PB  - PWS Pub.
KW  - Computer algorithms
KW  - Parallel processing (Electronic computers)
KW  - Sequential processing (Computer science)
N1  - Includes index; Preface.  - Pseudocode Conventions for Sequential Algorithms.  - 1.  Introduction and Preliminaries.  - 2.  Elementary Data Structures.  - 3.  Design and Analysis of Sequential Algorithms.  - 4.  Sequential Sorting Algorithms and Their Analysis.  - 5.  Introduction to Parallel Algorithms and Architectures.  - 6.  Parallel Sorting.  - 7.  Induction, Correctness Proofs, and Recurrence Relations.  - 8.  Graphs, Diagraphs, and Sets.  - 9.  Probability and Average Complexity of Algorithms.  - 10.  Introduction to Lower Bound Theory.  - 11.  Parallel Prefix, Matrix Multiplication, and Pointer Jumping.  - 12.  The Greedy Method.  - 13.  Divide and Conquer.  - 14.  Dynamic Programming.  - 15.  Backtracking and Branch-and-Bound.  - 16.  Heuristic Search: A*-Search, Game Trees. - 17.  The Dictionary Problem: Hashing and Balanced Trees. - 18.  Probabilistic Algorithms.  - 19.  Graph Algorithms. - 20.  NP-Complete Problems and the Class NC.  - Index
ER  -