-
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.
-
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.
-
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.
-
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.
-
Bentley， Jon. 《更多的程式設計明珠》 Addison-Wesley， 1988. 更多演算法設計在軟體工程中的實用。
Bentley, Jon. More Programming Pearls. Addison-Wesley, 1988. More applications of algorithm design techniques to software engineering.
-
Bentley， Jon Louis. 《編寫有效率的程式》 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.
-
11. Garey， Michael R. 與David S. Johnson. 《電腦與難解問題：對NP-completeness理論的指南》，San Francisco: W. H. Freeman & Co， 1979. 專注於專門討論NP-completeness的參考書。在後半部含有一份大量NP-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.
-
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-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.
-
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.
