 
Summary: References
[1] S. K. Abdali, G. W. Cherry, and Neil Soi#er. An object oriented approach to algebraic system
design. In Proceedings of the ACM Symposium on Symbolic and Algebraic Computation, pages
2430, July 1986.
[2] Habib Abdulrab and JeanPierre P’ecuchet. Solving word equations. In Claude Kirchner,
editor, Unification, pages 353375. Academic Press, New York, 1990.
[3] Harold Abelson, Gerald Jay Sussman, and Julie Sussman. Structure and Interpretation of
Computer Programs. MIT Press, Cambridge, Massachusetts, second edition, 1996.
[4] Yaser AbuMostafa. Machines that learn from hints. Scientific American, 272(4):6469, April
1995.
[5] Leonard M. Adleman and Kenneth Manders. Reductions that lie. In 20th Annual Symposium
on the Foundations of Computer Science, pages 397410, San Juan, Puerto Rico, October
1979.
[6] Alok Aggarwal, Leonidas J. Guibas, James Saxe, and Peter W. Shor. A linear time algorithm
for computing the Voronoi diagram of a convex polygon. In Proceedings of the Annual ACM
Symposium on the Theory of Computing, volume 19, pages 3945, New York City, May 1987.
[7] Gul Agha and Carl Hewitt. Concurrent programming using actors: Exploiting largescale par
allelism. In A. H. Bond and L. Gasser, editors, Readings in Distributed Artificial Intelligence,
pages 398407. Morgan Kaufmann, San Mateo, California, 1988.
[8] Alfred V. Aho, John E. Hopcroft, and Je#rey D. Ullman. Time and tape complexity of
