The Algorithm Design Manual - Hardcover

Skiena, Steve S.

Hardcover

ISBN 10: 1848000693 ISBN 13: 9781848000698

Verlag: Springer London Ltd, 2008

Inhaltsangabe

<P>THIS NEWLY EXPANDED AND UPDATED SECOND EDITION OF THE BEST-SELLING CLASSIC CONTINUES TO TAKE THE "MYSTERY" OUT OF DESIGNING ALGORITHMS, AND ANALYZING THEIR EFFICACY AND EFFICIENCY. EXPANDING ON THE FIRST EDITION, THE BOOK NOW SERVES AS THE PRIMARY TEXTBOOK OF CHOICE FOR ALGORITHM DESIGN COURSES WHILE MAINTAINING ITS STATUS AS THE PREMIER PRACTICAL REFERENCE GUIDE TO ALGORITHMS FOR PROGRAMMERS, RESEARCHERS, AND STUDENTS.</P>THE READER-FRIENDLY <I><B>ALGORITHM DESIGN MANUAL</B></I> PROVIDES STRAIGHTFORWARD ACCESS TO COMBINATORIAL ALGORITHMS TECHNOLOGY, STRESSING DESIGN OVER ANALYSIS. THE FIRST PART, <I>TECHNIQUES</I>, PROVIDES ACCESSIBLE INSTRUCTION ON METHODS FOR DESIGNING AND ANALYZING COMPUTER ALGORITHMS. THE SECOND PART, <I>RESOURCES</I>, IS INTENDED FOR BROWSING AND REFERENCE, AND COMPRISES THE CATALOG OF ALGORITHMIC RESOURCES, IMPLEMENTATIONS AND AN EXTENSIVE BIBLIOGRAPHY.<P></P><P></P><B>NEW</B> TO THE SECOND EDITION:<P></P><P>· <B>DOUBLES THE TUTORIAL MATERIAL AND EXERCISES</B> OVER THE FIRST EDITION</P><P>· PROVIDES <B>FULL ONLINE SUPPORT</B> FOR LECTURERS, AND A <B>COMPLETELY UPDATED AND IMPROVED</B> WEBSITE COMPONENT WITH LECTURE SLIDES, AUDIO AND VIDEO</P>· CONTAINS A<B> UNIQUE CATALOG</B> IDENTIFYING THE 75 ALGORITHMIC PROBLEMS THAT ARISE MOST OFTEN IN PRACTICE, LEADING THE READER DOWN THE RIGHT PATH TO SOLVE THEM<P></P><P>· INCLUDES SEVERAL <B>NEW</B> "WAR STORIES" RELATING EXPERIENCES FROM <B>REAL-WORLD APPLICATIONS</B></P><B>·</B> PROVIDES UP-TO-DATE LINKS LEADING TO THE VERY BEST ALGORITHM <I><B>IMPLEMENTATIONS</B></I> AVAILABLE IN C, C++, AND JAVA<P></P>

Über diesen Titel

Críticas

From the reviews of the second edition:

“This is detailed and timeless book that I keep reaching for. A useful book that I can not keep access to long enough. It is a important book to have in your library. Unlike other algorithm books that I have the algorithms are written independent of any programming language.” (Mary Anne, Cats and Dogs with Data, maryannedata.com, April, 2014)

“The Algorithm Design Manual by Steven Skiena is aimed at two groups of people: students and professionals. ... It is written in an informal style that I found pleasant and engaging. ... The book’s unique structure makes it more likely to be immediately useful to the practitioner who has problem to solve and wants to quickly make progress ... . the book succeeds admirably. ... would be helpful to the student who has never seen this material before. ... Overall, I recommend this book warmly.” (Neelakantan Kartha, The Book Review Column, 2011)

“Algorithms are the very heart of computing ... . This book is about right for most people. ... Each of the topics is treated in a readable informal style with lots of asides and accounts of personal experiences - ‘war stories’ in implementing algorithms. ... If you want to use it as a course textbook then there are lots of exercises at the end of every chapter. Highly recommended.” (Mike James, I Programmer, September, 2009)

"Addressing the main difficulties of solving problems, this book goes far beyond the design of algorithms. It is essential for scientists, engineers, and any professionals who aim to solve problems, with a noticeable emphasis on real problems. It will not only serve as a valuable undergraduate textbook, but it will also become an irreplaceable reference guide for most professionals in the area." (Carlos Linares Lopez, Computing Reviews, February, 2009)

"Skiena focuses on the practical aspects of algorithm design and use. ... this work fills an important gap in the knowledge of CS practitioners and students. ... this book is suitable as a text for an undergraduate algorithms class, but also as an invaluable reference for the practicing programmer. ... This second edition has updated the bibliography to include recent works, making it an extensive bibliography. The index is also thorough and very useful for finding specific problems." (William Fahle, ACM Computing Reviews, December, 2008)

"For a decade, Steven Skiena’s Algorithm Design Manual retained its title as the best and most comprehensive practical algorithm guide to help identify and solve problems. It is now available in an improved second edition that is worth buying simply for the updates. ... Every programmer should read this book, and anyone working in the field should keep it close to hand. ... Would I recommend it? Absolutely. This is the best investment ... a programmer or aspiring programmer can make." (Harold Thimbleby, Times Higher Education, November, 2008)

"My absolute favorite for this kind of interview preparation is Steven Skiena’s The Algorithm Design Manual. More than any other book it helped me understand just how astonishingly commonplace ... graph problems are -- they should be part of every working programmer’s toolkit. The book also covers basic data structures and sorting algorithms, which is a nice bonus. ... every 1 – pager has a simple picture, making it easy to remember. This is a great way to learn how to identify hundreds of problem types." (Steve Yegge, Steve Yegge’s Blog, March, 2008)

"...the book is an algorithm implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations, an extensive bibliography ... make the book an invaluable resource for everyone interested in the subject." (ACM Computing Reviews)

Reseña del editor

This newly expanded and updated second edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficacy and efficiency. Expanding on the first edition, the book now serves as the primary textbook of choice for algorithm design courses while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students.

The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques, provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, Resources, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography.

NEW to the second edition:

· Doubles the tutorial material and exercises over the first edition

· Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video

· Contains a unique catalog identifying the 75 algorithmic problems that arise most often in practice, leading the reader down the right path to solve them

· Includes several NEW "war stories" relating experiences from real-world applications

· Provides up-to-date links leading to the very best algorithm implementations available in C, C++, and Java

Details zur Ausgabe

• Verlag: Springer London Ltd
• Erscheinungsdatum: 2008
• ISBN 10: 1848000693
• ISBN 13: 9781848000698
• Einband: Tapa dura
• Sprache: Englisch
• Auflage: 2
• Anzahl der Seiten: 730