TY  - BOOK
AU  - Akl,Selim G.
TI  - Design and analysis of parallel algorithms
SN  - 0132000563
U1  - 004.35 23
PY  - 1989///
CY  - London
PB  - Prentice-Hall
KW  - Parallel algorithms
KW  - Parallel programming (Computer science)
N1  - Includes bibliographies and indexes; 1. Introduction--
2. Selection--
3. Merging--
4. Sorting--
5. Searching--
6. Generating permutations and combinations--
7. Matrix operations--
8. Numerical problems--
9. Computing fourier transforms--
10. Graph theory--
11. Computational geometry--
12. Traversing combinatorial spaces--
13. Decision and optimization--
14. The bit complexity of parallel computations--
Author index--
Subject index
N2  - A comprehensive exploration of how to design algorithms that exploit the parallelism inherent in the problem to be solved, and how to analyze these algorithms in order to evaluate their speed and cost.
ER  -