Algorithm Design

Foundations, Analysis, and Internet Examples

Michael T. Goodrich, Roberto Tamassia

708 pages, parution le 02/11/2001

Ajouter à une liste

Indisponible

Résumé

Are you looking for something different in your Algorithms text? Are you looking for an Algorithms text that offers theoretical analysis techniques as well as design patterns and experimental methods for the engineering of algorithms? Michael Goodrich and Roberto Tamassia, authors of the successful, Data Structures and Algorithms in Java, 2/e, have written Algorithm Design, a text designed to provide a comprehensive introduction to the design, implementation and analysis of computer algorithms and data structures from a modern perspective.

Written for an undergraduate, junior-senior algorithms course this text offers several implementation case studies and uses Internet applications to motivate many topics such as hashing, sorting and searching.

Contents

Fundamental Tools

Algoritm analysis
Basic data structures
Search trees and skip lists
Sorting, sets, and selection
Fundamental techniques

Graph Algorithms

Graphs
Weighted graphs
Network flow and matching

Internet Algorithmics

Text processing
Number Theory and cryptography
Network Algorithms

Additional Topics

Computational geometry
NP-Completeness
Algorithmic frameworks
Useful mathematical facts
Bibliography
Index

L'auteur - Michael T. Goodrich

Michael Goodrich received his Ph.D. in Computer Science from Purdue University in 1987. He is currently a professor in the Department of Computer Science at University of California, Irvine. Previously, he was a professor at Johns Hopkins University. He is an editor for the International Journal of Computational Geometry & Applications and Journal of Graph Algorithms and Applications.

L'auteur - Roberto Tamassia

Roberto Tamassia received his Ph.D. in Electrical and Computer Engineering from the University of Illinois at Urbana-Champaign in 1988. He is currently a professor in the Department of Computer Science at Brown University. He is editor-in-chief for the Journal of Graph Algorithms and Applications and an editor for Computational Geometry: Theory and Applications. he previously served on the editorial board of IEEE Transactions on Computers.

Caractéristiques techniques

	PAPIER
Éditeur(s)	Wiley
Auteur(s)	Michael T. Goodrich, Roberto Tamassia
Parution	02/11/2001
Nb. de pages	708
Format	18,7 x 23,3
Couverture	Broché
Poids	1073g
Intérieur	Noir et Blanc
EAN13	9780471383659
ISBN13	978-0-471-38365-9