|
|
Sold Out
Book Categories |
SEQUENTIAL ALGORITHMS
Arithmetic Complexity
Solving Recurrence Relations
Complexity of Data Processing Problems
Complexity and Difficult Combinatorial Problems
Complexity and Theorem Proving by Machine
Classifying the Computational Complexity of Problems
The Theory of Computational Complexity
PARALLEL ALGORITHMS
The Root-Finding Algorithms for a Non-linear Function
Iterative Parallel Algorithms
Synchronized Matrix Multiplication Algorithms
The Parallel FFT Algorithm
Parallel Comparison Sorts
Parallel Graph Search and Traversal
Index
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Darrrell Robin
reviewed Computational complexity of sequential and parallel algorithms on May 16, 2015
Computational complexity of sequential and parallel algorithms
I read the PDF version of the book freely available at .
Tony Hoare's writing is a pleasure to read. I picked up this book after reading his chapter in "Structured Programmin" and his paper "Hints on Programming Language Design" ( ). "Communicating Sequential Processes" definitely deserves to be a classic, and I am still somewhat surprised when I meet programmers who aren't familiar with either the book or its subject matter.
Hoare's Microsoft Research page has some interesting documents ( ).
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Computational complexity of sequential and parallel algorithms
X
This Item is in Your Inventory
Computational complexity of sequential and parallel algorithms
X
You must be logged in to review the productsX
X
X
Add Computational complexity of sequential and parallel algorithms, Presents a concise treatment of important results from the theory and application of sequential algorithms and introduces parallel algorithms. Allows the reader to compare, contrast, and appreciate unique features of the computing environment. Presents im, Computational complexity of sequential and parallel algorithms to the inventory that you are selling on WonderClubX
X
Add Computational complexity of sequential and parallel algorithms, Presents a concise treatment of important results from the theory and application of sequential algorithms and introduces parallel algorithms. Allows the reader to compare, contrast, and appreciate unique features of the computing environment. Presents im, Computational complexity of sequential and parallel algorithms to your collection on WonderClub |
