Description: Algorithms: Sequential, Parallel, and Distributed (Kenneth A. Berman and Jerome L. Paul, 2005, Thomson). Used computer science textbook, originally from the University of Cincinnati. Some wear on corners and spine, and minor pencil marks here and there. Publisher's description: 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.
Price: 50 USD
Location: Cincinnati, Ohio
End Time: 2024-09-08T20:00:24.000Z
Shipping Cost: 6.88 USD
Product Images
Item Specifics
All returns accepted: ReturnsNotAccepted
Item Length: 9.4in.
Item Height: 1.7in.
Item Width: 7.6in.
Author: Kenneth A. Berman, Jerome L. Paul
Publication Name: Algorithms : Sequential, Parallel, and Distributed
Format: Hardcover
Language: English
Publisher: Course Technology
Publication Year: 2004
Type: Textbook
Item Weight: 26.5 Oz
Number of Pages: 996 Pages
