280 APPENDIX D
Chapter 4. Numeric Algorithms
Strassen, V. “Gaussian Elimination Is Not Optimal,” Numerische Mathematik, 13,
pp. 354– 356, 1969.
Winograd, S. “On the Number of Multiplications Necessary to Compute
Certain Functions,” Journal of Pure and Applied Mathematics, 23, pp. 165–179,
1970.
Chapter 5. Matching Algorithms
Aho, A. and Corasick, M. “Efficient String Matching: An Aid to Bibliographic
Search,” Communications of the ACM, 18(6), pp. 333–340, 1975.
Boyer, R. and Moore, J. “A Fast String Searching Algorithm,” Communications
of the ACM, 20(10), pp. 762–772, 1977.
Crochemore, M. and Rytter, W. Text Algorithms. Oxford University Press, New
York, 1994.
Hall, P. and Dowling, G. “Approximate String Matching,” Computing Surveys,
12(4), pp. 381–402, 1980.
Knuth, D., Morris, J., and Pratt, V. “Fast Pattern Matching in Strings,” SIAM
Journal on Computing, 6(2), pp. 323–350, 1977.
Landau, G. and Vishkin, U. “Introducing Efficient Parallelism into Approxi-
mate String Matching and a New Serial Algorithm,” Proceedings of the 18th
Annual ACM Symposium on Theory of Computing, pp. 220–230, 1986.
Smit, G. “A Comparison of Three String Matching Algorithms,” Software—
Practice and Experience, 12, pp. 57–66, 1982.
Chapter 6. Graph Algorithms
Dijkstra, E. “A Note on Two Problems in Connexion with Graphs,”
Numerische Mathematik, 1, pp. 269–271, 1959.
Even, S. Graph Algorithms. Computer Science Press, Rockville, MD, 1979.
Gibbons, A. Algorithmic Graph Theory. Cambridge University Press, Cambridge,
England, 1985.
Hopcroft, J. and Tarjan, R. “Dividing a Graph into Triconnected Compo-
nents,” SIAM Journal on Computing, 2(3), pp. 135–157, 1973.
Khuller, S. and Raghavachari, B. “Basic Graph Algorithms,” in Atallah, M.
(ed.), Algorithms and Theory of Computation Handbook, pp. 6-1–6-23. CRC
Press, New York, 1999.
Prim, R. “Shortest Connection Networks and Some Generalizations,” Bell
System Technical Journal, 36, pp. 1389–1401, 1957.