Data Structures and Algorithms

(last updated: 16-May-2015 09:31)
 

Books

  1. Algorithms, Second Edition; Robert Sedgewick; Addison-Wesley, 1988.
     
  2. Algorithms in C; Robert Sedgewick; Addison-Wesley, 1990.
     
  3. Algorithms in C, Third Edition: Parts 1-4 -- Fundamentals, Data Structures, Sorting, Searching; Robert Sedgewick; Addison-Wesley, 1998.
     
  4. Algorithms in C++; Robert Sedgewick; Addison-Wesley, 1992.
     
  5. Algorithms in C++, Third Edition: Parts 1-4 -- Fundamentals, Data Structures, Sorting, Searching; Robert Sedgewick; Addison-Wesley, 1998.
     
  6. Algorithms in Modula-3; Robert Sedgewick; Addison-Wesley, 1993.
     
  7. Algorithms + Data Structures = Programs; Niklaus Wirth; Prentice-Hall, 1976.
     
  8. Algorithms and Data Structures; Niklaus Wirth; Prentice-Hall, 1986.
     
  9. Algorithms, Data Structures, and Problem Solving with C++; Mark Allen Weiss; Addison-Wesley, 1996.
     
  10. The Art of Computer Programming - Volume 1: Fundamental Algorithms, Second Edition; Donald E. Knuth; Addison-Wesley, 1973.
     
  11. The Art of Computer Programming, Volume 1: Fundamental Algorithms, Third Edition; Donald E. Knuth; Addison-Wesley, 1997.
     
  12. The Art of Computer Programming - Volume 2: Seminumerical Algorithms, Second Edition; Donald E. Knuth; Addison-Wesley, 1981.
     
  13. The Art of Computer Programming, Volume 2: Seminumerical Algorithms, Third Edition; Donald E. Knuth; Addison-Wesley, 1997.
     
  14. The Art of Computer Programming - Volume 3: Sorting and Searching; Donald E. Knuth; Addison-Wesley, 1973.
     
  15. The Art of Computer Programming, Volume 3: Sorting and Searching, Second Edition; Donald E. Knuth; Addison-Wesley, 1997.
     
  16. Classical Algorithms in C++; Nicholas Wilt; John Wiley & Sons, 1995.
     
  17. Computer Algorithms: Introduction to Design and Analysis, Second Edition; Sara Baase; Addison-Wesley Publishing Co., 1988.
     
  18. Computer Algorithms/C++; Ellis Horowitz, Sartaj Sahni, and Sanguthevar Rajasekaran; Computer Science Press, 1996.
     
  19. Computers and Intractability: A Guide to the Theory of NP-Completeness; Michael R. Garey and David S. Johnson; W.H. Freeman and Company, 1979.
     
  20. Data Structures; Edward M. Reingold and Wilfred J. Hansen; Little, Brown, and Company, 1983.
     
  21. Data Structures; Rick Decker; Prentice-Hall, 1989.
     
  22. Data Structures: An Advanced Approach Using C; Jeffrey Esakov and Tom Weiss; Prentice Hall, 1989.
     
  23. Data Structures and Algorithms; Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman; Addison-Wesley, 1983.
     
  24. Data Structures, Algorithms, and Program Style Using C; James F. Korsh and Leonard J. Garrett; PWS-KENT Publishing Co., 1988.
     
  25. Data Structures in Java; Thomas A. Standish; Addison Wesley, 1998.
     
  26. Data Structures and PL/I Programming, Moshe J. Augenstein and Aaron M. Tenenbaum; Prentice-Hall, 1979.
     
  27. Data Structures and Program Design in C; Robert L. Kruse, Bruce P. Leung, and Clovis L. Tondo; Prentice Hall, 1991.
     
  28. Data Structure Techniques; Thomas A. Standish; Addison-Wesley, 1980.
     
  29. Data Structures Using Pascal; Aaron M. Tenebaum and Moshe J. Augenstein; Prentice-Hall, 1981.
     
  30. Data Structures Using Pascal, Second Edition; Aaron M. Tenenbaum and Moshe J. Augenstein; Prentice-Hall, 1986.
     
  31. Data Types and Structures; Gottlieb and Gottlieb; Prentice Hall, 1978.
     
  32. The Design and Analysis of Computer Algorithms; Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman; Addison-Wesley, 1974.
     
  33. Elements of the Theory of Computation; Harry R. Lewis and Christos H. Papadimitriou; Prentice-Hall, 1981.
     
  34. Foundations of Computer Science; Afred V. Aho and Jeffrey D. Ullman; Computer Science Press, 1992.
     
  35. Graph Algorithms; Shimon Even; Computer Science Press, 1979.
     
  36. Introduction to Algorithms; Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest; The MIT Press (McGraw-Hill Book Company), 1990.
     
  37. An Introduction to the Analysis of Algorithms; Robert Sedgewick and Phillipe Flajolet; Addison-Wesley, 1996.
     
  38. Introduction to Automata Theory, Languages, and Computation; John E. Hopcroft and Jeffrey D. Ullman; Addison-Wesley, 1979.
     
  39. Mastering Algorithms with C; Kyle Loudon; O'Reilly & Associates, 1999.
     
  40. Mathematics for the Analysis of Algorithms, Second Edition; D.H. Greene and D.E. Knuth; Birkhauser (Boston, MA), 1982 (ISBN 3-7643-3102-X).
     
  41. Mathematics for the Analysis of Algorithms, Third Edition; Daniel H. Greene and Donald E. Knuth; Birkhauser (Boston), 1990.
     
  42. Practical Algorithms for Programmers; Andrew Binstock and John Rex; Addison-Wesley, 1995.
     
  43. Programming Classics: Implementing the World's Best Algorithms; Ian Oliver; Prentice Hall.
     
  44. Programs and Data Structures in C; Leendert Ammeraal; John Wiley & Sons, 1987.

