References for ICS 263

General References

AHU

Aho A.V., Hopcroft J.E., and Ullman J.D. The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

BB

Brassard G. and Bratley P. Algorithmics, Prentice Hall, 1988.

CLR

Cormen T.H., Leiserson C.E., and Rivest R.L. Introduction to Algorithms, McGraw-Hill, 1990.

Hu

Hu T.C. Combinatorial Algorithms, Addison-Wesley, 1982.

Kn3

Knuth D.E. The Art of Computer Programming, Vol. 3, Addison-Wesley, 1998.

Topical References

1. Recursion: AHU 60-65, 226-231, 252-264; BB 105-142; CLR 53-70, 189-190
   • Pan V.Y. "Strassen's algorithm is not optimal." 19th FOCS (1978), 166-176.
   • Cunto W. and Munro J.I. "Average case selection." JACM 36 (1989), 270-279.
2. Evaluation of relations: AHU 199-206, 243-247; CLR 562-569
   • Hunt H.B., Szymanski T.G., and Ullman J.D. "Operations on sparse relations." Comm. ACM 20 (1977), 171-176.
3. Dynamic programming: AHU 67-69; BB 142-168, 190-194; CLR 301-328; Hu 107-132
   • Hirschberg D.S. "A linear space algorithm for computing maximal common subsequences." Comm. ACM 18 (1975), 341-343.
4. Greedy algorithms: CLR 329-332, 499-510
5. Trees: AHU 119-123; CLR 337-343, 440-458; Hu 164-191; Kn3 433-444
   • Knuth D.E. The Art of Computer Programming, Vol. 1, (third ed.), Addison-Wesley, 1997, 386-404.
   • Perl Y. "Optimum split trees." Jour. of Algorithms 5 (1984), 367-374.
   • Hopcroft J.E. and Tarjan R.E. "Isomorphism of planar graphs." Complexity of Computer Computations, R.E. Miller and J.W. Thatcher (eds.), Plenum, 1972, 131-152.
6. Pattern matching: AHU 330-332, 346-357; BB 211-221; CLR 853-885
   • Crochemore, M. and Rytter, W. Text Algorithms. Oxford U. Press, 1994, 412pp.
   • Knuth D.E., Morris J.H., and Pratt V.R. "Fast pattern matching in strings." SIAM J. Computing 6 (1977), 323-350.
   • Boyer R.S. and Moore J.S. "A fast string searching algorithm." Comm. ACM 20 (1977), 762-772.
   • Sunday, D.M. "A very fast substring search algorithm." Comm. ACM 33,8 (Aug. 1990), 132-142.
   • Weiner P. "Linear pattern matching algorithms." 14th SWAT (1973), 1-11.
   • McCreight E.M. "A space-economical suffix tree construction algorithm." JACM 23 (1976), 262-272.
   • Ukkonen, E. "Constructing suffix trees on-line in linear time." In: Algorithms, Software, Architecture. Information Processing 92, vol. 1, J. van Leeuwen (ed.), Elsevier, 1992, 484-492. Revised version: On-line construction of suffix-trees. Univ. of Helsinki Dept. of Comp. Sci. Report A-1993-1, 15 pp.
   • Karp, R.M., Miller, R.E., and Rosenberg, A.L. "Rapid identification of repeated patterns in strings, arrays and trees." In: 4th STOC (1972), 125-136.
   • Manacher, G. "A new linear-time on-line algorithm for finding the smallest initial palindrome of the string." JACM 22 (1975), 346-351.
7. NP-complete problems: AHU 364-394; BB 292-337; CLR 916-961
   • Karp R.M. "Reducibility among combinatorial problems." Complexity of Computer Computations, R.E. Miller and J.W. Thatcher (eds.), Plenum, 1972, 85-103.
   • Hartmanis J. and Simon J. "On the structure of feasible computations." Advances in Computers, Vol. 14, Academic Press, 1976.
   • Garey M.R. and Johnson D.S. Computers and Intractibility: A Guide to the Theory of NP-Completeness, Freeman, 1979.
8. Approximation algorithms: CLR 964-986
   • Sahni S. "Approximation algorithms for the 0/1 knapsack problem." JACM 22 (1975), 115-124.
   • Ibarra O.H. and Kim C.E. "Fast approximation algorithms for the knapsack and sum of subset problems." JACM 22 (1975), 463-468.
9. Probabilistic algorithms: BB 223-276; CLR 837-844
   • Miller G.L. "Riemann's hypothesis and tests for primality." JCSS 13 (1976), 300-317.
   • Rabin M.O. "Probabilistic algorithm for primality testing." Jour. of Number Theory 12 (1980), 128-138.
   • Solovay R. and Strassen V. "A fast Monte-Carlo test for primality." SIAM J. Comp. 6 (1977), 84-85.
   • Rivest R.L., Shamir A., and Adleman A. "A method for obtaining digital signatures and public-key cryptosystems." Comm. ACM 21 (1978), 120-126.

   ---

   Dan Hirschberg
   Computer Science
   University of California, Irvine, CA 92697-3425
   
   dan at ics.uci.edu
   Last modified: Mar 25, 1999