算法课程参考书籍

 

1. Aho, Alfred V., John E. Hopcroft, 与 Jeffrey D. Ullman. 《计算机算法之设计与分析》 Addison-Wesley， 1974. 经典作品，但是在网络流量，线性规划和近代算法方面较缺少。 Aho, Alfred V., John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974. The classic text, but it lacks topics in network flows and linear programming, as well as more recent algorithms.
   
   
2. Aho， Alfred V.， John E. Hopcroft， 与 Jeffrey D. Ullman. 《数据结构与算法》 Addison-Wesley， 1983. 是 《计算机算法之设计与分析》前六章所改写的较基本版本。
   Aho, Alfred V., John E. Hopcroft, and Jeffrey D. Ullman. Data Structures and Algorithms . Addison-Wesley, 1983. Revised and more elementary version of the first six chapters of The Design and Analysis of Computer Algorithms.
   
   
   
3. Baase， Sara. 《计算机算法：设计与分析导论，第二版》 Addison-Wesley， 1988. 一般参考书，尽管它的说明有时是精简或概要的。
   Baase, Sara. Computer Algorithms: Introduction to Design and Analysis. 2nd ed. Addison-Wesley, 1988. General reference, although the exposition is sometimes terse or sketchy.
   
   
   
4. Bentley， Jon. 《程序设计明珠》 Addison-Wesley， 1986. 应用算法设计技巧在软件工程中。（Programming Pearls 繁体中文版, 译者：许鸣程，出版商：基峰，出版日期：2001-11-22，ISBN：9575668804）
   Bentley, Jon. Programming Pearls. Addison-Wesley, 1986. Applications of algorithm design techniques to software engineering.
   
   
   
5. Bentley， Jon. 《更多的程序设计明珠》 Addison-Wesley， 1988. 更多算法设计在软件工程中的实用。
   Bentley, Jon. More Programming Pearls. Addison-Wesley, 1988. More applications of algorithm design techniques to software engineering.
   
   
   
6. Bentley， Jon Louis. 《编写有效率的程序》 Prentice-Hall， 1982.对程序效能提升有特殊的助益。
   Bentley, Jon Louis. Writing Efficient Programs. Prentice-Hall, 1982. Performance hacking extraordinaire.
   
   
   
7. Brassard， Gilles 与 Paul Bratley. 《算法：理论与实作》，Prentice-Hall， 1988. 很好的范例及习题，着重于方法而不是个别的问题。
   Brassard, Gilles and Paul Bratley. Algorithmics: Theory and Practice. Prentice-Hall, 1988. Good examples and problems. Focus on methods rather than specific problems.
   
   
   
8. Chung， Kai Lai. 《基础概率理论与随机过程》，Springer-Verlag， 1974. 对概率作直觉性的介绍。
   Chung, Kai Lai. Elementary Probability Theory with Stochastic Processes. Springer-Verlag, 1974. Intuitive introduction to probability.
   
   
   
9. Even， Shimon. 《图形算法》，Computer Science Press， 1979. 对图形算法有广泛的论述，包含了网络流量及平面图。
   Even, Shimon. Graph Algorithms. Computer Science Press, 1979. Broad treatment of graph algorithms, including network flow and planarity.
   
   
   
10. Feller， William. 《概率理论导论与应用》，John Wiley & Sons， Vol 1. 1968， Vol 2. 1971. 一本很好的概率参考书。
    Feller, William. An Introduction to Probability Theory and Its Applications. John Wiley & Sons, Vol 1. 1968, Vol 2. 1971. Excellent reference for probability theory.
    
    
    
11. Garey， Michael R. 与David S. Johnson. 《计算机与难解问题：对NP-completeness理论的指南》，San Francisco: W. H. Freeman & Co， 1979. 专注于专门讨论NP-completeness的参考书。在后半部含有一份大量NPP-completeness问题集和文献中特别情况下存在多项式时间的算法的参考资料。
    Garey, Michael R. and David S. Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman & Co., 1979. Reference book devoted to NP-completeness. The second half contains an extensive list of NP-complete problems and references to algorithms in the literature for polynomial-time special cases.
    
    
    
12. Gonnet， G. H. 《算法与数据结构手册》，Addison-Wesley， 1984. Pascal 及 C 编码， 真正执行时间的比较，和对研究论文中分析的指示。
    Gonnet, G. H. Handbook of Algorithms and Data Structures. Addison-Wesley, 1984. Code in Pascal and C, comparisons of actual running times, and pointers to analysis in research papers.
    
    
    
13. Gusfield， Dan. 《字串，树，与序列的算法》， Cambridge University Press， 1997. 操作字符字串及序列的算法的一般论述。
    Gusfield, Dan. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997. General treatment of algorithms that operate on character strings and sequences.
    
    
    
14. Horowitz， Ellis 与Sartaj Sahni. 《计算机算法基础》，Computer Science Press， 1978. 择重介绍了数据结构，动态规划，以及分支界限法。
    Horowitz, Ellis and Sartaj Sahni. Fundamentals of Computer Algorithms . Computer Science Press, 1978. Good on data structures, dynamic programming, and branch-and-bound algorithms.
    
    
    
