Algorithms: Sequential, Parallel, and Distributed

By Kenneth A. Berman and Jerome L. Paul

996 pages
Publisher: Course Technology; 1 edition (October 11, 2004)
Language: English
ISBN-10: 0534420575
ISBN-13:978-0534420574




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.