Professors Berman and Paul give students a comprehensive tool kit of sequential and parallel algorithms, plus a set of mathematical techniques for assessing the performance and correctness of algorithms. Their balanced, integrated presentation of sequential and parallel algorithms helps students gain a more intuitive ability to select appropriate algorithms from a variety of alternatives. The authors determine worst, best, and average running times for the algorithms covered. For both Parallel Random Access Machines and interconnection network models, they present algorithms in parallel pseudocode.
"synopsis" may belong to another edition of this title.
About the Author:
Kenneth A. Berman is a Professor of Computer Science and Engineering at the University of Cincinnati. He is a co-director of the Laboratory for Networks and Applied Graph Theory and coordinator of the UC research group Internet Computing and Information Science. He has published over 50 research papers, and has taught both undergraduate and graduate courses in networks and algorithms for many years.
"About this title" may belong to another edition of this title.
- PublisherCourse Technology
- Publication date1996
- ISBN 10 0534946747
- ISBN 13 9780534946746
- BindingHardcover
- Edition number1
- Number of pages744