Algorithm Design
Foundations, Analysis and Internet Examples. International Edition
Wiley (Publisher)
1st Edition
Published on 15. April 2003
Book
Paperback/Softback
XII, 708 pages
978-0-471-42756-8 (ISBN)
Withdrawn from sale
Description
Michael Goodrich and Roberto Tamassia, authors of the successful, Data Structures and Algorithms in Java, 2/e, have written Algorithm Engineering, a text designed to provide a comprehensive introduction to the design, implementation and analysis of computer algorithms and data structures from a modern perspective. This book offers theoretical analysis techniques as well as algorithmic design patterns and experimental methods for the engineering of algorithms.
Market: Computer Scientists; Programmers.
Market: Computer Scientists; Programmers.
More details
Edition
1., Auflage
Language
English
Place of publication
New York
United States
Publishing group
John Wiley and Sons Ltd
Target group
Professional and scholarly
Edition type
New edition
Dimensions
Height: 24.1 cm
Width: 19 cm
Thickness: 26 mm
Weight
1077 gr
ISBN-13
978-0-471-42756-8 (9780471427568)
Schweitzer Classification
Other editions
New editions

Book
10/2001
Wiley
€235.00
Shipment within 10-20 days
Previous edition

Book
10/2001
Wiley
€235.00
Shipment within 10-20 days
Content
PART I: FUNDAMENTAL TOOLS.
Algorithm Analysis.
Basic Data Structures.
Search Trees and Skip Lists.
Sorting, Sets, and Selection.
Fundamental Techniques.
PART II: GRAPH ALGORITHMS.
Graphs.
Weighted Graphs.
Network Flow and Matching.
PART III: INTERNET ALGORITHMICS.
Text Processing.
Number Theory and Cryptograhy.
Network Algorithms.
PART IV: ADDITIONAL TOPICS.
Computational Geometry.
NP-Completeness.
Algorithmic Frameworks.
Appendix: Useful Mathematical Facts.
Bibliography.
Index.
Algorithm Analysis.
Basic Data Structures.
Search Trees and Skip Lists.
Sorting, Sets, and Selection.
Fundamental Techniques.
PART II: GRAPH ALGORITHMS.
Graphs.
Weighted Graphs.
Network Flow and Matching.
PART III: INTERNET ALGORITHMICS.
Text Processing.
Number Theory and Cryptograhy.
Network Algorithms.
PART IV: ADDITIONAL TOPICS.
Computational Geometry.
NP-Completeness.
Algorithmic Frameworks.
Appendix: Useful Mathematical Facts.
Bibliography.
Index.