Computer Science - 1987

Cantor, D. G., & Kaltofen, E. (1987). Fast multiplication of polynomials over arbitrary rings (Technical Report No. 87-35). Troy, NY: Rensselaer Polytechnic Institute, Department of Computer Science.

Kaltofen, E., Krishnamoorthy, M. S., & Saunders, B. D. (1987). Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices. SIAM Journal on Algebraic Discrete Methods, 8(4), 683–690. https://doi.org/10.1137/0608057

Kaltofen, E. (1987). Computer Algebra Algorithms. Annual Review of Computer Science, 2(1), 91–118. https://doi.org/10.1146/annurev.cs.02.060187.000515

Kaltofen, E. (1987). Single-factor Hensel lifting and its application to the straight-line complexity of certain polynomials. Proceedings of the nineteenth annual ACM conference on Theory of computing  - STOC '87. Presented at the the nineteenth annual ACM conference. https://doi.org/10.1145/28395.28443

Kaltofen, E. (1987). Deterministic irreducibility testing of polynomials over large finite fields. Journal of Symbolic Computation, 4(1), 77–82. https://doi.org/10.1016/s0747-7171(87)80055-x

Doyle, J. (1987). Logic, rationality, and rational psychology. Computational Intell, 3(1), 175–176. https://doi.org/10.1111/j.1467-8640.1987.tb00190.x

Doyle, J. (1987). Admissible State Semantics for Representational Systems. The Knowledge Frontier, pp. 174–186. https://doi.org/10.1007/978-1-4612-4792-0_8

Gehringer, E. F., Siewiorek, D. P., & Segall, Z. Z. (1987). Parallel Processing: The Cm* Experience. Digital Press.

RASDORF, W. J., ULBERG, K. J., & BAUGH, J. W. (1987). A STRUCTURE-BASED MODEL OF SEMANTIC INTEGRITY CONSTRAINTS FOR RELATIONAL DATABASES. ENGINEERING WITH COMPUTERS, 2(1), 31–39. https://doi.org/10.1007/BF01200175