LOW FLAT RATE AUST-WIDE $9.90 DELIVERY INFO

Close Notification

Your cart does not contain any items

$87.95

Paperback

Not in-store but you can order this
How long will it take?

QTY:

English
Cambridge University Press
02 April 1990
This largely self-contained text is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelism, that presumes no special knowledge of parallel computers or particular mathematics.

The book emphasizes designing algorithms within the timeless and abstracted context of a high-level programming language rather than within highly specific computer architectures.

This is an approach that concentrates on the essence of algorithmic theory, determining and taking advantage of the inherently parallel nature of certain types of problems.

The authors present regularly-used techniques and a range of algorithms including some of the more celebrated ones.

Nonspecialists considering entering the field of parallel algorithms, as well as advanced undergraduate or postgraduate students of computer science and mathematics will find this book helpful.
By:   , ,
Imprint:   Cambridge University Press
Country of Publication:   United Kingdom
Dimensions:   Height: 235mm,  Width: 191mm,  Spine: 14mm
Weight:   500g
ISBN:   9780521388412
ISBN 10:   0521388414
Pages:   268
Publication Date:  
Audience:   Professional and scholarly ,  College/higher education ,  Undergraduate ,  Primary
Format:   Paperback
Publisher's Status:   Active

Reviews for Efficient Parallel Algorithms

...a coherent introduction for all those who wish to enter this new field of research...a valuable contribution to the expository literature and will certainly become a favoured introduction to the field of parallel algorithms. Mathematical Reviews Highly recommended. Choice ...a successful introduction to the area of parallel algorithms and to methods for parallelisation. N. I. Yanev, Mathematical Reviews


See Also