Algorithm design : foundations, analysis, and Internet examples / Michael T. Goodrich, Roberto Tamassia.

By: Goodrich, Michael T Contributor(s): Tamassia, Roberto, 1960-Material type: Text

TextLanguage: English Publication details: New York : Wiley, c2002. Description: xii, 708 p. : ill. ; 24 cmISBN: 0471383651 (acidfree paper); 9780471383659Subject(s): Computer algorithms | Data structures (Computer science) | AlgorithmesDDC classification: 005.1 LOC classification: QA76.9.A43 | G67 2002Online resources: Publisher description | Table of contents | WorldCat details | Ebook Fulltext

Contents:

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. TOC

Summary: 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 10 )
Title notes ( 6 )
Comments ( 0 )

Holdings
Item type	Current library	Collection	Call number	Copy number	Status	Barcode
E-Book	Dr. S. R. Lasker Library, EWU E-book	Non-fiction	005.1 GOA 2002 (Browse shelf(Opens below))		Not for loan
Text	Dr. S. R. Lasker Library, EWU Reserve Section	Non-fiction	005.1 GOA 2002 (Browse shelf(Opens below))	C-1	Not For Loan	12533
Text	Dr. S. R. Lasker Library, EWU Reserve Section	Non-fiction	005.1 GOA 2002 (Browse shelf(Opens below))	C-2	Not For Loan	12534
Text	Dr. S. R. Lasker Library, EWU Circulation Section	Non-fiction	005.1 GOA 2002 (Browse shelf(Opens below))	C-3	Available	12535
Text	Dr. S. R. Lasker Library, EWU Circulation Section	Non-fiction	005.1 GOA 2002 (Browse shelf(Opens below))	C-4	Available	22001
Text	Dr. S. R. Lasker Library, EWU Circulation Section	Non-fiction	005.1 GOA 2002 (Browse shelf(Opens below))	C-5	Available	22002
Text	Dr. S. R. Lasker Library, EWU		005.1 GOA (Browse shelf(Opens below))	C-6	Available	3427-22165
Text	Dr. S. R. Lasker Library, EWU Circulation Section	Non-fiction	005.1 GOA 2002 (Browse shelf(Opens below))	C-7	Available	22166
Text	Dr. S. R. Lasker Library, EWU Circulation Section	Non-fiction	005.1 GOA 2002 (Browse shelf(Opens below))	C-8	Available	22167
Text	Dr. S. R. Lasker Library, EWU Circulation Section	Non-fiction	005.1 GOA 2002 (Browse shelf(Opens below))	C-9	Available	22168

Total holds: 0

Online version:
Goodrich, Michael T.
Algorithm design.
New York : Wiley, c2002
(OCoLC)681099721

Includes bibliographical references (p. [689]-697) and index.

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. TOC

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.

CSE MPS

Abdul Gani

There are no comments on this title.

to post a comment.