Periodical Articles

  1. "Quicksort", C.A.R. Hoare, Computer Journal 5:1 1962 pgs 10-15.
     
  2. CACM 6:8 Aug 1963 pgs 444 et al (includes Algorithm 199, relating to Gregorian calendar).
     
  3. "Algorithm 232 (Heapsort)", J.W.J. Williams, CACM Vol. 7 1964 pgs 347-348.
     
  4. "Symmetric Binary B-trees: Data Structure and Maintenance Algorithms", R. Bayer, Acta Informatica, Vol. 1 1972 pgs 290-306.
     
  5. "Organization and Maintenance of Large Ordered Indexes", R. Bayer and E.M. McCreight, Acta Informatica 1:3 1972 pgs 173-189.
     
  6. "Prefix B-Trees", Rudolf Bayer and Karl Unterauer, ACM Transactions on Database Systems 2:1 Mar 1977 pgs 11-26.
     
  7. "Implementing Quicksort Programs", Robert Sedgewick, CACM 21:10 1978 pgs 847-857.
     
  8. "The Ubiquitous B-Tree", Douglas Comer, Computing Surveys 11:2 Jun 1979 pgs 121-137.
     
  9. "Data Structures and Algorithms", SA 251:3 Sep 1984 pgs 60-69.
     
  10. "Error-Free Fractions", BYTE 13:6 Jun 1988 pgs 289-298.
     
  11. "The Quicksort Explained", PCM 7:15 Sep 13 1988 pgs 341-343.
     
  12. "MASM Programming for Quicksort", PCM 7:16 Sep 27 1988 pgs 307-314.
     
  13. "Random Number Generators: Good Ones are Hard to Find", CACM Oct 1988 pgs 1192-1201.
     
  14. "An Introduction to Indexed Files", PCM 8:7 Apr 11 1989 pgs 291-300.
     
  15. "Understanding Hashing Techniques", PCM 8:8 Apr 25 1989 pgs 297-302.
     
  16. "Faster String Searches", DDJ 14:7 Jul 1989 pgs 74-75, 98-99.
     
  17. "Using the Quicksort Function", The C Users Journal 8:9 Sep 1990 pgs 23-34.
     
  18. "Balanced Binary Trees in C++", CUJ 9:1 Jan 1991 pgs 65-74.
     
  19. "A Fast, Easy Sort" (bubble sort and other sorts), BYTE 16:4 Apr 1991 pgs 315-320.
     
  20. "High-Performance String Searching", PCM 15:15 Sep 10 1996 pgs 289-292.