Skip to content
Register Sign in Wishlist
Look Inside Efficient Parallel Algorithms

Efficient Parallel Algorithms


  • Date Published: February 1990
  • availability: Available
  • format: Paperback
  • isbn: 9780521388412

£ 39.99

Add to cart Add to wishlist

Looking for an inspection copy?

This title is not currently available on inspection

Product filter button
About the Authors
  • 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.

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: February 1990
    • format: Paperback
    • isbn: 9780521388412
    • length: 268 pages
    • dimensions: 235 x 191 x 14 mm
    • weight: 0.47kg
    • availability: Available
  • Table of Contents

    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

  • Authors

    Alan Gibbons, King's College London

    Wojciech Rytter, Uniwersytet Warszawski, Poland

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.