Aho, Alfred V., John E. Hopcroft, 與 Jeffrey D. Ullman. 《計算機(jī)算法之設(shè)計與分析》（The Design and Analysis of Computer Algorithms） Addison-Wesley， 1974. 經(jīng)典作品，但是在網(wǎng)絡(luò)流，線性規(guī)劃和近代算法方面較缺少。 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. 《數(shù)據(jù)結(jié)構(gòu)與算法》（Data Structures and Algorithms） Addison-Wesley， 1983. 重新改版過后是以前作《計算機(jī)算法之設(shè)計與分析》（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. 《計算機(jī)算法：設(shè)計與分析導(dǎo)論，第二版》（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. 《程序設(shè)計明珠》（Programming Pearls） Addison-Wesley， 1986. 算法設(shè)計在軟件工程中的實用。（Programming Pearls 繁體中文版, 譯者：許鳴程，出版商：基峰，出版日期：2001-11-22，ISBN：9575668804）
Bentley, Jon. Programming Pearls. Addison-Wesley, 1986. Applications of algorithm design techniques to software engineering.
Bentley， Jon. 《更多的程序設(shè)計明珠》（More Programming Pearls） Addison-Wesley， 1988. 更多算法設(shè)計在軟件工程中的實用。
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. 非常杰出的效能精進(jìn)調(diào)整。
Bentley, Jon Louis. Writing Efficient Programs. Prentice-Hall, 1982. Performance hacking extraordinaire.
Brassard， Gilles 與 Paul Bratley. 《算法：理論與實踐》，Prentice-Hall， 1988. 很好的范例及習(xí)題，著重于方法而不是個別的問題。
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. 《基礎(chǔ)概率理論與隨機(jī)過程》，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. 對圖形算法有廣泛的論述，包含了網(wǎng)絡(luò)流及平面性。
Even, Shimon. Graph Algorithms. Computer Science Press, 1979. Broad treatment of graph algorithms, including network flow and planarity.
Feller， William. 《概率理論導(dǎo)論與應(yīng)用》，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. 《計算機(jī)與難駕馭性：對NP完整性理論的指南》，San Francisco: W. H. Freeman & Co， 1979. 專注于NP完整性的參考書。在后半部含有一份NP完整問題集的列表及在書中出現(xiàn)過，針對多項式時間特別情況的算法的參考。
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. 《算法與數(shù)據(jù)結(jié)構(gòu)手冊》，Addison-Wesley， 1984. Pascal 及 C 碼， 真正執(zhí)行時間的比較，和對研究報告中分析的指示。
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. 《計算機(jī)算法基礎(chǔ)》，Computer Science Press， 1978. 擇重介紹了數(shù)據(jù)結(jié)構(gòu)，動態(tài)編程，以及分支與界限法。
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. 《算法與數(shù)據(jù)結(jié)構(gòu)：設(shè)計，正確性，分析》，Addison-Wesley Publishing Co.， 1991. 一本優(yōu)良的數(shù)據(jù)結(jié)構(gòu)導(dǎo)入書，關(guān)于算法正確性有一篇不錯的章節(jié)。
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. 《計算機(jī)程序設(shè)計藝術(shù)》，Addison-Wesley. 三卷如百科全書般的作品：(1) 基礎(chǔ)算法， (2) 半數(shù)值算法， 與 (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. 《組合式優(yōu)選》，Holt， Rinehart， and Winston， 1976. 圖算法（密集圖)，網(wǎng)絡(luò)流，與線型規(guī)劃。開始幾章是很優(yōu)秀的。
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. 《組合數(shù)學(xué)導(dǎo)論》，McGraw-Hill， 1968. 與計算機(jī)科學(xué)有關(guān)的組合數(shù)學(xué)。有優(yōu)秀的習(xí)題.
Liu, C. L. Introduction to Combinatorial Mathematics. McGraw-Hill, 1968. Combinatorial mathematics relevant to computer science. Excellent problems.
Manber， Udi. 《算法導(dǎo)論》，Addison-Wesley， 1989. 著重于創(chuàng)造力的初級文章。
Manber, Udi. Introduction to Algorithms. Addison-Wesley, 1989. Elementary text with an emphasis on creativity.
Mehlhorn， Kurt. 《數(shù)據(jù)結(jié)構(gòu)與算法》，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. 《數(shù)論導(dǎo)論》，John Wiley & Sons， 1980. 有閱讀價值的的數(shù)論入門介紹。
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. 《組合式優(yōu)選：算法與復(fù)雜性》，Prentice-Hall， 1982. 線性規(guī)劃和它的變體。
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的數(shù)值處方：科學(xué)計算的藝術(shù)》，Cambridge: Cambridge University Press， 1988. 數(shù)值算法的程序碼.
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. 《組合算法：理論與應(yīng)用》，Prentice-Hall， 1977. 在遞歸關(guān)系和二元樹方面的內(nèi)容不錯。
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. 有著優(yōu)秀論題廣度的初階文章。不重于分析，但是有很多圖。
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. 《運算理論導(dǎo)論》，PWS Publishing Co.， 1997. 對可計算性及復(fù)雜性理論很好的文章。
Sipser, Michael. Introduction to the Theory of Computation. PWS Publishing Co., 1997. A good text on computability and complexity theory.
Tarjan， Robert Endre. 《數(shù)據(jù)結(jié)構(gòu)與網(wǎng)絡(luò)算法》，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.