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.
FREE Two-Day Shipping for Students. Learn more |
| |||||||||||||||
Book Description
Editorial Reviews
Review
"...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
"Highly recommended." Choice
"...a successful introduction to the area of parallel algorithms and to methods for parallelisation." N. I. Yanev, Mathematical Reviews
Book Description
Regularly-used techniques and a range of algorithms, including some of the more celebrated ones, are presented in an approach concentrating on the essence of algorithmic theory, and determining the inherently parallel nature of certain types of problems.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
Browse and search another edition of this book.
Browse and search another edition of this book.
First Sentence:
This chapter is concerned with computational problems in graph theory. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
partial syntactic trees, constant bounded size, pebbled nodes, uncoloured edges, optimal parallel algorithm, standard doubling technique, binary dag, optimal colouring, bitonic merge, outerplanar graphs, binary tree method, pth cell, good sampler, bracket languages, pebble game, tour technique, biconnected components, traversal list, aperiodic case, bad interval, polylogarithmic time, recursive doubling, root bag, prefix computation, operation activate Key Phrases - Capitalized Phrases (CAPs): (learn more)
Information Processing Letters, Journal of Computing, Proof Let, Lecture Notes, Journal of Algorithms, Automata Theory New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
This chapter is concerned with computational problems in graph theory. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
partial syntactic trees, constant bounded size, pebbled nodes, uncoloured edges, optimal parallel algorithm, standard doubling technique, binary dag, optimal colouring, bitonic merge, outerplanar graphs, binary tree method, pth cell, good sampler, bracket languages, pebble game, tour technique, biconnected components, traversal list, aperiodic case, bad interval, polylogarithmic time, recursive doubling, root bag, prefix computation, operation activate Key Phrases - Capitalized Phrases (CAPs): (learn more)
Information Processing Letters, Journal of Computing, Proof Let, Lecture Notes, Journal of Algorithms, Automata Theory New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 7
books:
See all 7 books this book cites
51
books
cite this book:
See all 51 books citing this book
- Combinatorial Algorithms on Words (Nato Asi Series, Advanced Science Institutes Series, Series F, Computer and Systems Sciences, Vol 12) by Alberto Apostolico on page 141, and page 179
- The Design and Analysis of Computer Algorithms by Alfred V. Aho in Front Matter, and page 255
- Algorithmic Graph Theory by Alan Gibbons on page 86, and page 255
- Foundations of Computer Science: C Edition (Principles of Computer Science Series) by Alfred V. Aho in Front Matter
- Computer Science: A Modern Introduction (Prentice-Hall International Series in Computer Science) by Les Goldschlager on page 255
See all 7 books this book cites
- Lectures in Parallel Computation (Cambridge International Series on Parallel Computation) by Alan Gibbons on 7 pages
- PARLE '91. Parallel Architectures and Languages Europe: Volume I: Parallel Architectures and Algorithms. Eindhoven, The Netherlands, June 10-13, 1991. Proceedings (Lecture Notes in Computer Science) by Emile H.L. Aarts on page 303, and page 320
- Graph-Theoretic Concepts in Computer Science: 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16 - 18, 1993. Proceedings (Lecture Notes in Computer Science) by Jan van Leeuwen on page 19, and page 236
- Algorithms (SIGAL '90 Proceedings #450) by Tetsuo Asano on page 326, and page 467
- Algorithms and Data Structures: 2nd Workshop, WADS '91, Ottawa, Canada, August 14-16, 1991. Proceedings (Lecture Notes in Computer Science) by Frank Dehne on page 76, and page 104
See all 51 books citing this book
Books on Related Topics
(learn more)
|
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product).
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
