算法书推荐（转）

                        算法书推荐（转）

 

The Best Books on Algorithmics
by Christoph Koegl, Theoretical computer scientist

===============================

1.

The Design and Analysis of Computer Algorithms (Addison-Wesley Series in
Computer Science and Information Processing)
by Alfred V. Aho, et al (Hardcover - June 1974)

Christoph Koegl's comments:
This book still rules. I use it as a reference all the time. Still one of the
few good advanced algorithms books out there.

2.

Parallel Computation: Models and Methods
by Selim G. Akl (Textbook Binding)

Christoph Koegl's comments:
Possibly the best book on parallel algorithms. Takes a paradigm-oriented
approach. Can't believe it's out of print, shame on Prentice Hall!

3.

Complexity and Approximation: Combinatorial Optimization Problems and Their
Approximability Properties
by G. Ausiello, et al (Hardcover - August 1999)

Christoph Koegl's comments:
The current bible on approximation algorithms and approximability properties of
problems.

4.

Analysis of Algorithms and Data Structures (International Computer Science
Series)
by Lech Banachowski, et al (Hardcover - June 1991)

Christoph Koegl's comments:
Quite advanced book on analysis techniques. Digs deeper (and is more
mathematical) than most algorithm books. Sadly, it's out of print.

5.

Fundamentals of Algorithmics
by Gilles Brassard, et al (Hardcover)

Christoph Koegl's comments:
One of the must-haves in the field. Takes a paradigm-oriented approach. Never
mind the negative reviews, these guys are just lame whiners who did not get
it ...

6.

Introduction to Algorithms (MIT Electrical Engineering and Computer Science)
by Thomas H. Cormen, et al (Hardcover)

Christoph Koegl's comments:
Held in high regard worldwide and deservedly so. Concentrates on the most often
used parts of practical algorithmics and explains everything very carefully.
Enlightening diagrams.

7.

Algorithms on Strings, Trees, and Sequences: Computer Science and Computational
Biology
by Dan Gusfield (Hardcover)

Christoph Koegl's comments:
Here it is, the bible on stringology! Not the first book on the topic but the
most carefully written. Very readable, quite advanced in places. Great for
computational biologists.

8.

Analysis of Algorithms : Computational Methods & Mathematical Tools
by Micha Hofri (Hardcover - October 1995)

Christoph Koegl's comments:
One of the most advanced books on algorithm analysis on the market. Get it if
you profited from the Sedgewick/Flajolet book.

9.

The Art of Computer Programming, Volumes 1-3 Boxed Set
by Donald Ervin Knuth, Donald E. Knuth (Hardcover - October 1998)

Christoph Koegl's comments:
For readers who are not deterred by a thoroughly mathematical approach.
Contains a wealth of information. For many topics this is the only reliable
reference.

10.

Combinatorial Algorithms : Generation, Enumeration, and Search (Discrete
Mathematics and Its Applications)
by Donald L. Kreher, Douglas R. Stinson (Hardcover - December 1998)

Refreshingly different. Concentrates on topics not often seen (combinatorial
generation, optimization methods, permutation groups, graph isomorphism).

11.

Randomized Algorithms
by Rajeev Motwani, Prabhakar Raghavan (Hardcover - June 1995)

Christoph Koegl's comments:
Very informative book on randomized algorithmics. Treats a broad range of
subjects, lots of interesting exercises.

12.

Purely Functional Data Structures
by Chris Okasaki (Paperback)

Christoph Koegl's comments:
Missing a serious book on algorithms using functional programming? Buy this
one! It's not encyclopaedic but makes an interesting read. And it's really
cheap!

13.

Analysis of Algorithms
by Paul S., Jr. Purdom, et al (Hardcover - June 1997)

Christoph Koegl's comments:
Virtually unknown but a real gem! Treats evaluation of sums and products,
solution of (systems of) recurrences, asymptotics etc. Leaves a big hole in
your wallet, though.

14.

Compared to What? : An Introduction to the Analysis of Algorithms
by Gregory J. E. Rawlins (Hardcover - December 1991)

Christoph Koegl's comments:
Great book, very interesting introduction to algorithmics. Favouring
didactics over completeness, this book especially appeals to students. Not
pricewise, though.

15.

An Introduction to the Analysis of Algorithms
by Robert Sedgewick, et al (Hardcover - June 1996)

Christoph Koegl's comments:
Its title sounds like that of dozens of other books but do not be mislead: This
is an authoritative work on the mathematics underlying modern analysis
techniques.

16.

Data Structures and Their Algorithms
by Harry R. Lewis, Larry Denenberg (Hardcover - January 1997)

Christoph Koegl's comments:
Of the many books with like title let me single out this one as possibly the
best generally readable introduction to the field. Many good exercises.

17.

Algorithms : A Functional Programming Approach
by Guy Lapalme, Fethi Rabhi (Paperback - August 1999)

Christoph Koegl's comments:
The only good introductory text on functional programming algorithmics. Kudos
to the authors!

18.

How to Solve It : Modern Heuristics
by Zbigniew Michalewicz, David B. Fogel (Hardcover - December 1999)

Christoph Koegl's comments:
Seminal work on heuristic solution methods. Deserves to be read by any
serious computer scientist working algorithmically.

19.

Graphs, Networks & Algorithms
by Dieter Jungnickel, E. Becker (Editor) (Paperback)

Christoph Koegl's comments:
My favourite book on graph algorithms, suitable also for beginners. All
important subjects are there, complete proofs, pseudocode, you name it.

20.

Computational Geometry : Algorithms and Applications
by Mark De Berg (Editor), et al (Hardcover - May 2000)

Christoph Koegl's comments:
Why data structures? Computational geometry is the answer! Beautifully
explained in this book.

21.

Computational Geometry: An Introduction Through Randomized Algorithms
by Ketan Mulmuley (Paperback)

Christoph Koegl's comments:
The best reference on randomized algorithms in computational geometry. Very
detailed, very interesting range of topics.


=======================================


-----------------------------------------------------------------------------------------
"Programming is not a zero-sum game. Teaching something to a fellow programmer doesn’t take it away from you. I’m happy to share what I can, because I’m in it for the love of programming."--John Carmack

 

from http://homepage.fudan.edu.cn/~lijian/algo.htm