Algorithms: Sequential, Parallel, and Distributed - Hardcover

Berman, Kenneth A.; Paul, Jerome L.

Hardcover

ISBN 10: 0534420575 ISBN 13: 9780534420574

Publisher: Course Technology, 2004

Synopsis

Algorithms: Sequential, Parallel, and Distributed offers in-depth coverage of traditional and current topics in sequential algorithms, as well as a solid introduction to the theory of parallel and distributed algorithms. In light of the emergence of modern computing environments such as parallel computers, the Internet, and cluster and grid computing, it is important that computer science students be exposed to algorithms that exploit these technologies. Berman and Paul's text will teach students how to create new algorithms or modify existing algorithms, thereby enhancing students' ability to think independently.

About 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 edition

• Publisher: Course Technology
• Publication date: 2004
• ISBN 10: 0534420575
• ISBN 13: 9780534420574
• Binding: Hardcover
• Edition number: 1
• Number of pages: 996