𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Computational Complexity of Sequential and Parallel Algorithms

✍ Scribed by Lydia Kronsjo


Publisher
John Wiley & Sons
Year
1986
Tongue
English
Leaves
232
Series
Wiley Series in Computing
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


This book gives a compact yet comprehensive survey of major results in the computational complexity of sequential algorithms. This is followed by a highly informative introduction to the development of parallel algorithms, with the emphasis on non-numerical algorithms. The material is so selected that the reader in many cases is able to follow the same problem for which both sequential and parallel algorithms are discussed - the simultaneous presentation of sequential and parallel algorithms for solving enabling the reader to apprehend their common and unique features.


πŸ“œ SIMILAR VOLUMES


Algorithms: Sequential, Parallel, and Di
✍ Kenneth A. Berman, Jerome L. Paul πŸ“‚ Library πŸ“… 2004 πŸ› Course Technology 🌐 English

Algorithms: Sequential, Parallel, and Distributed offers in-depth coverage of traditional and current topics in sequential algorithms, as well as a solid introduction to the theory of parallel and distributed algorithms. In light of the emergence of modern computing environments such as parallel com

Fundamentals of Sequential and Parallerl
✍ Kenneth A. Berman, Jerome L. Paul πŸ“‚ Library πŸ“… 1996 πŸ› PWS 🌐 English

Reflecting the increasing importance of parallel algorithms and parallel computer architectures, this text provides in-depth coverage of traditional and current topics in sequential algorithms, as well as a solid foundation in the theory of parallel algorithms.

Algorithms Sequential & Parallel: A Unif
✍ Russ Miller, Laurence Boxer πŸ“‚ Library πŸ“… 2005 🌐 English

With multi-core processors replacing traditional processors and the movement to multiprocessor workstations and servers, parallel computing has moved from a specialty area to the core of computer science. In order to provide efficient and cost-effective solutions to problems, algorithms must be desi