• Aho, Alfred V., "Data structures and algorithms", Reading, Mass : Addison-Wesley, c1983.
  • Aho, Alfred V., "The design and analysis of computer algorithm".
  • edited by Attallah, Mikhail J. "Algorithms and theory of computation handbook", CRC Press, 1998 (QA76.9.A43 1999).
  • Baase, Sara., "Computer algorithms : introduction to design and analysis", Reading, Mass : Addison-Wesley Pub. Co., c1978.
  • Brassard, Giles. and Bratley, Paul. "Algoritmics: Theory and Practice", (QA9.6 .B73 1988).
  • Brassard, Gilles, "Fundamentals of algorithmics", Englewood, N.J. : Prentice Hall, c1996.
  • Brown, Marc H. "Algorithm animation", Cambridge, Mass : M.I.T. Press, c1988.
  • Budd, Timothy A., "Classic data structures in C++ Reading", Mass. : Addison-Wesley Pub. Co., c1994.
  • Collected algorithms from ACM. New York, N.Y : Association for Computing Machinery, 1975-. (MICROFICHE)
  • Cormen, Thomas H. "Introduction to algorithms", Cambridge, Mass : MIT Press ; New York : McGraw-Hill, c1990.
  • Even, Shimon., "Graph Algorithms",Computer Science Press, 1979.
  • Garey, Michael R.,"Computers and intractability : a guide to the theory of NP", San Francisco : W. H. Freeman, c1979.
  • Gibbons, Alan M., "Efficient Parallel Algorithms", Cambridge University Press, 1988.
  • Greene, Daniel H., "Mathematics for the analysis of algorithms", Boston : Birkhauser, c1981.
  • Gonnet, Gaston H., "Handbook of algorithms and data structures : in Pascal and C", Wokingham, England ; Reading, Mass : Addison-Wesley Pub. Co.,
  • Gonnet, Gaston H. and Baeza-Yates, Ricardo editors, "Handbook of Algorithms and Data Structures in Pascal and C", Addison-Wesley, 1991.
  • Grossman, Jerrold W., "Discrete Mathematics: An Introduction to Concepts, Methods, and Applications", (Macmillan/Prentice-Hall, 1990)
  • Harel, David., "Algorithmics : the spirit of computing", second edition Addison-Wesley, 1992.
  • Horowitz, Ellis., "Fundamentals of computer algorithms", Potomac, Md : Computer Science Press, c1978.
  • Smith, Jeffrey D., "Design and Analysis of Algorithms", PWS-Kent, 1989.
  • Kingston, Jeffrey Howard., "Algorithms and data structures : design, correctness, analysis", Sydney : Addison-Wesley, 1990.
  • Koren, Israel., "Computer Arithmetic Algorithms", Prentice-Hall, 1993.
  • Kozen, Dexter C. "The design and analysis of algorithms", 1992.(QA76.9.A43 K69 1992).
  • Kreher, Donald L. and Stinson, Douglas Combinatorial Algorithms: Generation, Enumeration and Search, (CRC Press, 1998)
  • Kruse, Robert L., "Data Structures and Program Design", second edition Prentice-Hall, 1996.
  • Knuth, Donald E,. Graham, Ronald L.and Patashnik, Oren.,"Concrete Mathematics : A Foundation for Computer Science", second edition Wiley, 1990.
  • Leighton, F. Thomson.,"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes",Morgan Kaufman, 1992.
  • Machtey, Michael., "An introduction to the general theory of algorithms", New York : North Holland, c1978.
  • Manber, Udi., "Introduction to Algorithms", Addison-Wesley, 1989.
  • Mehlhorn, Kurt, "UNIF Effiziente Allgorithmen. English. Data structures and algorithms", Berlin ; New York : Springer, 1984. 1984 DAT V. 2, 1984 DAT V. 3, 1984 DAT V. 1.
  • Moffat, David V., "Common algorithms in Pascal with programs for reading",  Englewood Cliffs, N.J : Prentice-Hall, c1984.
  • Moret, B. M. E. (Bernard M. E.), "Algorithms from P to NP", Redwood City, CA : Benjamin/Cummings, c1991-
  • Reinelt, G. (Gerhard),"The traveling salesman : computational solutions for TSP", Berlin ; New York : Springer-Verlag, c1994.
  • Reingold, Edward M., Nievergelt, Jurg. and Deo,Narsingh., "Combinatorial Algorithms: Theory and Practice", Prentice-Hall, 1977.
  • Rosen, Kenneth H.," Discrete Mathematics and Its Applications",McGraw-Hill, 1999.
  • Sedgewick, Robert, "Algorithms" Reading, Mass : Addison-Wesley, c1983.
  • Sedgewick, Robert, "Algorithms in C", Reading, Mass : Addison-Wesley Pub. Co., c1990.
  • Skiena, Steven S. "The Algorithm Design Manual". with CD-ROM.
  • Standish, Thomas A., "Data Structures, Algorithms, and Software Principles", Addison-Wesley, 1994.
  • Standish, Thomas A., "Data structure techniques Reading", MA : Addison-Wesley, c1980.
  • Tremblay, Jean-Paul., "An Introduction to computer science : an algorithmic approach",  New York : McGraw-Hill, c1979.
  • Walker, Henry M.,"Computer science 2 : principles of software engineering, data", Glenview, Ill : Scott, Foresman, c1989.
  • Wirth, Niklaus., "Algorithms + data structures=programs", Englewood Cliffs, N.J : Prentice-Hall, c1976.