You are viewing content intended for a different location. This may affect your ability to shop online.

Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links


Efficient Parallel Algorithms

Efficient Parallel Algorithms

Efficient Parallel Algorithms

Authors:
Alan Gibbons, University of Warwick
Wojciech Rytter, Uniwersytet Warszawski, Poland
Published:
February 1990
Availability:
Available
Format:
Paperback
ISBN:
9780521388412

Looking for an inspection copy?

This title is not currently available for inspection.

£50.00 GBP
Paperback

    This is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelisation. It is self-contained and presumes no special knowledge of parallel computers or particular mathematics. The book emphasises 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 which concentrates on the essence of algorithmic theory, determining and taking advantage of the inherently parallel nature of certain types of problem. The authors present regularly-used techniques and a range of algorithms which includes some of the more celebrated and well-known. Efficient Parallel Algorithms is targeted at non-specialists who are considering entering the field of parallel algorithms. It will be particularly useful for courses aimed at advanced undergraduate or new postgraduate students of computer science and mathematics.

    Product details

    • Published: February 1990
    • Format: Paperback
    • ISBN: 9780521388412
    • Length: 268 pages
    • Dimensions: 236 × 192 × 23 mm
    • Weight: 0.5kg
    • Availability: Available

    Table of Contents

    • Preface
    • 1. Introduction
    • 2. Graph algorithms
    • 3. Expression evaluation
    • 4. Parallel recognition and parsing of context-free languages
    • 5. Fast parallel sorting
    • 6. Parallel string matching
    • 7. P-completeness: hardly parallelisable problems
    • Index.

    Authors

    Alan Gibbons , King's College London

    Wojciech Rytter , Uniwersytet Warszawski, Poland