Algorithms: Sequential, Parallel, and Distributed

Berman, Kenneth A.; Jerome L. Paul

ISBN 10: 0534420575 / ISBN 13: 9780534420574

Published by Boston, Maassachusetts: Course Technology, a division of Thomson Learning, Inc., 2005

About this Item

First edition. Number line beginning with 1. Near fine hardback. No dust jacket. One leaf has a 2.75 inch by 5/8 inch dog-ear. Minor, if not trivial wear to corners, lower edge of rear cover and tip of spine heel. Only trivial additional signs of age/wear/previous us.

Seller Inventory # 107104

Bibliographic Details

• Title: Algorithms: Sequential, Parallel, and Distributed
• Publisher: Boston, Maassachusetts: Course Technology, a division of Thomson Learning, Inc.
• Publication Date: 2005
• Language: English
• ISBN 10: 0534420575
• ISBN 13: 9780534420574
• Binding: Hardcover
• Edition: 1st Edition
• Condition: Near Fine
• Dust Jacket Condition: No Jacket
• Seller catalogs:
  • Computers
  • Electronics & Technology

About this title

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 the Authors

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.

Jerome L. Paul is a Professor of Computer Science and Engineering at the University of Cincinnati. He was head of UC's Computer Science Department for 10 years, and is currently the director of the Laboratory for Integrated Networked Computing (LINC). He has published over 30 research papers, and has taught both undergraduate and graduate courses in sequential and parallel algorithms for many years.