Reviews for Computational complexity of sequential and parallel algorithms

The average rating for Computational complexity of sequential and parallel algorithms based on 2 reviews is 4.5 stars.

Review # 1 was written on 2014-09-07 00:00:00 Tara Hilferty An ALGEBRA for thinking about concurrency and nondeterminism in programs. The foundation of modern designs for communicating between threads. An elegant and enlightening formalism for what you already know if you write multithreaded stuff that works. Feels just like structured programming did in the 70's: that being then the new formalism what you already knew if you wrote single-threaded stuff that really worked. Quoting from the forward by E. W. Dijkstra: "... the computing scientist's main challenge is not to get confused by the complexities of his own making ...". Easier to read if you already have experience writing programs that write programs, but readable even if you flatly ignore all the academic computer science terms like "lambda expression" and "static binding". Most fun if you write the programs suggested in the exercises, of course. Among the top five of my all-time favourite books on programming.

Review # 2 was written on 2015-05-16 00:00:00 Darrrell Robin 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 ( ).