Algorithm Design: Foundations, Analysis, and Internet Examples

Front Cover
John Wiley & Sons, Oct 15, 2001 - Computers - 720 pages

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.

 

Selected pages

Contents

Basic Data Structures
55
Search Trees and Skip Lists
139
Sorting Sets and Selection
217
Fundamental Techniques
257
II
285
Weighted Graphs
339
5
373
1
381
5
447
Network Algorithms
511
IV
545
NPCompleteness
591
Algorithmic Frameworks
643
A Useful Mathematical Facts
685
Index
698
Copyright

Text Processing
417

Other editions - View all

Algorithm Design: Foundations, Analysis, and Internet Examples
Michael T. Goodrich,Roberto Tamassia
Snippet view - 2002
Algorithm Design: Foundations, Analysis and Internet Examples
Michael T. Goodrich,Roberto Tamassia
No preview available - 2002
Algorithm Design: Foundation, Analysis and Internet Examples
Michael T. Goodrich,Roberto Tamassia
No preview available - 2006

Common terms and phrases

amortized analysis array assume augmenting path AVL tree binary search tree binary tree Boolean bucket array cache Code Fragment component compute configuration constant cyber-dollars cycle data structure define denote Describe dictionary directed graph divide-and-conquer edges efficient example external node Figure flow f given graph G hash function heap implementation input insertion integer internal iteration Java knapsack Lemma matrix memory merge-sort method minimum spanning tree NP-complete number of elements O(logn objects operation optimal output pair pattern matching perform points polynomial position priority queue problem processors Proof pseudo-code quick-sort random recurrence equation red-black tree remove rithm root router running Section sequence shortest path simple skip list solve sorting algorithm splay tree splaying stack stored string subproblem subtree takes technique Theorem traversal trie update variable vector vertex vertices weight worst-case

About the author (2001)

Michael T. Goodrich is a mathematician and computer scientist. He is a Chancellor's Professor and the chair of Department of Computer Science, of Donald Bren School of Information and Computer Sciences, a school of University of California, Irvine. Roberto Tamassia is the author of Algorithm Design: Foundations, Analysis, and Internet Examples, published by Wiley.

Bibliographic information

TitleAlgorithm Design: Foundations, Analysis, and Internet Examples
AuthorsMichael T. Goodrich, Roberto Tamassia
Editionillustrated
PublisherJohn Wiley & Sons, 2001
ISBN0471383651, 9780471383659
Length720 pages
Subjects ›  › 

Computers / Languages / C
Computers / Programming / General
  
Export CitationBiBTeX EndNote RefMan