Reviews for Algorithms and Data Structures

The average rating for Algorithms and Data Structures based on 2 reviews is 4 stars.

Review # 1 was written on 2015-02-07 00:00:00 Bruce Batch Some of the eminently practical things theoretical computer scientists did before quantum computing became a popular research topic. Includes, among other things, an all-pairs shortest path algorithm that requires O((log n)2) time and O(n3/log n) processors, and parallel matching of strings to context-free and regular grammars. I was surprised that NATO sponsored research into combinatorial algorithms on words - why would they need it? In reality, the world is hierarchical, and so are parallel computers (and so is memory in sequential computers); the shortest route between some place in Boston and some place in Seattle inevitably includes the I-90, which goes from Boston (in general) to Seattle (in general); the computation of the route from some place in Boston to the I-90 and from the I-90 to some place to Seattle can be done in parallel. This is probably too complicated, however, to cover in such a short book, if it was ever a research topic.

Review # 2 was written on 2016-04-12 00:00:00 Mike Westen Good