Normal view MARC view ISBD view

Fundamentals of sequential and parallel algorithms / Kenneth A. Berman and Jerome L. Paul.

By: Berman, Kenneth A.
Contributor(s): Paul, Jerome L.
Publisher: Boston, Mass. : PWS Pub., c1997Description: xxiii, 744 p. : ill. ; 25 cm.ISBN: 0534946747.Other title: Sequential and parallel algorithms.Subject(s): Computer algorithms | Parallel processing (Electronic computers) | Sequential processing (Computer science)DDC classification: 005.1
Contents:
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.
Item type Current location Call number Copy number Status Notes Date due Barcode Remark
Main Collection TU External Storage-LCS
005.1 BER (Browse shelf) 1 Available SOCIT, 546030 1000117035 Please fill up online form at https://taylorslibrary.taylors.edu.my/services/external_storage1

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.