menu
{ "item_title" : "Efficient Parallel Algorithms", "item_author" : [" Alan Gibbons", "Wojciech Rytter "], "item_description" : "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.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/0/52/138/841/0521388414_b.jpg", "price_data" : { "retail_price" : "62.99", "online_price" : "62.99", "our_price" : "62.99", "club_price" : "62.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Efficient Parallel Algorithms|Alan Gibbons

Efficient Parallel Algorithms

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9780521388412
  • ISBN-10: 0521388414
  • Publisher: Cambridge University Press
  • Publish Date: November 1989
  • Dimensions: 9.26 x 7.54 x 0.64 inches
  • Shipping Weight: 1.05 pounds
  • Page Count: 268

Related Categories

You May Also Like...

    1

BAM Customer Reviews