The Algorithm Design Manual by Steve S. Skiena

• The Algorithm Design Manual by Steve S. Skiena


• Publisher: Springer; 1st ed. 1998. Corr. 2nd


• printing edition (July 31, 1998) |


• Pages: 504 pages |


• English |


• ISBN: 0387948600 |


• CD img | HTML | 2.23 MB

This volume helps take some of the "mystery" out of identifying and dealing with key algorithms. Drawing heavily on the author's own real-world experiences, the book stresses design and analysis. Coverage is divided into two parts, the first being a general guide to techniques for the design and analysis of computer algorithms. The second is a reference section, which includes a catalog of the 75 most important algorithmic problems. By browsing this catalog, readers can quickly identify what the problem they have encountered is called, what is known about it, and how they should proceed if they need to solve it. This book is ideal for the working professional who uses algorithms on a daily basis and has need for a handy reference. This work can also readily be used in an upper-division course or as a student reference guide. THE ALGORITHM DESIGN MANUAL comes with a CD-ROM that contains: * a complete hypertext version of the full printed book. * the source code and URLs for all cited implementations. * over 30 hours of audio lectures on the design and analysis of algorithms are provided, all keyed to on-line lecture notes.

Review
"...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, and the CD-ROM make the book an invaluable resource for everyone interested in the subject." --ACM Computing Reviews

Problems on Algorithms

• Problems on Algorithms by Ian Parberry


• Publisher: Prentice Hall; (February 8, 1995)


• Pages: 192 pages


• Language: English


• PDF | 2.2MB

Too often the problem sets in standard algorithm texts are composed of small, idiosyncratic units of busy-work and irrelevant questions -- forcing instructors into the time-consuming task of finding or composing additional problems. Designed to fill that gap, this supplement provides an extensive and varied collection of useful, practical problems on the design, analysis, and verification of algorithms.

Download:http://uploadphiles.com/index.php?page=main&id=6906d324&name=Prentice%20Hall%20-%20Problems%20on%20Algorithms.rar

Recent Advances in Algorithms and Combinatorics

• 
  Recent Advances in Algorithms and Combinatorics by Bruce A. Reed & Claudia L. Sales
  Springer

"Combinatorics is one of the fastest growing fields of mathematics. … From the table of contents one can see the wide range of topics covered. The authors are acknowledged researchers of the presented fields and guarantee the high quality of the volume. If you want to be up-to-date in combinatorics you should have this volume close to your hands." (Péter Hajnal, Acta Scientarium Mathematicarum, Vol. 69, 2003)

"This edited volume contains nine carefully written chapters in the area of combinatorics. … The book is very well written and can be read individually by research students. The volume is of definite interest for researchers in combinatorics, graph theory and theoretical computer science. This book is certainly value for money and I would highly recommend it as an essential purchase for a university library." (G. Gutin, Journal of the Operational Research Society, Vol. 55 (5), 2004)

Combinatorics is one of the fastest growing fields of mathematics. One reason for this is because many practical problems can be modeled and then efficiently solved using combinator combinatorial theory. This real world motivation for studying algorithmic combinatorics has led not only to the development of many software packages but also to some beautiful mathematics which has no direct application to applied problems. This book highlights a few of the exciting recent developments in algorithmic combinatorics, including the search for patterns in DNA and protein sequences, the theory of semi-definite programming and its role in combinatorial optimization, and the algorithmic aspects of tree decompositions and it's applications to the theory of databases, code optimization, and bioinformatics. Claudia Linhares-Sales is Assistant Professor of Computer Science at the Federal University of Cearß, Brazil. Bruce Reed is Canada Research Chair in Graph Theory at the School of of Computer Science of McGill University.

Highlights a few of the exciting recent developments in algorithmic combinatorics, including the search for patterns in DNA and protein sequences, code optimization, theory of databases, and bioinformatics.

Download:http://rapidshare.com/files/47348077/raiaac.rar

Pass: AvaxHome.org