Algorithm Design and Applications

Goodrich, Michael T.; Tamassia, Roberto

ISBN 10: 1118335910 / ISBN 13: 9781118335918

Published by Wiley (edition 1), 2014

About this Item

It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Seller Inventory # 1118335910-8-10

Bibliographic Details

• Title: Algorithm Design and Applications
• Publisher: Wiley (edition 1)
• Publication Date: 2014
• Language: English
• ISBN 10: 1118335910
• ISBN 13: 9781118335918
• Binding: Hardcover
• Edition: 1.
• Condition: Very Good

About this title

Synopsis

Introducing a NEW addition to our growing library of computer science titles, Algorithm Design and Applications, by Michael T. Goodrich & Roberto Tamassia! Algorithms is a course required for all computer science majors, with a strong focus on theoretical topics. Students enter the course after gaining hands-on experience with computers, and are expected to learn how algorithms can be applied to a variety of contexts. This new book integrates application with theory.

Goodrich & Tamassia believe that the best way to teach algorithmic topics is to present them in a context that is motivated from applications to uses in society, computer games, computing industry, science, engineering, and the internet. The text teaches students about designing and using algorithms, illustrating connections between topics being taught and their potential applications, increasing engagement. 

About the Author

Michael T. Goodrich received his B.A. in Mathematics and Computer Science from Calvin College in 1983 and his PhD in Computer Sciences from Purdue University in 1987. Dr. Goodrich's research is directed at the design of high performance algorithms and data structures for solving large-scale problems motivated from information assurance and security, the Internet, Bioinformatics, and geometric computing. He has pioneered and led research on efficient solutions to a number of fundamental problems, including sorting, convex hull construction, linear programming, privacy-preserving data access, network traceback, and data authentication.