Aho, Alfred V., John E. Hopcroft, 与 Jeffrey D. Ullman. 《计算机算法之设计与分析》（The Design and Analysis of Computer Algorithms） 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.
Aho， Alfred V.， John E. Hopcroft， 与 Jeffrey D. Ullman. 《数据结构与算法》（Data Structures and Algorithms） Addison-Wesley， 1983. 重新改版过后是以前作《计算机算法之设计与分析》（The Design and Analysis of Computer Algorithms ）前六章所改版的较基本版本。
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.
Baase， Sara. 《计算机算法：设计与分析导论，第二版》（Computer Algorithms: Introduction to Design and Analysis. 2nd ed） 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.
Bentley， Jon. 《程序设计明珠》（Programming Pearls） 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.
Bentley， Jon. 《更多的程序设计明珠》（More Programming Pearls） Addison-Wesley， 1988. 更多算法设计在软件工程中的实用。
Bentley, Jon. More Programming Pearls. Addison-Wesley, 1988. More applications of algorithm design techniques to software engineering.
Bentley， Jon Louis. 《编写有效率的程序》（Writing Efficient Programs） Prentice-Hall， 1982. 非常杰出的效能精进调整。
Bentley, Jon Louis. Writing Efficient Programs. Prentice-Hall, 1982. Performance hacking extraordinaire.
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.
Chung， Kai Lai. 《基础概率理论与随机过程》，Springer-Verlag， 1974. 对概率直觉性的演示课。
Chung, Kai Lai. Elementary Probability Theory with Stochastic Processes. Springer-Verlag, 1974. Intuitive introduction to probability.
Even， Shimon. 《图形算法》，Computer Science Press， 1979. 对图形算法有广泛的论述，包含了网络流及平面性。
Even, Shimon. Graph Algorithms. Computer Science Press, 1979. Broad treatment of graph algorithms, including network flow and planarity.
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.
Garey， Michael R. 与David S. Johnson. 《计算机与难驾驭性：对NP完整性理论的指南》，San Francisco: W. H. Freeman & Co， 1979. 专注于NP完整性的参考书。在后半部含有一份NP完整问题集的列表及在书中出现过，针对多项式时间特别情况的算法的参考。
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.
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.
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.
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.
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.
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.
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.
Liu， C. L. 《组合数学导论》，McGraw-Hill， 1968. 与计算机科学有关的组合数学。有优秀的习题.
Liu, C. L. Introduction to Combinatorial Mathematics. McGraw-Hill, 1968. Combinatorial mathematics relevant to computer science. Excellent problems.
Manber， Udi. 《算法导论》，Addison-Wesley， 1989. 着重于创造力的初级文章。
Manber, Udi. Introduction to Algorithms. Addison-Wesley, 1989. Elementary text with an emphasis on creativity.
Mehlhorn， Kurt. 《数据结构与算法》，Springer-Verlag， 1984. 三卷： (1) 排序与搜寻， (2) 图算法和NP－完整性， 与 (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.
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.
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.
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.
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.
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.
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.
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.
Aho， Alfred V.， John E. Hopcroft， 与 Jeffrey D. Ullman. 《数据结构与算法》（Data Structures and Algorithms） Addison-Wesley， 1983. 重新改版过后是以前作《计算机算法之设计与分析》（The Design and Analysis of Computer Algorithms ）前六章所改版的较基本版本。
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.
Baase， Sara. 《计算机算法：设计与分析导论，第二版》（Computer Algorithms: Introduction to Design and Analysis. 2nd ed） 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.
Bentley， Jon. 《程序设计明珠》（Programming Pearls） 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.
Bentley， Jon. 《更多的程序设计明珠》（More Programming Pearls） Addison-Wesley， 1988. 更多算法设计在软件工程中的实用。
Bentley, Jon. More Programming Pearls. Addison-Wesley, 1988. More applications of algorithm design techniques to software engineering.
Bentley， Jon Louis. 《编写有效率的程序》（Writing Efficient Programs） Prentice-Hall， 1982. 非常杰出的效能精进调整。
Bentley, Jon Louis. Writing Efficient Programs. Prentice-Hall, 1982. Performance hacking extraordinaire.
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.
Chung， Kai Lai. 《基础概率理论与随机过程》，Springer-Verlag， 1974. 对概率直觉性的演示课。
Chung, Kai Lai. Elementary Probability Theory with Stochastic Processes. Springer-Verlag, 1974. Intuitive introduction to probability.
Even， Shimon. 《图形算法》，Computer Science Press， 1979. 对图形算法有广泛的论述，包含了网络流及平面性。
Even, Shimon. Graph Algorithms. Computer Science Press, 1979. Broad treatment of graph algorithms, including network flow and planarity.
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.
Garey， Michael R. 与David S. Johnson. 《计算机与难驾驭性：对NP完整性理论的指南》，San Francisco: W. H. Freeman & Co， 1979. 专注于NP完整性的参考书。在后半部含有一份NP完整问题集的列表及在书中出现过，针对多项式时间特别情况的算法的参考。
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.
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.
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.
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.
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.
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.
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.
Liu， C. L. 《组合数学导论》，McGraw-Hill， 1968. 与计算机科学有关的组合数学。有优秀的习题.
Liu, C. L. Introduction to Combinatorial Mathematics. McGraw-Hill, 1968. Combinatorial mathematics relevant to computer science. Excellent problems.
Manber， Udi. 《算法导论》，Addison-Wesley， 1989. 着重于创造力的初级文章。
Manber, Udi. Introduction to Algorithms. Addison-Wesley, 1989. Elementary text with an emphasis on creativity.
Mehlhorn， Kurt. 《数据结构与算法》，Springer-Verlag， 1984. 三卷： (1) 排序与搜寻， (2) 图算法和NP－完整性， 与 (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.
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.
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.
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.
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.
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.
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.
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.
1156
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
