If you liked Cascading divide-and-conquer: a technique for designing parallel algorithms by Mikhail J. Atallah, start with Algorithms and Theory of Computation Handbook, Volume 2 Vol. 2 (2009), Algorithms and theory of computation handbook (2009), and Algorithms and Theory of Computation Handbook, Second Edition, Volume 1 (2010). These recommendations are drawn from the same author, shared genres, and reader overlap on BookOrb.

Back to Cascading divide-and-conquer: a technique for designing parallel algorithms · Mikhail J. Atallah books in order

Recommended next reads

  1. 1 Algorithms and Theory of Computation Handbook, Volume 2 Vol. 2 2009 · 950 pages · Mikhail J. Atallah, Marina Blanton · Same author
  2. 2 Algorithms and theory of computation handbook 2009 · 988 pages · Mikhail J. Atallah, Marina Blanton · Same author
  3. 3 Algorithms and Theory of Computation Handbook, Second Edition, Volume 1 2010 · 990 pages · Mikhail J. Atallah · Same author
  4. 4 Algorithms and Theory of Computation Handbook, Second Edition, Volume 2 2010 · 952 pages · Mikhail J. Atallah · Same author
  5. 5 Algorithms and Theory of Computation Handbook, Volume 1 2017 · 988 pages · Mikhail J. Atallah, Marina Blanton · Same author
  6. 6 Algorithms and Theory of Computation Handbook - 2 Volume Set 2020 · 1,944 pages · Mikhail J. Atallah, Marina Blanton · Same author
  7. 7 Algorithms and Theory of Computation Handbook Volume 2 2009 · 950 pages · Mikhail J. Atallah, Marina Blanton · Same author

Frequently asked questions

What should I read after Cascading divide-and-conquer: a technique for designing parallel algorithms?

BookOrb recommends Algorithms and Theory of Computation Handbook, Volume 2 Vol. 2 (2009), Algorithms and theory of computation handbook (2009), Algorithms and Theory of Computation Handbook, Second Edition, Volume 1 (2010), Algorithms and Theory of Computation Handbook, Second Edition, Volume 2 (2010), and Algorithms and Theory of Computation Handbook, Volume 1 (2017).

Are there books like Cascading divide-and-conquer: a technique for designing parallel algorithms?

Yes. The list on this page is ranked from the closest matches BookOrb has for Cascading divide-and-conquer: a technique for designing parallel algorithms.

Who wrote Cascading divide-and-conquer: a technique for designing parallel algorithms?

Cascading divide-and-conquer: a technique for designing parallel algorithms is by Mikhail J. Atallah.