15. Kingston， Jeffrey H. 《算法与数据结构：设计，正确性，分析》，Addison-Wesley Publishing Co.， 1991. 一本优良的数据结构导入书，有不错的章节介绍算法正确性。
    Kingston, Jeffrey H. Algorithms and Data Structures: Design, Correctness, Analysis. Addison-Wesley Publishing Co., 1991. A nice introductory book on data structures, with a good chapter on algorithm correctness.
    
    
    
16. Knuth， Donald E. 《计算机程序设计的艺术》，Addison-Wesley. 三卷如百科全书般的作品：(1) 基础算法， (2) 半数值算法， 与 (3) 排序与搜寻。
    Knuth, Donald E. The Art of Computer Programming. Addison-Wesley. Encyclopedic work in three volumes: (1) Fundamental Algorithms, (2) Seminumerical Algorithms, and (3) Sorting and Searching.
    
    
    
17. Lawler， Eugene L. 《组合优化论》，Holt， Rinehart， and Winston， 1976.图形算法（密集图)，网络流量，与线型规划。开始几章是很棒的。
    Lawler, Eugene L. Combinatorial Optimization. Holt, Rinehart, and Winston, 1976. Graph algorithms (dense graphs), network flows, and linear programming. First few chapters are excellent.
    
    
    
18. Liu， C. L. 《组合数学导论》，McGraw-Hill， 1968. 与计算机科学有关的组合数学。有优秀的习题.
    Liu, C. L. Introduction to Combinatorial Mathematics . McGraw-Hill, 1968. Combinatorial mathematics relevant to computer science. Excellent problems.
    
    
    
19. Manber， Udi. 《算法导论》，Addison-Wesley， 1989. 着重于创造力的初级教科书。
    Manber, Udi. Introduction to Algorithms. Addison-Wesley, 1989. Elementary text with an emphasis on creativity.
    
    
    
20. Mehlhorn， Kurt. 《数据结构与算法》，Springer-Verlag， 1984. 三卷： (1) 排序与搜寻， (2) 图形算法和NP-Completeness， 与 (3) 多维度搜寻与计算几何。基本及进阶主题的讲义。
    Mehlhorn, Kurt. Data Structures and Algorithms. Springer-Verlag, 1984. Three volumes: (1) Sorting and Searching, (2) Graph Algorithms and NP-Completeness, and (3) Multidimensional Searching and Computational Geometry. Lecture notes on basic and advanced topics.
    
    
    
21. Niven， Ivan 与Herbert S. Zuckerman. 《数论导论》，John Wiley & Sons， 1980. 容易阅读的数论入门介绍。
    Niven, Ivan and Herbert S. Zuckerman. An Introduction to the Theory of Numbers. John Wiley & Sons, 1980. Readable introduction to number theory.
    
    
    
22. Papadimitriou， Christos H. 与Kenneth Steiglitz. 《组合优化论：算法与复杂度》，Prentice-Hall， 1982. 线性规划和它的变型。
    Papadimitriou, Christos H. and Kenneth Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982. Linear programming and its variants.
    
    
    
23. Press， William P.， Brian P. Flannery， Saul A. Teukolsky， 与 William T. Vetterling. 《C的数值处方：科学计算的艺术》，Cambridge: Cambridge University Press， 1988. 数值算法的程序码.
    Press, William P., Brian P. Flannery, Saul A. Teukolsky, and William T. Vetterling. Numerical Recipies in C: The Art of Scientific Computing . Cambridge: Cambridge University Press, 1988. Code for numerical algorithms.
    
    
    
24. Reingold， E. M.， J. Nievergelt， 与N. Deo. 《组合算法：理论与实作》，Prentice-Hall， 1977. 在递归关系和二元搜寻树方面的内容不错。
    Reingold, E. M., J. Nievergelt, and N. Deo. Combinatorial Algorithms: Theory and Practice . Prentice-Hall, 1977. Good on recurrence relations and binary search trees.
    
    
    
25. Sedgewick， Robert . 《算法，第二版》，Addison-Wesley， 1988. 有优秀广度题材的初阶教科书。不重分析，但是有很多图。
    Sedgewick, Robert . Algorithms. 2nd ed. Addison-Wesley, 1988. Elementary text with an excellent breadth of topics. Light on analysis, but lots of figures.
    
    
    
26. Sipser， Michael. 《计算理论导论》，PWS Publishing Co.， 1997. 是一本很好的可计算性及复杂度理论教科书。
    Sipser, Michael. Introduction to the Theory of Computation. PWS Publishing Co., 1997. A good text on computability and complexity theory.
    
    
    
27. Tarjan， Robert Endre. 《数据结构与网络算法》，Society for Industrial and Applied Mathematics， 1983. 有一堆好题材的进阶书籍。
    Tarjan, Robert Endre. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983. Advanced book with tons of good stuff.