Computer Science - 1989 Kaltofen, E. (1989). Factorization of polynomials given by straight-line programs. In S. Micali (Ed.), Randomness and Computation, Advances in Computing Research (Vol. 5, pp. 375–412). Greenwhich, Connecticut: JAI Press Inc. Kaltofen, E. (1989, July). Parallel algebraic algorithm design. Presented at the 1989 International Symposium on Symbolic and Algebraic Computation, Portland, Oregon. Okamoto, T., & Matsuda, N. (1989). Learning to recognize students’ plan in geometry proof using intelligent CAI. Transactions of Information Processing Society of Japan, 30(8), 1046–1057. Kaltofen, E., & Yagati, L. (1989). Improved sparse multivariate polynomial interpolation algorithms. In Symbolic and Algebraic Computation (pp. 467–474). https://doi.org/10.1007/3-540-51084-2_44 Kaltofen, E., & Watt, S. M. (Eds.). (1989). Computers and Mathematics. https://doi.org/10.1007/978-1-4613-9647-5 Kaltofen, E. (1989). Computing the irreducible real factors and components of an algebraicf curve. In K. Mehlhorn (Ed.), Proceedings of the fifth annual symposium on Computational geometry - SCG '89 (pp. 79–87). https://doi.org/10.1145/73833.73842 Canny, J. F., Kaltofen, E., & Yagati, L. (1989). Solving systems of nonlinear polynomial equations faster. Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation - ISSAC '89. Presented at the the ACM-SIGSAM 1989 international symposium. https://doi.org/10.1145/74540.74556 Kaltofen, E., Krishnamoorthy, M. S., & Saunders, B. D. (1989). Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal form of polynomial matrices. In Lecture Notes in Computer Science (pp. 317–322). https://doi.org/10.1007/3-540-51517-8_134 Kaltofen, E., & Rolletschek, H. (1989). Computing greatest common divisors and factorizations in quadratic number fields. Mathematics of Computation, 53(188), 697–697. https://doi.org/10.1090/s0025-5718-1989-0982367-2 Kaltofen, E., Valente, T., & Yui, N. (1989). An improved Las Vegas primality test. Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation - ISSAC '89. Presented at the the ACM-SIGSAM 1989 international symposium. https://doi.org/10.1145/74540.74545 Stallmann, M. (1989). Course Outline: Course Announcement (Spring 1989) CSE/OR 691 I: Surviving Intractability. SIGACT News, 20(4), 74–77. https://doi.org/10.1145/74074.74086 Stallmann, M. F. (1989). Constrained planar embedding problems. Proceedings 27th Annual Allerton Conference on Communication, Control, and Computing, 58–67. Doyle, J. (1989). Constructive belief and rational representation. Computational Intell, 5(1), 1–11. https://doi.org/10.1111/j.1467-8640.1989.tb00311.x Reeves, D. S., Gehringer, E. F., & Chandiramani, A. (1989). Adaptive routing and deadlock recovery: a simulation study. Proceedings of the Fourth Conference on Hypercube Concurrent Computers and their Applications. Presented at the The Fourth Conference on Hypercube Concurrent Computers and their Applications, Monterey, CA. Chen, W.-K., Stallmann, M. F. M., & Gehringer, E. F. (1989). Hypercube embedding heuristics: An evaluation. International Journal of Parallel Programming, 18(6), 505–549. https://doi.org/10.1007/bf01381720 Baugh, J. W. J., & Rehak, D. R. (1989). Object-oriented design of finite element programs. 91–100. Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-0024863017&partnerID=MN8TOARS