18.04.2013 Views

The.Algorithm.Design.Manual.Springer-Verlag.1998

The.Algorithm.Design.Manual.Springer-Verlag.1998

The.Algorithm.Design.Manual.Springer-Verlag.1998

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

<strong>The</strong> <strong>Algorithm</strong> <strong>Design</strong> <strong>Manual</strong><br />

Most professional programmers are not well equipped to tackle algorithm design problems.<br />

"<strong>The</strong> <strong>Algorithm</strong> <strong>Design</strong> <strong>Manual</strong>" by Steve Skiena of SUNY Stony Brook, is uniquely<br />

designed to provide access to combinatorial algorithms technology for computer<br />

professionals and students. Skiena has taken some of the "mystery" out of finding the right<br />

algorithm for the job, by drawing heavily on the author's own real-world experiences. Thus<br />

the work takes on a very practical character, as reflected in its title: "<strong>Manual</strong>". <strong>The</strong> Book is<br />

divided into two parts, the first being a general guide to techniques for the design and<br />

analysis of computer algorithms. <strong>The</strong> second is a reference section, comprising the catalog<br />

of algorithmic resources, implementations, and an extensive bibliography.<br />

<strong>The</strong> primary audience for this book/CD-ROM combination is the working professional<br />

who uses algorithms on a regular or occasional basis and has need for a handy reference. A<br />

major feature of this book is the inclusion of a complete "catalog" of important algorithmic<br />

problems. By browsing this catalog, readers can quickly identify what the problem they<br />

have encountered is called, what is known about it, and how they should proceed if they<br />

need to solve it. Nothing like this catalog exists in the computing literature for general<br />

computer algorithms.<br />

This work can also readily be used as a textbook or course supplement in standard courses<br />

on algorithm design. Pedagogic features include pen-and paper exercises, "team projects",<br />

independent student projects, "take home" lessons (goals) at the beginning of chapters.<br />

Other teaching and learning aids reside on the accompanying CD-ROM. <strong>The</strong> multiplatiform<br />

CD-ROM contains a full hypertext version of the book, with a comprehensive online<br />

index, and all of the code/algorithms residing on the author's web site at Stony Brook<br />

in the "<strong>Algorithm</strong> Repository" there: www.cs.sunysb.edu/~algorith/. URLs for all cited<br />

implementations mirroring the Stony Brook web site and algorthim repository are<br />

included. Also included on the CD-ROM are 10 hours of audio lectures presented by the<br />

author, and series of slides which instructors can use to help teach their courses. <strong>The</strong>re is<br />

additional useful information and updates which are available through accessing the<br />

author's web site.<br />

Table of Contents<br />

Part I Techniques<br />

Chapter 1 Introduction to <strong>Algorithm</strong>s<br />

1.1 Correctness and Efficiency<br />

1.2 Expressing <strong>Algorithm</strong>s<br />

1.3 Keeping Score<br />

http://www.telospub.com/catalog/COMPUTERSCI/<strong>Algorithm</strong>.html (2 of 5) [19/1/2003 2:00:54]

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!